Structural Complexity of Proofs

Dissertation, Stanford University (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,072

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

Complexity of resolution proofs and function introduction.Matthias Baaz & Alexander Leitsch - 1992 - Annals of Pure and Applied Logic 57 (3):181-215.
Book Review: Henk Barendregt, Will Dekkers, Richard Statman et al., Lambda Calculus With Types. [REVIEW]Adrian Rezuş - 2015 - Studia Logica 103 (6):1319-1326.
Logical structures and genus of proofs.Alessandra Carbone - 2010 - Annals of Pure and Applied Logic 161 (2):139-149.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Reasoning in simple type theory – Festschrift in honor of Peter B. Andrews on his 70th birthday, edited by Christoph Benzmüller, Chad E. Brown, Jörg Siekmann, and Richard Statman, Studies in Logic, vol. 17. College Publications, London, 2008, 454 pp. [REVIEW]Florian Rabe - 2010 - Bulletin of Symbolic Logic 16 (3):409-411.
Scaling in structural complexity.Valerio De Biagi & Bernardino Chiaia - 2014 - Complexity 20 (1):57-63.
Proof Theory and Complexity.Carlo Cellucci - 1985 - Synthese 62 (2):173-189.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
On the difficulty of discovering mathematical proofs.Andrew Arana & Will Stafford - 2023 - Synthese 202 (2):1-29.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.

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 Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini & Michael M. Richter (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