The Complexity of Propositional Proofs

Bulletin of Symbolic Logic 1 (4):425-467 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

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

Through your library

Similar books and articles

The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
On Independence Proofs in the Propositional Calculus.W. V. Quine - 1990 - Journal of Symbolic Logic 55 (1):345-346.
On logic of proofs and provability.Elena Nogina - 2006 - Bulletin of Symbolic Logic 12 (2):356.

Analytics

Added to PP
2017-02-22

Downloads
10 (#1,207,970)

6 months
9 (#439,104)

Historical graph of downloads
How can I increase my downloads?