We deal with models of Peano arithmetic. The methods are from creature forcing. We find an expansion of equation image such that its theory has models with no end extensions. In fact there is a Borel uncountable set of subsets of equation image such that expanding equation image by any uncountably many of them suffice. Also we find arithmetically closed equation image with no ultrafilter on it with suitable definability demand. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Kaufmann model is an \(\omega _1\) -like, recursively saturated, rather classless model of \({{\mathsf {P}}}{{\mathsf {A}}}\) (or \({{\mathsf {Z}}}{{\mathsf {F}}} \) ). Such models were constructed by Kaufmann under the combinatorial principle \(\diamondsuit _{\omega _1}\) and Shelah showed they exist in \(\mathsf {ZFC}\) by an absoluteness argument. Kaufmann models are an important witness to the incompactness of \(\omega _1\) similar to Aronszajn trees. In this paper we look at some set theoretic issues related to this motivated by the seemingly (...) naïve question of whether such a model can be “killed” by forcing without collapsing \(\omega _1\). We show that the answer to this question is independent of \(\mathsf {ZFC}\) and closely related to similar questions about Aronszajn trees. As an application of these methods we also show that it is independent of \(\mathsf {ZFC}\) whether or not Kaufmann models can be axiomatized in the logic \(L_{\omega _1, \omega } (Q)\) where _Q_ is the quantifier “there exists uncountably many”. (shrink)

Let (M, X) ⊨ ACA₀ be such that P X, the collection of all unbounded sets in X, admits a definable complete ultrafilter and let T be a theory extending first order arithmetic coded in X such that M thinks T is consistent. We prove that there is an end-extension N ⊨ T of M such that the subsets of M coded in N are precisely those in X. As a special case we get that any Scott set with a (...) definable ultrafilter coding a consistent theory T extending first order arithmetic is the standard system of a recursively saturated model of T. (shrink)