B. Afshari and G. Leigh, Cut-free Completeness for Modal Mu-Calculus, Proceedings of LICS 2017, pp.1-12, 2017.

D. Baelde, A. Doumane, and A. Saurin, Infinitary Proof Theory: the Multiplicative Additive Case, Proceedings of 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), vol.62, p.17, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01339037

S. Berardi and S. Steila, An intuitionistic version of Ramseys Theorem and its use in Program Termination, Annals of Pure and Applied Logic, vol.166, pp.1382-1406, 2015.

S. Berardi and M. Tatsuta, Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proof System, Proceedings of FoSSaCS 2017, vol.10203, pp.301-317, 2017.

S. Berardi and M. Tatsuta, Equivalence of Inductive Definitions and Cyclic Proofs under Arithmetic, Proceedings of Thirty-Second Annual IEEE Symposium on Logic in Computer Science (LICS2017, pp.1-12, 2017.

S. Berardi and M. Tatsuta, Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic, 2017.

J. Brotherston, Cyclic Proofs for First-Order Logic with Inductive Definitions, Proceedings of TABLEAUX 2005, 2005.

J. Brotherston, Sequent calculus proof systems for inductive definitions, PhD. thesis, 2006.

J. Brotherston, R. Bornat, and C. Calcagno, Cyclic Proofs of Program Termination in Separation Logic, Proceedings of POPL 2008, 2008.

J. Brotherston, D. Distefano, and R. L. Petersen, Automated Cyclic Entailment Proofs in Separation Logic, Proceedings of CADE-23, 2011.

J. Brotherston and A. Simpson, Sequent calculi for induction and infinite descent, Journal of Logic and Computation, vol.21, issue.6, pp.1177-1216, 2011.

J. Brotherston, N. Gorogiannis, and R. L. Petersen, A Generic Cyclic Theorem Prover, Proceedings of APLAS 2012, 2012.

A. Doumane, D. Baelde, L. Hirschi, and A. Saurin, Towards completeness via proof search in the linear time µ-calculus, Proceedings of LICS 2016, pp.377-386, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01275289

A. Doumane, Constructive completeness for the linear-time µ-calculus, Proceedings of LICS 2017, pp.1-12, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01430737

J. Fortier and L. Santocanale, Cuts for circular proofs: semantics and cutelimination, Proceedings of Computer Science Logic 2013 (CSL 2013), vol.23, pp.248-262, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01260986

C. G. Jockusch, Jr, Ramsey's theorem and recursion theory, Journal of Symbolic Logic, vol.37, issue.2, pp.268-280, 1972.

D. Kozen, Results on the propositional mu-calculus, Theoretical Computer Science, vol.27, pp.333-354, 1983.

P. Martin-löf, Haupstatz for the intuitionistic theory of iterated inductive definitions, Proceedings of the Second Scandinavian Logic Symposium, pp.179-216, 1971.

D. Niwi´nskiniwi´nski and I. Walukiewicz, Games for the µ-calculus, Theoretical Computer Science, vol.163, pp.99-116, 1997.

A. Podelski and A. Rybalchenko, Transition Invariants, Proceedings of 19th IEEE Symposium on Logic in Computer Science (LICS, pp.32-41, 2004.

J. R. Shoenfield, Mathematical Logic, 1967.

A. Simpson, Cyclic Arithmetic is Equivalent to Peano Arithmetic, Proceedings of FoSSaCS 2017, pp.283-300, 2017.
DOI : 10.1007/978-3-662-54458-7_17

I. Walukiewicz, Completeness of Kozens axiomatisation of the propositional µcalculus, Information and Computation, vol.157, pp.142-182, 2000.