The Undecidability of k-Provability (1989)

by Samuel R. Buss
Venue:Annals of Pure and Applied Logic
Citations:25 - 0 self

Documents Related by Co-Citation

85 A system of interaction and structure – Alessio Guglielmi - 2004
31 On the Proof Complexity of Deep Inference – Paola Bruscoli, Alessio Guglielmi - 2000
332 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
47 Brünnler and Alwen Fernanto Tiu. A local system for classical logic – Kai - 2001
49 Deep Inference and Symmetry for Classical Proofs – Kai Brünnler - 2003
567 Untersuchungen über das logische Schliessen – G Gentzen - 1934
55 Non-commutativity and MELL in the Calculus of Structures – Alessio Guglielmi, Lutz Straßburger - 2001
23 Normalisation control in deep inference via atomic flows – Alessio Guglielmi, Tom Gundersen - 2008
38 Bounds for proof search and speed-up in the predicate calculus – R Statman - 1999
37 Linear Logic and Noncommutativity in the Calculus of Structures – Lutz Straßburger, Technischen Universität Dresden, Diplom-informatiker Lutz Straßburger, Betreuer Dr. Alessio Guglielmi, Dr. François Lamarche - 2003
29 Proof nets for classical logic – E P Robinson
9 Proof Theory. Studies in Logic 81 – G Takeuti - 1987
21 Lower bounds for increasing complexity of derivations after cut elimination – V P Orevkov - 1979
10 Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination – A Carbone, S Semmes - 1997
14 Proof Theory and Logical Complexity, volume 1 – J-Y Girard - 1987
12 Structures for multiplicative cyclic linear logic: Deepness vs cyclicity – Pietro Di Gianantonio - 2004
132 The structure of multiplicatives – V Danos, L Regnier - 1989
16 Polarized Proof-Nets: Proof-Nets for LC (Extended Abstract) – Olivier Laurent - 1999
210 Closed categories – S Eilenberg, G M Kelly - 1966