Complexity Bounds on proofs

&
Journal of Symbolic Logic 46 (2):255-258 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273619

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

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

Review: William S. Hatcher, The Logical Foundations of Mathematics; William S. Hatcher, Foundations of Mathematics; William Hatcher's, Logical Foundations of Mathematics. [REVIEW]Frederick W. Kroon - 1986 - Journal of Symbolic Logic 51 (2):467-470.
William S. Hatcher. The logical foundations of mathematics. Foundations and philosophy of science and technology series. Pergamon Press, Oxford etc. 1982, x + 320 pp. - William S. Hatcher. Foundations of mathematics. W. B. Saunders Company, Philadelphia, London, and Toronto, 1968, xiii + 327 pp. [REVIEW]Frederick W. Kroon - 1986 - Journal of Symbolic Logic 51 (2):467-470.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
On the complexity of proof deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.
Hatcher William S.. La notion d′équivalence entre systèmes formels et une généralisation inductive du système dit “New foundations” de Quine. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 256 , pp. 563–566. [REVIEW]Steven Orey - 1963 - Journal of Symbolic Logic 28 (2):172-173.
Book Review:Foundations of Mathematics William S. Hatcher. [REVIEW]John Corcoran - 1972 - Philosophy of Science 39 (1):88-.
Honest Bounds for complexity classes of recursive functions.R. Moll & A. R. Meyer - 1974 - Journal of Symbolic Logic 39 (1):127-138.
The Complexity of Propositional Proofs.Nathan Segerlind - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
Substitution and Propositional Proof Complexity.Sam Buss - 2021 - In Ivo Düntsch & Edwin Mares (eds.), Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs. Springer Verlag. pp. 477-496.

Analytics

Added to PP
2009-01-28

Downloads
69 (#300,791)

6 months
18 (#155,753)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references