Show simple item record

dc.contributor.authorAreces, Carlos Eduardo
dc.contributor.authorCarreiro, Facundo
dc.contributor.authorFigueira, Santiago
dc.identifier.citationAreces, C. E., Carreiro, F. y Figueira, S. (2014). Characterization, definability and separation via saturated models. Theoretical Computer Science, 537, 72-86.
dc.description.abstractThree important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions under which a class of L-models can be defined by a formula or a set of formulas of L), and the Separation Theorem (that provides conditions under which two disjoint classes of L-models can be separated by a class definable in L). We provide general conditions under which these results can be established for a given choice of model class and modal language whose expressivity is below first order logic. Besides some basic constraints that most modal logics easily satisfy, the fundamental condition that we require is that the class of ω-saturated models in question has the Hennessy-Milner property with respect to the notion of observational equivalence under consideration. Given that the Characterization, Definability and Separation theorems are among the cornerstones in the model theory of L, this property can be seen as a test that identifies the adequate notion of observational equivalence for a particular modal logic.en
dc.format.mediumImpreso; Electrónico y/o Digital
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.sourceISSN 0304-3975
dc.subjectModal logicsen
dc.subjectModel theoryen
dc.titleCharacterization, definability and separation via saturated modelsen
dc.description.filFil: Areces, Carlos Eduardo. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física;
dc.description.filFil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas;
dc.description.filFil: Carreiro, Facundo. Universidad de Ámsterdam. Instituto de Lógica, Lenguaje y Computación; Países
dc.description.filFil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación;
dc.description.filFil: Figueira, Santiago. Consejo Nacional de Investigaciones Científicas y Técnicas;
dc.journal.countryPaíses Bajoses
dc.journal.titleTheoretical Computer Scienceen
dc.description.fieldCiencias de la Computación

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 International
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International