Diophantine Induction

Annals of Pure and Applied Logic 46 (1):1-40 (1990)
  Copy   BIBTEX

Abstract

We show that Matijasevič's Theorem on the diophantine representation of r.e. predicates is provable in the subsystem I ∃ - 1 of Peano Arithmetic formed by restricting the induction scheme to diophantine formulas with no parameters. More specifically, I ∃ - 1 ⊢ IE - 1 + E ⊢ Matijasevič's Theorem where IE - 1 is the scheme of parameter-free bounded existential induction and E is an ∀∃ axiom expressing the existence of a function of exponential growth. We conclude by examining the consequences of these results to the structure of countable nonstandard models of IE - 1

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

Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.
Diophantine properties of finite commutative rings.Mihai Prunescu - 2003 - Archive for Mathematical Logic 42 (3):293-302.
Herbrand's theorem and term induction.Matthias Baaz & Georg Moser - 2006 - Archive for Mathematical Logic 45 (4):447-503.
Some problems of counter‐inductive policy as opposed to inductive.Audun Öfsti - 1962 - Inquiry: An Interdisciplinary Journal of Philosophy 5 (1-4):267-283.
No Need to Justify Induction Generally.Kazuyoshi Kamiyama - 2008 - Proceedings of the Xxii World Congress of Philosophy 53:105-111.

Analytics

Added to PP
2014-01-16

Downloads
23 (#644,212)

6 months
8 (#292,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Pell equations and exponentiation in fragments of arithmetic.Paola D'Aquino - 1996 - Annals of Pure and Applied Logic 77 (1):1-34.
Induction rules in bounded arithmetic.Emil Jeřábek - 2020 - Archive for Mathematical Logic 59 (3-4):461-501.
Toward the Limits of the Tennenbaum Phenomenon.Paola D'Aquino - 1997 - Notre Dame Journal of Formal Logic 38 (1):81-92.

View all 13 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.
On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Existential Definability in Arithmetic.Julia Robinson - 1955 - Journal of Symbolic Logic 20 (2):182-183.

Add more references