Minimal elementary end extensions

DOI10.1007/S00153-017-0556-5MaRDI QIDQ2402959zbMATH OpenOpenAlexFDO

Authors James H. Schmerl

Publication date 15 September 2017

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.06478

zbMATH Keywords

coded setsMacDowell-Specker theoremminimal end extensions

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Abstract: Suppose that $mathcalM$ is a model of PA and $mathcalN$ is a countably generated elementary end extension of $mathcalM$. Let $mathfrakX$ be the set of subsets of M that are coded by $mathcalN$. Then $mathcalM$ has a minimal elementary end extension that codes exactly the same subsets of M that $mathcalN$ does iff every set that is $P{i}_1^0$-definable in $(mathcalM,mathfrakX)$ is the union of countably many sets that are $Sigm{a}_1^0$-definable.

Recommendations

• Subsets coded in elementary end extensions
• Subsets of models of arithmetic
• End-extending models of $IΔ_0 + exp + ΒΣ_1$
• Extendible Sets in Peano Arithmetic
• On two problems concerning end extensions

Cites work

• scientific article; zbMATH DE number 3437141 (Why is no real title available?)
• scientific article; zbMATH DE number 3333278 (Why is no real title available?)
• A minimal extension that is not conservative
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Omitting types in set theory and arithmetic
• Subsets coded in elementary end extensions
• Subsystems of second order arithmetic
• The structure of models of Peano arithmetic

Cited in

(3)

• Subsets coded in elementary end extensions
• Subsets of models of arithmetic
• Embedded minimal ends of finite type

This page was built for publication: Minimal elementary end extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402959)