Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics

DOI10.1016/j.tcs.2018.03.001zbMath1391.68077OpenAlexW2795525569MaRDI QIDQ1749477

Fatemeh Seifan, Yde Venema, Sebastian Enqvist

Publication date: 17 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.001

zbMATH Keywords

completenessinfinite gamesmodal mu-calculusparity automatamodal fixpoint logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ SMALL INFINITARY EPISTEMIC LOGICS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spatial logic of tangled closure operators and modal mu-calculus
• Completeness for flat modal fixpoint logics
• Games for the \(\mu\)-calculus
• 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
• Canonical completeness of infinitary \(\mu \)
• Alternating automata on infinite trees
• A finite model theorem for the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• An elementary proof of the completeness of PDL
• A game semantics for linear logic
• Coalgebraic logic
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• An algebraic theory of normal forms
• 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
• Automata and fixed point logic: a coalgebraic perspective
• An axiomatization of full Computation Tree Logic
• PSPACE bounds for rank-1 modal logics
• Probabilistic Modal μ-Calculus with Independent Product
• Rank-1 Modal Logics are Coalgebraic
• Weak Second‐Order Arithmetic and Finite Automata
• Automata for the modal μ-calculus and related results
• Automata for Coalgebras: An Approach Using Predicate Liftings
• “Sometimes” and “not never” revisited
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
• Completeness for coalgebraic fixpoint logic
• CONCUR 2004 - Concurrency Theory
• Solving Sequential Conditions by Finite-State Strategies
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Rudiments of \(\mu\)-calculus
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Free \(\mu\)-lattices
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

This page was built for publication: Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics