Proof systems for the modal -calculus obtained by determinizing automata
From MaRDI portal
Publication:6541156
Cites work
- scientific article; zbMATH DE number 1956528 (Why is no real title available?)
- scientific article; zbMATH DE number 7561613 (Why is no real title available?)
- scientific article; zbMATH DE number 7297836 (Why is no real title available?)
- A focus system for the alternation-free \(\mu \)-calculus
- A tableau system for the modal \(\mu \)-calculus
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Automata for the modal \(\mu \)-calculus and related results
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Constructive completeness for the linear-time \(\mu \)-calculus
- Cyclic arithmetic is equivalent to Peano arithmetic
- Cyclic proofs for the first-order \(\mu\)-calculus
- Deciding parity games in quasipolynomial time
- Deciding the unguarded modal \(\mu\)-calculus
- Games for the -calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- On the proof theory of the modal mu-calculus
- Profile trees for Büchi word automata, with application to determinization
- Results on the propositional \(\mu\)-calculus
- The Complexity of Tree Automata and Logics of Programs
- Unifying Büchi complementation constructions
This page was built for publication: Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541156)
