Bounded Arithmetic and Propositional Proof Complexity (original) (raw)
Related papers
Bounded arithmetic, proof complexity and two papers of Parikh
Annals of Pure and Applied Logic, 1999
Kolmogorov Complexity, Circuits, and the Strength of Logical Theories of Arithmetic
2011
Complexity of proofs in classical propositional logic
Logic from computer science, 1992
Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic
2012
On meta complexity of propositional formulas and propositional proofs
Archive for Mathematical Logic, 2008
A Generic Time-Space Lower Bound for Proof Complexity
2008
Upper bounds on complexity of Frege proofs with limited use of certain schemata
Archive for Mathematical Logic, 2006
Synthese, 1985
The complexity of propositional proofs
The Bulletin of Symbolic Logic, 1995
Simplified lower bounds for propositional proofs
Notre Dame Journal of Formal Logic, Vol. 37, pp. 523-544, 1996
Hardness amplification in proof complexity
Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10, 2010
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
On the Provability Logic of Bounded Arithmetic
Rineke Verbrugge, Alessandro Berarducci
Annals of Pure and Applied Logic, 1993
On the bounds for the main proof measures in some propositional proof systems
2014
Proof Complexities of Some Propositional Formulae Classes in Different Refutation Systems 1
Ashot Abajyan, Anahit Chubaryan
2010
Proof complexity of non-classical logics
2012
Journal of Logic and Computation, 2005
On proving circuit lower bounds against the polynomial-time hierarchy
Abstract Some Results in Computational Complexity
2008
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
The Analytic Polynomial-Time Hierarchy
Mathematical Logic Quarterly, 1998
Some connections between mathematical logic and complexity theory
1979
Complexity of theorem-proving procedures : some general properties
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, 1974
Theoretical Computer Science, 1987
On the complexity of interactive proofs with bounded communication
Information Processing Letters
On the Power of Automata Based Proof Systems
1999
Relations between the Proof Complexities in Frege Systems, Deep-Inference Proof Systems KS and еКS
2022
The Knowledge Complexity of Interactive Proof Systems
SIAM Journal on Computing, 1989
The consistency of ?P = NP? and related problems with fragments of number theory
Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80, 1980
Resolution Refutations and Propositional Proofs with Height-Restrictions
Lecture Notes in Computer Science, 2002
Investigations into the complexity of some propositional calculi
University of Oxford, PRG technical monographs, 1990
Lower bound frontiers in arithmetical circuit complexity
2006
A Proof Theory for the Logic of Provability in True Arithmetic
STUDIA LOGICA, vol.108(4), pp 857-875, 2020
On relativisation and complexity gap for resolution-based proof systems
Computer Science Logic, 2003