Structural Complexity of Proofs

Dissertation, Stanford University (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

  • This entry has no external links. Add one.
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.
Scaling in structural complexity.Valerio De Biagi & Bernardino Chiaia - 2014 - Complexity 20 (1):57-63.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Lower Bounds for cutting planes proofs with small coefficients.Maria Bonet, Toniann Pitassi & Ran Raz - 1997 - Journal of Symbolic Logic 62 (3):708-728.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1):153-178.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1-2):153-178.
Complexity of resolution proofs and function introduction.Matthias Baaz & Alexander Leitsch - 1992 - Annals of Pure and Applied Logic 57 (3):181-215.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The three dimensions of proofs.Yves Guiraud - 2006 - Annals of Pure and Applied Logic 141 (1):266-295.
Structural database for reducing cost in materials design and complexity of multiscale computations.Nikolai Zarkevich - 2006 - Complexity 11 (4):36-42.
Newborn EEG seizure detection using signal structural complexity.L. Rankine, M. Mesbah & B. Boashash - 2004 - Complexity 500:15.
Influence Of Structural Complexity On Fault Persistence.Maurizio Pighin Anna Marzona - 2004 - Complexity 418 (199):327.
Interpolants, cut elimination and flow graphs for the propositional calculus.Alessandra Carbone - 1997 - Annals of Pure and Applied Logic 83 (3):249-299.

Analytics

Added to PP
2015-02-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Normal derivability in classical natural deduction.Jan Von Plato & Annika Siders - 2012 - Review of Symbolic Logic 5 (2):205-211.
Algorithmic Structuring of Cut-free Proofs.Matthias Baaz & Richard Zach - 1993 - In Börger Egon, Kleine Büning Hans, Jäger Gerhard, Martini Simone & Richter Michael M. (eds.), Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers. Springer. pp. 29–42.
Proof Theory and Complexity.Carlo Cellucci - 1985 - Synthese 62 (2):173-189.

Add more citations

References found in this work

No references found.

Add more references