On the size of shortest modal descriptions

We address the problems of separation and description in some fragments of modal logics. The former consists in finding a formula that is true in some given subset of the domain and false in another. The latter is a special case when one separates a singleton from the rest. We are interested in the...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Figueira, Santiago Daniel, Gorín, Daniel Alejandro
Publicado: 2010
Materias:
Ehrenfeucht-Fraïssé
Lower bound
Modal logic
Referring expression
Shortest formula size
Succinctness
Formula size
Lower bounds
Computational linguistics
Separation
Formal logic
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_19049872_v8_n_p120_Figueira
http://hdl.handle.net/20.500.12110/paper_19049872_v8_n_p120_Figueira
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares