Bounded arithmetic, proof complexity and two papers of Parikh

Annals of Pure and Applied Logic 96 (1-3):43-55 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(98)00030-x

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,314

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

Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
Samuel R. Buss. Bounded arithmetic. Studies in proof theory. Lecture notes, no. 3. Bibliopolis, Naples1986, v + 221 pp. [REVIEW]A. J. Wilkie - 1991 - Journal of Symbolic Logic 56 (2):759-760.
Review: Samuel R. Buss, Bounded Arithmetic. [REVIEW]A. J. Wilkie - 1991 - Journal of Symbolic Logic 56 (2):759-760.
Samuel R. Buss. The undecidability of k-provability. Annals of pure and applied logic, vol. 53 , pp. 75–102.Alessandra Carbone - 1997 - Journal of Symbolic Logic 62 (4):1480-1481.
Samuel R. Buss. First-order proof theory of arithmetic. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 79–147. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):465-466.
On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.
Review: Samuel R. Buss, Handbook of Proof Theory: First-Order Proof Theory of Arithmetic. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):465-466.
Intuitionistic formal theories with realizability in subrecursive classes.Anatoly Petrovich Beltiukov - 1997 - Annals of Pure and Applied Logic 89 (1):3-15.
Bounded arithmetic and truth definition.Gaisi Takeuti - 1988 - Annals of Pure and Applied Logic 39 (1):75-104.

Analytics

Added to PP
2014-01-16

Downloads
28 (#837,946)

6 months
8 (#390,329)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
A Machine-Oriented Logic based on the Resolution Principle.J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (3):515-516.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.

View all 20 references / Add more references