On Characterization, Definability and ω-Saturated Models
From MaRDI portal
Publication:3105745
DOI10.1007/978-3-642-23283-1_7zbMath1351.03011arXiv1011.4718OpenAlexW51832705MaRDI QIDQ3105745
Publication date: 6 January 2012
Published in: Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.4718
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
- Results on the propositional \(\mu\)-calculus
- Bisimulations for temporal logic
- Model theory
- Characterizations of negative definability in modal logic
- THE EXPRESSIVE POWER OF MEMORY LOGICS
- Expressive Power and Decidability for Memory Logics
- Using the Universal Modality: Gains and Questions
- The modal logic of inequality
- Simulating without Negation
- Origins of bisimulation and coinduction