On M-recursively saturated models of arithmetic (Q795824)

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.