Syntactic cut-elimination for a fragment of the modal mu-calculus

DOI10.1016/J.APAL.2012.04.006MaRDI QIDQ714717zbMATH OpenOpenAlexFDO

Authors Kai Brünnler, Thomas Studer

Publication date 11 October 2012

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2012.04.006

zbMATH Keywords

mu-calculuscut eliminationnested sequentsinfinitary sequent system

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Effective cut-elimination for a fragment of modal mu-calculus
• scientific article; zbMATH DE number 7297836
• On the proof theory of the modal mu-calculus
• Continuous Fragment of the mu-Calculus
• Canonical completeness of infinitary \(\mu \)

Cites work

• scientific article; zbMATH DE number 4210108 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1215496 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 847946 (Why is no real title available?)
• scientific article; zbMATH DE number 3252193 (Why is no real title available?)
• scientific article; zbMATH DE number 7324390 (Why is no real title available?)
• A contraction-free and cut-free sequent calculus for propositional dynamic logic
• A finite model theorem for the propositional \(\mu\)-calculus
• Canonical completeness of infinitary \(\mu \)
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Continuous Fragment of the mu-Calculus
• Cut elimination for a logic with induction and co-induction
• Cut-free sequent calculi for some tense logics
• Deep sequent systems for modal logic
• Games for the \(\mu\)-calculus
• Modal logics and mu-calculi: An introduction
• Proof theory. An introduction
• Results on the propositional \(\mu\)-calculus
• Syntactic cut-elimination for common knowledge
• Syntactic cut-elimination for common knowledge
• The Method of Tree-Hypersequents for Modal Propositional Logic
• The variable hierarchy of the \(\mu\)-calculus is strict

Cited in

(10)

• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• Continuous Fragment of the mu-Calculus
• Justifying induction on modal \(\mu\)-formulae
• A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points
• On modal \(\mu \)-calculus and Gödel-Löb logic
• A Note on Negative Tagging for Least Fixed-Point Formulae
• Intuitionistic common knowledge or belief
• Syntactic cut-elimination for common knowledge
• The proof theory of common knowledge
• Small infinitary epistemic logics

This page was built for publication: Syntactic cut-elimination for a fragment of the modal mu-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714717)