Abstract
A non-effective cut-elimination proof for modal mu-calculus has been given by G. Jäger, M. Kretz and T. Studer. Later an effective proof has been given for a subsystem M 1 with non-iterated fixpoints and positive endsequents. Using a new device we give an effective cut-elimination proof for M 1 without restriction to positive sequents.
Similar content being viewed by others
References
Brünnler K., Studer T.: ‘Syntactic cut-elimination for common knowledge’. Annals Pure and Applied Logic 160(1), 82–85 (2009)
Buchholz W.: ‘Explaining the Gentzen-Takeuti Reduction Steps: a Second-order System’. Archive for Mathematical Logic 40(4), 255–272 (2001)
Jäger G., Studer T.: ‘A Buchholz Rule for Modal Fixed Point Logics’. Logica Universalis 5(1), 1–19 (2011)
Jäger G., Kretz M., Studer T.: ‘Canonical Completeness of Infinitary μ’. Journal of Logic and Algebraic Programming 76(2), 270–292 (2008)
Kozen D.: ‘A Finite Model Theorem for the Propositional μ-calculus’. Studia Logica 47(3), 233–241 (1988)
Mints, G., ‘Finite Investigation of Infinite Derivations’, J. Soviet Mathematics 10:548–596, 1978, (Russian original 1975). Reprinted in G. Mints, Select Papers in Proof Theory, North-Holland-Bibliopolis, 1992.
Akiyoshi, R., and G. Mints, ‘Analysis and Extension of Omega-rule’, accepted by Archive for Mathematical logic.
Pohlers, W., Proof Theory, Springer 2009.
Takeuti, G., Proof Theory, North Holland 1987.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Leo Esakia
Rights and permissions
About this article
Cite this article
Mints, G. Effective Cut-elimination for a Fragment of Modal mu-calculus. Stud Logica 100, 279–287 (2012). https://doi.org/10.1007/s11225-012-9378-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-012-9378-y