Characterization, definability and separation via saturated models

DOI10.1016/j.tcs.2014.02.047zbMath1323.03016OpenAlexW2116164700MaRDI QIDQ2453534

Carlos Areces, Santiago Figueira, Facundo Carreiro

Publication date: 10 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.047

zbMATH Keywords

simulationcharacterizationmodel theorydefinabilityseparationsaturationmodal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items

Model theory of XPath on data trees. II: Binary bisimulation and definability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness results for memory logics
• Modal characterisation theorems over special classes of frames
• Results on the propositional \(\mu\)-calculus
• Bisimulations for temporal logic
• Modal logic over finite structures
• Multi-dimensional modal logic
• Model theory
• Expressiveness of concept expressions in first-order description logics
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Rank-1 Modal Logics are Coalgebraic
• THE EXPRESSIVE POWER OF MEMORY LOGICS
• On Characterization, Definability and ω-Saturated Models
• Expressive Power and Decidability for Memory Logics
• Coalgebraic Correspondence Theory
• Using the Universal Modality: Gains and Questions
• The modal logic of inequality
• Simulating without Negation
• Model Theory
• The Description Logic Handbook
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic