Local Validity for Circular Proofs in Linear Logic with Fixed Points
暂无分享,去创建一个
[1] Alexis Saurin,et al. Infinitary proof theory : the multiplicative additive case , 2018 .
[2] Amina Doumane,et al. On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes) , 2017 .
[3] James Brotherston,et al. Sequent calculi for induction and infinite descent , 2011, J. Log. Comput..
[4] Martin Hofmann,et al. A Proof System for the Linear Time µ-Calculus , 2006, FSTTCS.
[5] Makoto Tatsuta,et al. Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System , 2017, FoSSaCS.
[6] Luigi Santocanale,et al. A Calculus of Circular Proofs and Its Categorical Semantics , 2001, FoSSaCS.
[7] J. Brotherston. Sequent calculus proof systems for inductive definitions , 2006 .
[8] Igor Walukiewicz,et al. Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[9] L. Hirschi,et al. Towards Completeness via Proof Search in the Linear Time mu-Calculus , 2016 .
[10] David Baelde. On the Proof Theory of Regular Fixed Points , 2009, TABLEAUX.
[11] Pierre Clairambault,et al. Least and Greatest Fixpoints in Game Semantics , 2009, FICS.
[12] James Brotherston,et al. Complete Sequent Calculi for Induction and Infinite Descent , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[13] James Brotherston,et al. A Generic Cyclic Theorem Prover , 2012, APLAS.
[14] Vincent Danos,et al. The structure of multiplicatives , 1989, Arch. Math. Log..
[15] Igor Walukiewicz. On completeness of the mu -calculus , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[16] David Baelde,et al. Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.
[17] Graham Emil Leigh,et al. Cut-free completeness for modal mu-calculus , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[18] Makoto Tatsuta,et al. Equivalence of inductive definitions and cyclic proofs under arithmetic , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[19] Luigi Santocanale,et al. Cuts for circular proofs , 2013, TACL.