Characterization, definability and separation via saturated models

DOI10.1016/J.TCS.2014.02.047zbMATH Open1323.03016OpenAlexW2116164700MaRDI QIDQ2453534FDOQ2453534

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

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

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)

Cites Work

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

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)