- (1 other version)Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.details
|
|
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.details
|
|
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.details
|
|
Quantified propositional calculus and a second-order theory for NC1.Stephen Cook & Tsuyoshi Morioka - 2005 - Archive for Mathematical Logic 44 (6):711-749.details
|
|
(1 other version)Implicit Proofs.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (2):387 - 397.details
|
|
(1 other version)Implicit proofs.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (2):387-397.details
|
|
(1 other version)Tautologies From Pseudo-random Generators, By, Pages 197 -- 212.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.details
|
|
Simulating non-prenex cuts in quantified propositional calculus.Emil Jeřábek & Phuong Nguyen - 2011 - Mathematical Logic Quarterly 57 (5):524-532.details
|
|
(2 other versions)reputation among logicians as being essentially trivial. I hope to convince the reader that it presents some of the most challenging and intriguing problems in modern logic. Although the problem of the complexity of propositional proofs is very natural, it has been investigated systematically only since the late 1960s. [REVIEW]Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
(2 other versions)The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
(1 other version)Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.details
|
|
(1 other version)Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.details
|
|
(1 other version)Witnessing functions in bounded arithmetic and search problems.Mario Chiari & Jan Krajíček - 1998 - Journal of Symbolic Logic 63 (3):1095-1115.details
|
|
(1 other version)Witnessing functions in bounded arithmetic and search problems.Mario Chiari & Jan Krajíček - 1998 - Journal of Symbolic Logic 63 (3):1095-1115.details
|
|
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.Neil Thapen - 2011 - Archive for Mathematical Logic 50 (7):665-680.details
|
|
Fragments of bounded arithmetic and the lengths of proofs.Pavel Pudl'ak - 2008 - Journal of Symbolic Logic 73 (4):1389-1406.details
|
|
On the finite axiomatizability of.Chris Pollett - 2018 - Mathematical Logic Quarterly 64 (1-2):6-24.details
|
|
Examining fragments of the quantified propositional calculus.Steven Perron - 2008 - Journal of Symbolic Logic 73 (3):1051-1080.details
|
|
Induction rules in bounded arithmetic.Emil Jeřábek - 2020 - Archive for Mathematical Logic 59 (3-4):461-501.details
|
|
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.details
|
|
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.details
|
|
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.details
|
|
Separation results for the size of constant-depth propositional proofs.Arnold Beckmann & Samuel R. Buss - 2005 - Annals of Pure and Applied Logic 136 (1-2):30-55.details
|
|
On transformations of constant depth propositional proofs.Arnold Beckmann & Sam Buss - 2019 - Annals of Pure and Applied Logic 170 (10):1176-1187.details
|
|