- Expander construction in VNC1.Sam Buss, Valentine Kabanets, Antonina Kolokolova & Michal Koucký - 2020 - Annals of Pure and Applied Logic 171 (7):102796.details
|
|
Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.details
|
|
A Modal View on Resource-Bounded Propositional Logics.Pere Pardo - 2022 - Studia Logica 110 (4):1035-1080.details
|
|
An exponential separation between the parity principle and the pigeonhole principle.Paul Beame & Toniann Pitassi - 1996 - Annals of Pure and Applied Logic 80 (3):195-228.details
|
|
A bounded arithmetic AID for Frege systems.Toshiyasu Arai - 2000 - Annals of Pure and Applied Logic 103 (1-3):155-199.details
|
|
Substitution Frege and extended Frege proof systems in non-classical logics.Emil Jeřábek - 2009 - Annals of Pure and Applied Logic 159 (1-2):1-48.details
|
|
Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.details
|
|
Some more curious inferences.Jeffrey Ketland - 2005 - Analysis 65 (1):18–24.details
|
|
A lower bound for intuitionistic logic.Pavel Hrubeš - 2007 - Annals of Pure and Applied Logic 146 (1):72-90.details
|
|
Bounded-depth Frege complexity of Tseitin formulas for all graphs.Nicola Galesi, Dmitry Itsykson, Artur Riazanov & Anastasia Sofronova - 2023 - Annals of Pure and Applied Logic 174 (1):103166.details
|
|
(1 other version)The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.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
|
|
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.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
|
|
Extension without cut.Lutz Straßburger - 2012 - Annals of Pure and Applied Logic 163 (12):1995-2007.details
|
|
Count(ifq) does not imply Count.Søren Riis - 1997 - Annals of Pure and Applied Logic 90 (1-3):1-56.details
|
|
Complexity of deep inference via atomic flows.Anupam Das - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 139--150.details
|
|
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.details
|
|
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.details
|
|
Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss.Daniil Kozhemiachenko - 2018 - Journal of Applied Non-Classical Logics 28 (4):389-413.details
|
|
Proofs with monotone cuts.Emil Jeřábek - 2012 - Mathematical Logic Quarterly 58 (3):177-187.details
|
|
Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs.Aleksandra Grzelak & Dorota Leszczyńska-Jasion - 2018 - Logic Journal of the IGPL 26 (1):109-148.details
|
|
Propositional proof compressions and DNF logic.L. Gordeev, E. Haeusler & L. Pereira - 2011 - Logic Journal of the IGPL 19 (1):62-86.details
|
|
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.details
|
|
Looking From The Inside And From The Outside.A. Carbone & S. Semmes - 2000 - Synthese 125 (3):385-416.details
|
|
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.details
|
|
Cutting planes, connectivity, and threshold logic.Samuel R. Buss & Peter Clote - 1996 - Archive for Mathematical Logic 35 (1):33-62.details
|
|
Quasipolynomial Size Frege Proofs of Frankl’s Theorem on the Trace of Sets.James Aisenberg, Maria Luisa Bonet & Sam Buss - 2016 - Journal of Symbolic Logic 81 (2):687-710.details
|
|