Propositional proof systems, the consistency of first order theories and the complexity of computations
- 1 September 1989
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 54 (3), 1063-1079
- https://doi.org/10.2307/2274765
Abstract
Propositional proof systems, the consistency of first order theories and the complexity of computations - Volume 54 Issue 3 - Jan Krajíček, Pavel PudlákKeywords
This publication has 6 references indexed in Scilit:
- On the scheme of induction for bounded arithmetic formulasAnnals of Pure and Applied Logic, 1987
- Improved bounds to the length of proofs of finitistic consistency statementsContemporary Mathematics, 1987
- On the length of proofs of finitistic consistency statements in first order theoriesPublished by Elsevier ,1986
- The intractability of resolutionTheoretical Computer Science, 1985
- Counting problems in bounded arithmeticLecture Notes in Mathematics, 1985
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975