The Undecidability of k-Provability (1989)

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

Documents Related by Co-Citation

87 A system of interaction and structure – Alessio Guglielmi - 2004
330 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
51 Brünnler and Alwen Fernanto Tiu. A local system for classical logic – Kai - 2001
565 Untersuchungen über das logische Schließen – G Gentzen - 1935
31 On the Proof Complexity of Deep Inference – Paola Bruscoli, Alessio Guglielmi - 2000
51 Deep Inference and Symmetry for Classical Proofs – Kai Brünnler - 2003
58 Non-commutativity and MELL in the Calculus of Structures – Alessio Guglielmi, Lutz Straßburger - 2001
37 Bounds for proof-search and speed-up in the predicate calculus – Richard Statman - 1978
9 Proof Theory. Studies in Logic 81 – G Takeuti - 1987
10 Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination – A Carbone, S Semmes - 1997
21 Lower bounds for increasing complexity of derivations after cut elimination – V P Orevkov - 1979
14 Proof Theory and Logical Complexity, volume 1 – J-Y Girard - 1987
23 Normalisation control in deep inference via atomic flows – Alessio Guglielmi, Tom Gundersen - 2008
13 Structures for multiplicative cyclic linear logic: Deepness vs cyclicity – Pietro Di Gianantonio - 2004
38 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
5 cut elimination and flow graphs for the propositional calculus – Interpolants - 1997
29 Proof nets for classical logic – E P Robinson
214 Closed categories – Samuel Eilenberg, G Max Kelly - 1965
24 Naming proofs in classical propositional logic – François Lamarche, Lutz Straßburger