Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories

Mathematical Logic Quarterly 60 (1-2):92-117 (2014)
  Copy   BIBTEX

Abstract

In this paper we study local induction w.r.t. Σ1‐formulas over the weak arithmetic. The local induction scheme, which was introduced in, says roughly this: for any virtual class that is progressive, i.e., is closed under zero and successor, and for any non‐empty virtual class that is definable by a Σ1‐formula without parameters, the intersection of and is non‐empty. In other words, we have, for all Σ1‐sentences S, that S implies, whenever is progressive. Since, in the weak context, we have (at least) two definitions of Σ1, we obtain two minimal theories of local induction w.r.t. Σ1‐formulas, which we call Peano Corto and Peano Basso.In the paper we give careful definitions of Peano Corto and Peano Basso. We establish their naturalness both by giving a model theoretic characterization and by providing an equivalent formulation in terms of a sentential reflection scheme.The theories Peano Corto and Peano Basso occupy a salient place among the sequential theories on the boundary between weak and strong theories. They bring together a powerful collection of principles that is locally interpretable in. Moreover, they have an important role as examples of various phenomena in the metamathematics of arithmetical (and, more generally, sequential) theories. We illustrate this by studying their behavior w.r.t. interpretability, model interpretability and local interpretability. In many ways the theories are more like Peano arithmetic or Zermelo Fraenkel set theory, than like finitely axiomatized theories as Elementary Arithmetic, and. On the one hand, Peano Corto and Peano Basso are very weak: they are locally cut‐interpretable in. On the other hand, they behave as if they were strong: they are not contained in any consistent finitely axiomatized arithmetical theory, however strong. Moreover, they extend, the theory of parameter‐free Π1‐induction.

Links

PhilArchive



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

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

Minimal truth and interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.
Abstraction and Intuition in Peano's Axiomatizations of Geometry.Davide Rizza - 2009 - History and Philosophy of Logic 30 (4):349-368.
Peano as logician.Wlllard Van Orman Quine - 1987 - History and Philosophy of Logic 8 (1):15-24.
The mathematical philosophy of Giuseppe peano.Hubert C. Kennedy - 1963 - Philosophy of Science 30 (3):262-266.
Life and Works of Giovanni Vailati.Paola Cantù & De Zan Mauro - 2009 - In Arrighi Claudia, Cantù Paola, De Zan Mauro & Suppes Patrick (eds.), Life and Works of Giovanni Vailati. CSLI Publications.

Analytics

Added to PP
2014-02-16

Downloads
39 (#388,687)

6 months
14 (#154,299)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Another look at the second incompleteness theorem.Albert Visser - 2020 - Review of Symbolic Logic 13 (2):269-295.
Friedman-reflexivity.Albert Visser - 2022 - Annals of Pure and Applied Logic 173 (9):103160.
Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.
The Arithmetics of a Theory.Albert Visser - 2015 - Notre Dame Journal of Formal Logic 56 (1):81-119.
Transductions in arithmetic.Albert Visser - 2016 - Annals of Pure and Applied Logic 167 (3):211-234.

View all 7 citations / Add more citations

References found in this work

Arithmetization of Metamathematics in a General Setting.Solomon Feferman - 1960 - Journal of Symbolic Logic 31 (2):269-270.
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.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
Undecidability without Arithmetization.Andrzej Grzegorczyk - 2005 - Studia Logica 79 (2):163-230.

View all 28 references / Add more references