The number of proof lines and the size of proofs in first order logic

&
Archive for Mathematical Logic 27 (1):69-84 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf01625836

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,314

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Jan Krajíček and Pavel Pudlák. The number of proof lines and the size of proofs in first order logic. Archive for mathematical logic, vol. 27 , pp. 69–84. [REVIEW]William M. Farmer - 1989 - Journal of Symbolic Logic 54 (3):1107-1108.
Jan Krajíček. On the number of steps in proofs. Annals of pure and applied logic, vol. 41 , pp. 153–178.William M. Farmer - 1991 - Journal of Symbolic Logic 56 (1):334-335.
Petr Hájek and Pavel Pudlák. Metamathematics of first-order arithmetic. Perspectives in mathematical logic. Springer-Verlag, Berlin etc. 1993, xiv + 460 pp. [REVIEW]Richard Kaye - 1995 - Journal of Symbolic Logic 60 (4):1317-1320.
Pavel Pudlák. The lengths of proofs. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 547–637. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):473-475.
Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
Jan Krajíček, Pavel Pudlák, and Gaisi Takeuti. Bounded arithmetic and the polynomial hierarchy. Ibid., vol. 52 , pp. 143–153. - Samuel R. Buss. Relating the bounded arithmetic and polynomial time hierarchies. Ibid., vol. 75 , pp. 67–77. - Domenico Zambella. Notes on polynomially bounded arithmetic. The journal of symbolic logic, vol. 61 , pp. 942–966. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.

Analytics

Added to PP
2013-11-23

Downloads
50 (#457,975)

6 months
10 (#281,857)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
On the number of steps in proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.

View all 21 citations / Add more citations

References found in this work

Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.

Add more references