David Baelde
2009
Least and greatest fixed points in linear logic
CoRR
abs/0910.3383v4
http://arxiv.org/abs/0910.3383v4
Kai Brünnler
Thomas Studer
2009
Syntactic cut-elimination for common knowledge
Annals of Pure and Applied Logic
160
1
82–95
10.1016/j.apal.2009.01.014
Kai Brünnler
Thomas Studer
preprint
Syntactic cut-elimination for a fragment of the modal mu-calculus
Wilfried Buchholz
1981
The Ω_μ+1-rule
Wilfried Buchholz
Solomon Feferman
Wolfram Pohlers
Wilfried Sieg
Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof Theoretic Studies
Lecture Notes in Mathematics
897
Springer
189–233
10.1007/BFb0091898
Wilfried Buchholz
2001
Explaining the Gentzen-Takeuti reduction steps: a second-order system
Archive for Mathematical Logic
40
4
255–272
10.1007/s001530000064
Wilfried Buchholz
Kurt Schütte
1988
Proof Theory of Impredicative Subsystems of Analysis
Bibliopolis
Brian Hill
Francesca Poggiolesi
2010
A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic
Studia Logica
94
1
47–72
10.1007/s11225-010-9224-z
Gerhard Jäger
Mathis Kretz
Thomas Studer
2008
Canonical completeness for infinitary μ
Journal of Logic and Algebraic Programming
76
2
270–292
10.1016/j.jlap.2008.02.005
Gerhard Jäger
Thomas Studer
2011
A Buchholz rule for modal fixed point logics
Logica Universalis
5
1–19
10.1007/s11787-010-0022-1
Dexter Kozen
1988
A finite model theorem for the propositional μ–calculus
Studia Logica
47
3
233–241
10.1007/BF00370554
Grigori Mints
to appear
Effective Cut-elimination for a fragment of Modal mu-calculus
Studia Logica
Regimantas Pliuskevicius
1991
Investigation of Finitary Calculus for a Discrete Linear Time Logic by means of Infinitary Calculus
Baltic Computer Science, Selected Papers
Springer
504–528
10.1007/BFb0019366
Gaisi Takeuti
1987
Proof Theory
North-Holland
Alwen Tiu
Alberto Momigliano
2010
Cut Elimination for a Logic with Induction and Co-induction
CoRR
abs/1009.6171v1
http://arxiv.org/abs/1009.6171v1