On the scheme of induction for bounded arithmetic formulas

&
Annals of Pure and Applied Logic 35 (C):261-302 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90066-2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

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

WEIHRAUCH, K. and KREITZ, C., Representations of the real numbers and of the open subsets of the set of real numbers WILKIE, AJ and PARIS, JB, On the scheme of induction for bounded arithmetic formulas. [REVIEW]Las Kirby & R. Diaconescu - 1987 - Annals of Pure and Applied Logic 35:303.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
On Overspill Principles and Axiom Schemes for Bounded Formulas.Joaquín Borrego-Díaz, Alejandro Fernández-Margarit & Mario Pérez-Jiménez - 1996 - Mathematical Logic Quarterly 42 (1):341-348.
Algebraic Methods and Bounded Formulas.Domenico Zambella - 1997 - Notre Dame Journal of Formal Logic 38 (1):37-48.
Induction, minimization and collection for Δ n+1 (T)–formulas.A. Fernández-Margarit & F. F. Lara-Martín - 2004 - Archive for Mathematical Logic 43 (4):505-541.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.Neil Thapen - 2011 - Archive for Mathematical Logic 50 (7):665-680.
A note on the E1 collection scheme and fragments of bounded arithmetic.Zofia Adamowicz & Leszek Aleksander Kołodziejczyk - 2010 - Mathematical Logic Quarterly 56 (2):126-130.
Remarks on Herbrand normal forms and Herbrand realizations.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (5):305-317.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
The strength of sharply bounded induction.Emil Jeřábek - 2006 - Mathematical Logic Quarterly 52 (6):613-624.
On diophantine equations solvable in models of open induction.Margarita Otero - 1990 - Journal of Symbolic Logic 55 (2):779-786.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.

Analytics

Added to PP
2014-01-16

Downloads
58 (#276,247)

6 months
20 (#130,544)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

Citations of this work

Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.
On Interpretations of Arithmetic and Set Theory.Richard Kaye & Tin Lok Wong - 2007 - Notre Dame Journal of Formal Logic 48 (4):497-510.

View all 91 citations / Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
A note on the undefinability of cuts.J. B. Paris & C. Dimitracopoulos - 1983 - Journal of Symbolic Logic 48 (3):564-569.

Add more references