The relative efficiency of propositional proof systems. (English) Zbl 0408.03044


03F20 Complexity of proofs
03B05 Classical propositional logic
Full Text: DOI


[1] DOI: 10.1007/978-1-4684-2001-2_9 · doi:10.1007/978-1-4684-2001-2_9
[2] Proceedings of the Third Annual ACM Symposium on the Theory of Computing, May 1971 pp 151–
[3] Proceedings of the Sixth Annual ACM Symposium on the Theory of Computing, May 1974 pp 135–
[4] DOI: 10.1007/BF01475439 · doi:10.1007/BF01475439
[5] Introduction to mathematical logic I (1956)
[6] The design and analysis of computer algorithms (1974)
[7] Topics in the theory of computation (1976)
[8] Proceedings of Logic Colloquium ’76 87 (1977)
[9] Studies in mathematics and mathematical logic, Part II pp 115– (1968)
[10] Natural deduction. A proof-theoretic study (1965)
[11] From Frege to Godel, a source book in mathematical logic pp 1– (1967)
[12] Proceedings of the Saventh Annual ACM Conference on the Theory of Computing, May 1976 pp 83–
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.