On M-recursively saturated models of arithmetic

DOI10.21099/TKBJM/1496159540MaRDI QIDQ795824zbMATH OpenOpenAlexFDO

Authors Akito Tsuboi

Publication date 1982

Published in Tsukuba Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21099/tkbjm/1496159540

zbMATH Keywords

countable models of Peano arithmeticembeddingsisomorphismsM-recursive saturation

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Review text

In the paper the notion of M-recursive saturation of N is introduced, where M, N are countable models of Peano arithmetic, \(M\subseteq N\). This notion is related to the usual notion of recursive saturation. We say that N is M-recursively saturated if every finitely realizable type \(\tau\) which is \(\Delta_ 1\) definable over the family of hereditarily finite sets of M and which contains finitely many parameters from M is realizable in N. If \(M=<\omega;O,',+,\cdot>\) then M-recursive saturation is just recursive saturation, in general it is a stronger property of N than recursive saturation. Isomorphism and embeddability properties of models which correspond to this notion of saturation are studied. If one defines the appropriate notion of M-standard system of N, \(SS_ M(N)\), and of M- theory of N, \(Th_ MN\), then one obtains analogous theorems to the usual ones, where the conclusions are of the form there is an isomorphism (embedding) between \(N_ 1\) and \(N_ 2\) identical on M. This shows that the notion of saturation introduced in the paper is the right notion to define if one wants to study isomorphisms or embeddings of models extending M being identity on M.

Recommendations

• scientific article; zbMATH DE number 32280
• The Recursively Saturated Part of Models of Peano Arithmetic
• scientific article; zbMATH DE number 663792
• Remarks on weak notions of saturation in models of Peano arithmetic
• Nonstandard characterizations of recursive saturation and resplendency

Cited in

(15)

• Relatively diophantine correct models of arithmetic
• Automorphisms of recursively saturated models of arithmetic
• Constructive ultraproducts and isomorphisms of recursively saturated ultrapowers
• Recursively saturated nonstandard models of arithmetic; addendum
• Remarks on weak notions of saturation in models of Peano arithmetic
• The Recursively Saturated Part of Models of Peano Arithmetic
• scientific article; zbMATH DE number 4027446 (Why is no real title available?)
• Nonstandard characterizations of recursive saturation and resplendency
• Models with the ω-property
• A Note on Real Subsets of A Recursively Saturated Model
• scientific article; zbMATH DE number 663792 (Why is no real title available?)
• On Models Constructed by Means of the Arithmetized Completeness Theorem
• The property ``arithmetic-is-recursive on a cone
• scientific article; zbMATH DE number 2236624 (Why is no real title available?)
• Saturation and simple extensions of models of Peano arithmetic

This page was built for publication: On M-recursively saturated models of arithmetic

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