Completeness for the modal -calculus: separating the combinatorics from the dynamics
DOI10.1016/J.TCS.2018.03.001zbMATH Open1391.68077OpenAlexW2795525569MaRDI QIDQ1749477FDOQ1749477
Authors: Sebastian Enqvist, F. Seifan, Yde Venema 
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
Recommendations
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Modal logic
- Automata and fixed point logic: a coalgebraic perspective
- Decidability of Second-Order Theories and Automata on Infinite Trees
- A finite model theorem for the propositional \(\mu\)-calculus
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Automata, logics, and infinite games. A guide to current research
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Coalgebraic logic
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Title not available (Why is that?)
- Results on the propositional \(\mu\)-calculus
- An axiomatization of full computation tree logic
- “Sometimes” and “not never” revisited
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Alternating automata on infinite trees
- Title not available (Why is that?)
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Title not available (Why is that?)
- An automata theoretic decision procedure for the propositional mu- calculus
- Automata for the modal \(\mu \)-calculus and related results
- An elementary proof of the completeness of PDL
- A game semantics for linear logic
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Solving Sequential Conditions by Finite-State Strategies
- Completeness for flat modal fixpoint logics
- Completions of \(\mu \)-algebras
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- Title not available (Why is that?)
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Title not available (Why is that?)
- Canonical completeness of infinitary \(\mu \)
- An algebraic theory of normal forms
- Rudiments of \(\mu\)-calculus
- Spatial logic of tangled closure operators and modal mu-calculus
- PSPACE bounds for rank-1 modal logics
- Title not available (Why is that?)
- Automata for coalgebras: an approach using predicate liftings
- Title not available (Why is that?)
- Free \(\mu\)-lattices
- Games for the \(\mu\)-calculus
- Title not available (Why is that?)
- CONCUR 2004 - Concurrency Theory
- Rank-1 modal logics are coalgebraic
- Completeness for coalgebraic fixpoint logic
- Probabilistic Modal μ-Calculus with Independent Product
- Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
- Constructive completeness for the linear-time \(\mu \)-calculus
- An expressive completeness theorem for coalgebraic modal \(\mu\)-calculi
Cited In (13)
- Sequent calculi for the modal \(\mu \)-calculus over S5
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Completeness of continuation models for \(\lambda_\mu\)-calculus
- Small infinitary epistemic logics
- Duality and the completeness of the modal \(\mu\)-calculus
- Title not available (Why is that?)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Canonical completeness of infinitary \(\mu \)
- Towards completeness via proof search in the linear time \(\mu\)-calculus: the case of Büchi inclusions
- On the size of disjunctive formulas in the \(\mu\)-calculus
- Completeness for coalgebraic fixpoint logic
- An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
- Automata for the modal \(\mu \)-calculus and related results
This page was built for publication: Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749477)
