Completeness for the modal -calculus: separating the combinatorics from the dynamics
From MaRDI portal
(Redirected from Publication:1749477)
Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Recommendations
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3880483 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1163983 (Why is no real title available?)
- scientific article; zbMATH DE number 1765663 (Why is no real title available?)
- scientific article; zbMATH DE number 922620 (Why is no real title available?)
- scientific article; zbMATH DE number 7297836 (Why is no real title available?)
- scientific article; zbMATH DE number 3349291 (Why is no real title available?)
- A finite model theorem for the propositional \(\mu\)-calculus
- A game semantics for linear logic
- Alternating automata on infinite trees
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- An algebraic theory of normal forms
- An automata theoretic decision procedure for the propositional mu- calculus
- An axiomatization of full computation tree logic
- An elementary proof of the completeness of PDL
- An expressive completeness theorem for coalgebraic modal \(\mu\)-calculi
- Automata and fixed point logic: a coalgebraic perspective
- Automata for coalgebras: an approach using predicate liftings
- Automata for the modal \(\mu \)-calculus and related results
- Automata, logics, and infinite games. A guide to current research
- CONCUR 2004 - Concurrency Theory
- CTL^* and ECTL^* as fragments of the modal -calculus
- Canonical completeness of infinitary \(\mu \)
- Coalgebraic logic
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Completeness for coalgebraic fixpoint logic
- Completeness for flat modal fixpoint logics
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Completions of \(\mu \)-algebras
- Constructive completeness for the linear-time \(\mu \)-calculus
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Free \(\mu\)-lattices
- Games for the -calculus
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Modal logic
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- PSPACE bounds for rank-1 modal logics
- Probabilistic Modal μ-Calculus with Independent Product
- Rank-1 modal logics are coalgebraic
- Results on the propositional \(\mu\)-calculus
- Rudiments of \(\mu\)-calculus
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Solving Sequential Conditions by Finite-State Strategies
- Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
- Spatial logic of tangled closure operators and modal mu-calculus
- Weak Second‐Order Arithmetic and Finite Automata
- “Sometimes” and “not never” revisited
Cited in
(13)- Automata for the modal \(\mu \)-calculus and related results
- 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 -calculus
- scientific article; zbMATH DE number 7297836 (Why is no real title available?)
- 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
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)
