Equality and fixpoints in the calculus of structures
暂无分享,去创建一个
[1] Tom Gundersen,et al. A Proof Calculus Which Reduces Syntactic Bureaucracy , 2010, RTA.
[2] Kaustuv Chaudhuri. Subformula Linking as an Interaction Method , 2013, ITP.
[3] Lutz Straßburger,et al. Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic , 2009, TLCA.
[4] John Harrison,et al. Handbook of Practical Logic and Automated Reasoning , 2009 .
[5] Claude Kirchner,et al. Theorem Proving Modulo , 2003, Journal of Automated Reasoning.
[6] Claude Kirchner,et al. Principles of Superdeduction , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[7] David Baelde,et al. Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.
[8] James Brotherston,et al. Sequent calculi for induction and infinite descent , 2011, J. Log. Comput..
[9] J. Hannan,et al. A logical framework for reasoning about logical specifications , 2004 .
[10] Gopalan Nadathur,et al. A Two-Level Logic Approach to Reasoning About Computations , 2011, Journal of Automated Reasoning.
[11] Jason Reed,et al. Higher-order constraint simplification in dependent type theory , 2009, LFMTP '09.
[12] Lutz Straßburger,et al. Linear logic and noncommutativity in the calculus of structures , 2003 .
[13] Peter Schroeder-Heister,et al. Rules of definitional reflection , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[14] Lutz Straßburger,et al. The Focused Calculus of Structures , 2011, CSL.
[15] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .
[16] Gopalan Nadathur,et al. The Bedwyr System for Model Checking over Syntactic Expressions , 2007, CADE.
[17] Nicolas Guenot,et al. Nested Deduction in Logical Foundations for Computation , 2013 .