Proof Theory and Complexity

Synthese 62 (2):173-189 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Provability, complexity, grammars.Lev Dmitrievich Beklemishev - 1999 - Providence, RI: American Mathematical Society. Edited by Mati Reĭnovich Pentus & Nikolai Konstantinovich Vereshchagin.
Proof complexity.Jan Krajíček - 2019 - New York, NY: Cambridge University Press.
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.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
Logic of Computation.Helmut Schwichtenberg - 1997 - Boom Koninklijke Uitgevers.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Analytics

Added to PP
2009-01-28

Downloads
49 (#316,613)

6 months
8 (#505,340)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
The correspondence between cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1-112.
Popular lectures on mathematical logic.Hao Wang - 1981 - New York: Dover Publications.

View all 10 references / Add more references