Effective cut-elimination for a fragment of modal mu-calculus
From MaRDI portal
Publication:454366
DOI10.1007/S11225-012-9378-YzbMATH Open1254.03110OpenAlexW2032188971MaRDI QIDQ454366FDOQ454366
Publication date: 1 October 2012
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-012-9378-y
Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44) Logic in computer science (03B70)
Cites Work
- A finite model theorem for the propositional \(\mu\)-calculus
- Proof theory. 2nd ed
- An extension of the omega-rule
- Explaining the Gentzen-Takeuti reduction steps: A second-order system
- Proof theory. The first step into impredicativity
- Syntactic cut-elimination for common knowledge
- A Buchholz rule for modal fixed point logics
- Canonical completeness of infinitary \(\mu \)
Cited In (3)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On model checking for the \(\mu\)-calculus and its fragments π π
- On the universal and existential fragments of the \(\mu\)-calculus π π
- On the proof theory of the modal mu-calculus π π
- A Buchholz rule for modal fixed point logics π π
- A focus system for the alternation-free \(\mu \)-calculus π π
- Logic for Programming, Artificial Intelligence, and Reasoning π π
This page was built for publication: Effective cut-elimination for a fragment of modal mu-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454366)