Modular Games for Coalgebraic Fixed Point Logics

DOI10.1016/j.entcs.2008.05.020zbMath1279.03056OpenAlexW2107807291MaRDI QIDQ2873663

Mehrnoosh Sadrzadeh, Corina Cîrstea

Publication date: 24 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.05.020

zbMATH Keywords

modal logiccoalgebraparity gamesfixed point logic

Mathematics Subject Classification ID

Games involving graphs (91A43) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items

Coinductive predicates and final sequences in a fibration ⋮ Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics ⋮ Maximal traces and path-based coalgebraic temporal logics ⋮ EXPTIME Tableaux for the Coalgebraic μ-Calculus ⋮ Coinductive predicates and final sequences in a fibration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A compositional approach to defining logics for coalgebras
• Results on the propositional \(\mu\)-calculus
• Coalgebraic logic
• A logic for reasoning about time and reliability
• Fixed point characterization of infinite behavior of finite-state systems
• Automata, logics, and infinite games. A guide to current research
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Logics for epistemic programs
• Modular construction of complete coalgebraic logics
• Automata and fixed point logic: a coalgebraic perspective
• Automata for the modal μ-calculus and related results
• Coalgebraic Epistemic Update Without Change of Model
• Anytime, anywhere
• Foundations of Software Science and Computational Structures
• Decidability of DPDA equivalence
• Alternating tree automata, parity games, and modal \(\mu\)-calculus