Length and structure of proofs

Synthese 114 (1):41-48 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1023/a:1005050425290

Links

PhilArchive



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

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 Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Structure with Fast Elimination of Quantifiers.Mihai Prunescu - 2006 - Journal of Symbolic Logic 71 (1):321 - 328.
Minimum propositional proof length is NP-Hard to linearly approximate.Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi - 2001 - Journal of Symbolic Logic 66 (1):171-191.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
What is length?Frank Henmueller & Karl Menger - 1961 - Philosophy of Science 28 (2):172-177.
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.
Probabilistic proofs and transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.
Radical anti-realism, Wittgenstein and the length of proofs.Mathieu Marion - 2009 - Synthese 171 (3):419 - 432.
On different intuitionistic calculi and embeddings from int to S.Uwe Egly - 2001 - Studia Logica 69 (2):249-277.

Analytics

Added to PP
2009-01-28

Downloads
40 (#381,087)

6 months
8 (#303,628)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohit Parikh
CUNY Graduate Center

Citations of this work

No citations found.

Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
An Introduction to Proof Theory.Samuel R. Buss - 2000 - Bulletin of Symbolic Logic 6 (4):464-465.
The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.

View all 6 references / Add more references