- Towards NP – P via proof complexity and search.Samuel R. Buss - 2012 - Annals of Pure and Applied Logic 163 (7):906-917.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
|
|
Information in propositional proofs and algorithmic proof search.Jan Krajíček - 2022 - Journal of Symbolic Logic 87 (2):852-869.details
|
|
Rationality and maximal consistent sets for a fragment of ASPIC + without undercut.Jesse Heyninck & Christian Straßer - 2021 - Argument and Computation 12 (1):3-47.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
|
|
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.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
|
|
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
|
|
Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.details
|
|
Clause trees: a tool for understanding and implementing resolution in automated reasoning.J. D. Horton & Bruce Spencer - 1997 - Artificial Intelligence 92 (1-2):25-89.details
|
|
(8 other versions)2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10.Uri Abraham & Ted Slaman - 2011 - Bulletin of Symbolic Logic 17 (2):272-329.details
|
|
Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.details
|
|
Hard instances of algorithms and proof systems.Yijia Chen, Jörg Flum & Moritz Müller - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 118--128.details
|
|
Boolean programs and quantified propositional proof systems.Stephen Cook & Michael Soltys - 1999 - Bulletin of the Section of Logic 28 (3):119-129.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
|
|
On the proof complexity of the nisan–wigderson generator based on a hard np ∩ conp function.Jan Krajíček - 2011 - Journal of Mathematical Logic 11 (1):11-27.details
|
|
(1 other version)The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
Propositional Proof Systems and Fast Consistency Provers.Joost J. Joosten - 2007 - Notre Dame Journal of Formal Logic 48 (3):381-398.details
|
|
On the power of clause-learning SAT solvers as resolution engines.Knot Pipatsrisawat & Adnan Darwiche - 2011 - Artificial Intelligence 175 (2):512-525.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
|
|
Frege systems for extensible modal logics.Emil Jeřábek - 2006 - Annals of Pure and Applied Logic 142 (1):366-379.details
|
|
The relative complexity of analytic tableaux and SL-resolution.André Vellino - 1993 - Studia Logica 52 (2):323 - 337.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
|
|
Plausibly hard combinatorial tautologies.Jeremy Avigad - manuscriptdetails
|
|
Are tableaux an improvement on truth-tables?Marcello D'Agostino - 1992 - Journal of Logic, Language and Information 1 (3):235-252.details
|
|
Two party immediate response disputes: Properties and efficiency.Paul E. Dunne & T. J. M. Bench-Capon - 2003 - Artificial Intelligence 149 (2):221-250.details
|
|
2004 Annual Meeting of the Association for Symbolic Logic.Sergei Artemov - 2005 - Bulletin of Symbolic Logic 11 (1):92-119.details
|
|
Hilbert-style axiomatization of first-degree entailment and a family of its extensions.Yaroslav Shramko - 2021 - Annals of Pure and Applied Logic 172 (9):103011.details
|
|
Resolution over linear equations modulo two.Dmitry Itsykson & Dmitry Sokolov - 2020 - Annals of Pure and Applied Logic 171 (1):102722.details
|
|
Extended clause learning.Jinbo Huang - 2010 - Artificial Intelligence 174 (15):1277-1284.details
|
|
Informal proof, formal proof, formalism.Alan Weir - 2016 - Review of Symbolic Logic 9 (1):23-43.details
|
|
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.details
|
|
Quantum deduction rules.Pavel Pudlák - 2009 - Annals of Pure and Applied Logic 157 (1):16-29.details
|
|
Interpolants, cut elimination and flow graphs for the propositional calculus.Alessandra Carbone - 1997 - Annals of Pure and Applied Logic 83 (3):249-299.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
|
|
Resolution over linear equations and multilinear proofs.Ran Raz & Iddo Tzameret - 2008 - Annals of Pure and Applied Logic 155 (3):194-224.details
|
|
Sufficient conditions for cut elimination with complexity analysis.João Rasga - 2007 - Annals of Pure and Applied Logic 149 (1-3):81-99.details
|
|
Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.details
|
|
Short propositional refutations for dense random 3CNF formulas.Sebastian Müller & Iddo Tzameret - 2014 - Annals of Pure and Applied Logic 165 (12):1864-1918.details
|
|
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.details
|
|
Canonical proof nets for classical logic.Richard McKinley - 2013 - Annals of Pure and Applied Logic 164 (6):702-732.details
|
|
A remark on pseudo proof systems and hard instances of the satisfiability problem.Jan Maly & Moritz Müller - 2018 - Mathematical Logic Quarterly 64 (6):418-428.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
|
|
On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.details
|
|
On theories of bounded arithmetic for NC 1.Emil Jeřábek - 2011 - Annals of Pure and Applied Logic 162 (4):322-340.details
|
|
Several notes on the power of Gomory–Chvátal cuts.Edward A. Hirsch & Arist Kojevnikov - 2006 - Annals of Pure and Applied Logic 141 (3):429-436.details
|
|