Proof systems for the modal -calculus obtained by determinizing automata
From MaRDI portal
Publication:6541156
DOI10.1007/978-3-031-43513-3_14MaRDI QIDQ6541156FDOQ6541156
Authors: Maurice Dekker, Johannes Kloibhofer, Johannes Marti, Yde Venema 
Publication date: 17 May 2024
derivation systemModal mu-calculusdeterminisation of Büchi and parity automatanon-wellfounded and cyclic proofs
Cites Work
- The Complexity of Tree Automata and Logics of Programs
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Results on the propositional \(\mu\)-calculus
- Title not available (Why is that?)
- 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.
- On the proof theory of the modal mu-calculus
- A focus system for the alternation-free \(\mu \)-calculus
- Title not available (Why is that?)
- Games for the \(\mu\)-calculus
- Unifying Büchi complementation constructions
- Profile trees for Büchi word automata, with application to determinization
- Title not available (Why is that?)
- Deciding the unguarded modal \(\mu\)-calculus
- Deciding parity games in quasipolynomial time
- Constructive completeness for the linear-time \(\mu \)-calculus
- A tableau system for the modal \(\mu \)-calculus
- Cyclic arithmetic is equivalent to Peano arithmetic
- Cyclic proofs for the first-order \(\mu\)-calculus
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)
