Atomic Cut Elimination for classical Logic
暂无分享,去创建一个
[1] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Alessio Guglielmi,et al. A Calculus of Order and Interaction , 1999 .
[3] Michel Parigot,et al. Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.
[4] Helmut Schwichtenberg,et al. Basic proof theory , 1996, Cambridge tracts in theoretical computer science.
[5] Frank Pfenning,et al. Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.
[6] Lutz Straßburger,et al. A Local System for Linear Logic , 2002, LPAR.
[7] Paola Bruscoli. A Purely Logical Account of Sequentiality in Proof Search , 2002, ICLP.
[8] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[9] Frank Wolter,et al. Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.
[10] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[11] Lutz Straßburger,et al. MELL in the calculus of structures , 2003, Theor. Comput. Sci..
[12] Lutz Straßburger,et al. Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.
[13] Jean Gallier,et al. Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi , 1993, Theor. Comput. Sci..
[14] Alwen Tiu,et al. A Local System for Classical Logic , 2001, LPAR.