Complexity of Proofs in Classical Propositional Logic
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Propositional proof systems, the consistency of first order theories and the complexity of computationsThe Journal of Symbolic Logic, 1989
- The complexity of Gentzen systems for propositional logicTheoretical Computer Science, 1989
- Resolution proofs of generalized pigeonhole principlesTheoretical Computer Science, 1988
- Polynomial size proofs of the propositional pigeonhole principleThe Journal of Symbolic Logic, 1987
- The intractability of resolutionTheoretical Computer Science, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- Bounds for proof-search and speed-up in the predicate calculusAnnals of Mathematical Logic, 1978
- Toward Mechanical MathematicsIBM Journal of Research and Development, 1960
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955