Characterization, definability and separation via saturated models

DOI10.1016/J.TCS.2014.02.047MaRDI QIDQ2453534zbMATH OpenOpenAlexFDO

Authors Carlos Areces, Facundo Carreiro, Santiago Figueira

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

simulationsaturationcharacterizationmodal logicsmodel theoryseparationdefinability

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)

Recommendations

• On characterization, definability and \(\omega \)-saturated models
• Some characterization and preservation theorems in modal logic
• Modal logics definable by universal three-variable formulas
• Towards a generalization of modal definability
• ON DEFINABILITY IN MULTIMODAL LOGIC

Cites work

• scientific article; zbMATH DE number 1749143 (Why is no real title available?)
• scientific article; zbMATH DE number 3271460 (Why is no real title available?)
• Bisimulation invariance and finite models
• Bisimulations for temporal logic
• Coalgebraic Correspondence Theory
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Completeness results for memory logics
• Expressive Power and Decidability for Memory Logics
• Expressiveness of concept expressions in first-order description logics
• Modal characterisation theorems over special classes of frames
• Modal logic
• Modal logic over finite structures
• Model Theory
• Model theory
• Multi-dimensional modal logic
• On characterization, definability and \(\omega \)-saturated models
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• Rank-1 modal logics are coalgebraic
• Results on the propositional \(\mu\)-calculus
• Simulating without Negation
• The Description Logic Handbook
• The expressive power of memory logics
• The modal logic of inequality
• The ultraproduct construction
• Using the Universal Modality: Gains and Questions

Cited in

(3)

• On characterization, definability and \(\omega \)-saturated models
• A characterization theorem for injective model classes axiomatized by general rules
• Model theory of XPath on data trees. II: Binary bisimulation and definability

This page was built for publication: Characterization, definability and separation via saturated models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453534)