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 [Book Review]

Journal of Symbolic Logic 54 (3):1107-1108 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274779

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

The number of proof lines and the size of proofs in first order logic.Jan Krajíček & Pavel Pudlák - 1988 - Archive for Mathematical Logic 27 (1):69-84.
On the structure of initial segments of models of arithmetic.Jan Krajíček & Pavel Pudlák - 1989 - Archive for Mathematical Logic 28 (2):91-98.
Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.
A note on propositional proof complexity of some Ramsey-type statements.Jan Krajíček - 2011 - Archive for Mathematical Logic 50 (1-2):245-255.
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.
Quantified propositional calculi and fragments of bounded arithmetic.Jan Krajíček & Pavel Pudlák - 1990 - Mathematical Logic Quarterly 36 (1):29-46.
Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.
A lower bound for intuitionistic logic.Pavel Hrubeš - 2007 - Annals of Pure and Applied Logic 146 (1):72-90.
Combinatorics of first order structures and propositional proof systems.Jan Krajíček - 2004 - Archive for Mathematical Logic 43 (4):427-441.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
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.
A note on proofs of falsehood.Jan Krajíček - 1987 - Archive for Mathematical Logic 26 (1):169-176.
On the complexity of finding falsifying assignments for Herbrand disjunctions.Pavel Pudlák - 2015 - Archive for Mathematical Logic 54 (7-8):769-783.

Analytics

Added to PP
2014-04-08

Downloads
20 (#720,454)

6 months
2 (#1,136,865)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references