Effective Cut-elimination for a Fragment of Modal mu-calculus

Studia Logica 100 (1-2):279-287 (2012)

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
Keywords modal mu-calculus  cut-elimination
Categories (categorize this paper)
DOI 10.1007/s11225-012-9378-y
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 43,044
Through your library

References found in this work BETA

Syntactic Cut-Elimination for Common Knowledge.Kai Brünnler & Thomas Studer - 2009 - Annals of Pure and Applied Logic 160 (1):82-95.

Add more references

Citations of this work BETA

An Extension of the Omega-Rule.Ryota Akiyoshi & Grigori Mints - 2016 - Archive for Mathematical Logic 55 (3-4):593-603.

Add more citations

Similar books and articles


Added to PP index

Total views
16 ( #516,331 of 2,260,175 )

Recent downloads (6 months)
3 ( #493,552 of 2,260,175 )

How can I increase my downloads?


My notes

Sign in to use this feature