A standard model of Peano arithmetic with no conservative elementary extension

نویسنده

  • Ali Enayat
چکیده

The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically closed family A of subsets of the set ω of natural numbers such that the expansion ΩA := (ω, +, ·, X)X∈A of the standard model of Peano arithmetic has no conservative elementary extension, i.e., for any elementary extension ΩA = (ω ∗, · · ·) of ΩA, there is a subset of ω∗ that is parametrically definable in ΩA but whose intersection with ω is not a member of A. Inspired by a recent question of Gitman and Hamkins, we also show that the aforementioned family A can be arranged to further satisfy the curious property that forcing with the quotient Boolean algebra A/FIN (where FIN is the ideal of finite sets) collapses א1 when viewed as a notion of forcing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NUMBERS AND POLYNOMIALS A model of Robinson Arithmetic in Mathematics Education

In this paper we consider by elementary methods the Robinson theory Q, subtheory of the firstorder Peano Arithmetic PA, and a model of Q given by a universe of polynomials, thati is non-isomorphic to the standard model of PA. Sommario Nel presente lavoro si considera elementarmente la teoria di Robinson Q, sottoteoria dell’Aritmetica di Peano del primo ordine PA, ed un modello di Q costituito d...

متن کامل

Extendible Sets in Peano Arithmetic

Let sf be a structure and let U be a subset of \sf\. We say U is extendible if whenever 3S is an elementary extension of so? .there is a V Ç \£§\ such that (sf, U) -< (SS, V). Our main results are: If Jt is a countable model of Peano arithmetic and U is a subset of |-#|, then U is extendible iff U is parametrically definable in J( . Also, the cofinally extendible subsets of \J?\ are exactly the...

متن کامل

An Effective Conservation Result for Nonstandard Arithmetic

We prove that a nonstandard extension of arithmetic is eeectively conservative over Peano arithmetic by using an internal version of a deenable ultrapower. By the same method we show that a certain extension of the nonstandard theory with a saturation principle has the same proof-theoretic strength as second order arithmetic, where comprehension is restricted to arithmetical formulas.

متن کامل

Unprovable Ramsey-type statements reformulated to talk about primes

Let us say that two finite sets of natural numbers are primality-isomorphic if there is a differencepreserving primality-preserving and nonprimality-preserving bijection between them. Let Φ be the statement “every infinite set B ⊆ N has an infinite subset A such that for any x < y < z in A, the interval { 2 , . . . , 3x+y 2 } is primality-isomorphic to the interval { 2 , . . . , 3x+z 2 }”. We p...

متن کامل

Model Theory of Wkl

We develop machinery to make the Arithmetized Completeness Theorem more effective in the study of many models of I∆0 + BΣ1 + exp, including all countable ones, by passing on to the conservative extension WKL0 of I∆0+BΣ1+exp. Our detailed study of the model theory of WKL ∗ 0 also leads to the simplification and improvement of many results in the model theory of Peano arithmetic and its fragments...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008