Bootstrapping, part I

&
Annals of Pure and Applied Logic 161 (4):511-533 (2010)
  Copy   BIBTEX

Abstract

We construct models of the integers, to yield: witnessing, independence and separation results for weak systems of bounded induction

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2009.03.004

Links

PhilArchive



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

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

Structures interpretable in models of bounded arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.
Independence results for variants of sharply bounded induction.Leszek Aleksander Kołodziejczyk - 2011 - Annals of Pure and Applied Logic 162 (12):981-990.
Partial collapses of the complexity hierarchy in models for fragments of bounded arithmetic.Zofia Adamowicz & Leszek Aleksander Kołodziejczyk - 2007 - Annals of Pure and Applied Logic 145 (1):91-95.
Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.
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.
The bounded functional interpretation of bar induction.Patrícia Engrácia - 2012 - Annals of Pure and Applied Logic 163 (9):1183-1195.
A model-theoretic characterization of the weak pigeonhole principle.Neil Thapen - 2002 - Annals of Pure and Applied Logic 118 (1-2):175-195.
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.
Bounded functional interpretation and feasible analysis.Fernando Ferreira & Paulo Oliva - 2007 - Annals of Pure and Applied Logic 145 (2):115-129.
Systems of explicit mathematics with non-constructive μ-operator. Part I.Solomon Feferman & Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 65 (3):243-263.

Analytics

Added to PP
2013-12-18

Downloads
66 (#85,934)

6 months
4 (#1,635,958)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the finite axiomatizability of.Chris Pollett - 2018 - Mathematical Logic Quarterly 64 (1-2):6-24.

Add more citations

References found in this work

Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
Structure and definability in general bounded arithmetic theories.Chris Pollett - 1999 - Annals of Pure and Applied Logic 100 (1-3):189-245.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.

View all 8 references / Add more references