Completeness for \(\mu\)-calculi: a coalgebraic approach

DOI10.1016/j.apal.2018.12.004zbMath1443.03012OpenAlexW2908449277MaRDI QIDQ1731842

Sebastian Enqvist, Yde Venema, Fatemeh Seifan

Publication date: 14 March 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2018.12.004

Mathematics Subject Classification ID

Games involving graphs (91A43) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Categorical logic, topoi (03G30)

Related Items (2)

The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Hennessy-Milner and van Benthem for instantial neighbourhood logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness for flat modal fixpoint logics
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Results on the propositional \(\mu\)-calculus
• Completions of \(\mu \)-algebras
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Automata, logics, and infinite games. A guide to current research
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Lax extensions of coalgebra functors and their logic
• A finite model construction for coalgebraic modal logic
• Simulations and Bisimulations for Coalgebraic Modal Logics
• Completeness for the coalgebraic cover modality
• PSPACE bounds for rank-1 modal logics
• Rank-1 Modal Logics are Coalgebraic
• Automata for the modal μ-calculus and related results
• Flat Coalgebraic Fixed Point Logics
• Automata for Coalgebras: An Approach Using Predicate Liftings
• EXPTIME Tableaux for the Coalgebraic μ-Calculus
• Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• Completeness for coalgebraic fixpoint logic
• CONCUR 2004 - Concurrency Theory
• Rudiments of \(\mu\)-calculus
• Functors for coalgebras
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: Completeness for \(\mu\)-calculi: a coalgebraic approach