A Note on Real Subsets of A Recursively Saturated Model

1991 ◽  
Vol 37 (13-16) ◽  
pp. 207-216 ◽  
Author(s):  
Athanassios Tzouvaras
1986 ◽  
Vol 51 (1) ◽  
pp. 222-224 ◽  
Author(s):  
Julia F. Knight

The complete diagram of a structure , denoted by Dc(), is the set of all sentences true in the structure (, a)a∈. A structure is said to be resplendent if for every sentence θ involving a new relation symbol R in addition to symbols occurring in Dc(), if θ is consistent with Dc(), then there is a relation P on such that (see[1]).Baldwin asked whether a homogeneous recursively saturated structure is necessarily resplendent. Here it is shown that this need not be the case. It is shown that if is an uncountable homogeneous resplendent model of an unstable theory, then must be saturated. The proof is related to the proof in [5] that an uncountable homogeneous recursively saturated model of first order Peano arithmetic must be saturated. The example for Baldwin's question is an uncountable homogeneous model for a particular unstable theory, such that is recursively saturated and omits some type. (The continuum hypothesis is needed to show the existence of such a model in power ℵ1.)The proof of the main result requires two lemmas.


Author(s):  
Ali Enayat

AbstractA model $${\mathcal {M}}$$ M of ZF is said to be condensable if $$ {\mathcal {M}}\cong {\mathcal {M}}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}$$ M ≅ M ( α ) ≺ L M M for some “ordinal” $$\alpha \in \mathrm {Ord}^{{\mathcal {M}}}$$ α ∈ Ord M , where $$\mathcal {M}(\alpha ):=(\mathrm {V}(\alpha ),\in )^{{\mathcal {M}}}$$ M ( α ) : = ( V ( α ) , ∈ ) M and $$\mathbb {L}_{{\mathcal {M}}}$$ L M is the set of formulae of the infinitary logic $$\mathbb {L}_{\infty ,\omega }$$ L ∞ , ω that appear in the well-founded part of $${\mathcal {M}}$$ M . The work of Barwise and Schlipf in the 1970s revealed the fact that every countable recursively saturated model of ZF is cofinally condensable (i.e., $${\mathcal {M}}\cong {\mathcal {M}}(\alpha ) \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}$$ M ≅ M ( α ) ≺ L M M for an unbounded collection of $$\alpha \in \mathrm {Ord}^{{\mathcal {M}}}$$ α ∈ Ord M ). Moreover, it can be readily shown that any $$\omega $$ ω -nonstandard condensable model of $$\mathrm {ZF}$$ ZF is recursively saturated. These considerations provide the context for the following result that answers a question posed to the author by Paul Kindvall Gorbow.Theorem A.Assuming a modest set-theoretic hypothesis, there is a countable model $${\mathcal {M}}$$ M of ZFC that is bothdefinably well-founded (i.e., every first order definable element of $${\mathcal {M}}$$ M is in the well-founded part of $$\mathcal {M)}$$ M ) andcofinally condensable. We also provide various equivalents of the notion of condensability, including the result below.Theorem B.The following are equivalent for a countable model$${\mathcal {M}}$$ M of $$\mathrm {ZF}$$ ZF : (a) $${\mathcal {M}}$$ M is condensable. (b) $${\mathcal {M}}$$ M is cofinally condensable. (c) $${\mathcal {M}}$$ M is nonstandard and $$\mathcal {M}(\alpha )\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}$$ M ( α ) ≺ L M M for an unbounded collection of $$ \alpha \in \mathrm {Ord}^{{\mathcal {M}}}$$ α ∈ Ord M .


2010 ◽  
Vol 16 (3) ◽  
pp. 345-358 ◽  
Author(s):  
Samuel Coskey ◽  
Roman Kossak

AbstractWe observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.


Author(s):  
Cezary Cieśliński

AbstractWe present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction is fully classical in that it employs nothing more than the classical techniques of formal proof theory.


2016 ◽  
Vol 10 (1) ◽  
pp. 187-202 ◽  
Author(s):  
CEZARY CIEŚLIŃSKI ◽  
MATEUSZ ŁEŁYK ◽  
BARTOSZ WCISŁO

AbstractWe show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PTtot) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PTtot contains every recursively saturated model of arithmetic. Our results point to a gap in the philosophical project of describing the use of the truth predicate in model-theoretic contexts.


1998 ◽  
Vol 63 (3) ◽  
pp. 815-830 ◽  
Author(s):  
Friederike Körner

AbstractSection 1 is devoted to the study of countable recursively saturated models with an automorphism moving every non-algebraic point. We show that every countable theory has such a model and exhibit necessary and sufficient conditions for the existence of automorphisms moving all non-algebraic points. Furthermore we show that there are many complete theories with the property that every countable recursively saturated model has such an automorphism.In Section 2 we apply our main theorem from Section 1 to models of Quine's set theory New Foundations (NF) to answer an old consistency question. If NF is consistent, then it has a model in which the standard natural numbers are a definable subclass ℕ of the model's set of internal natural numbers Nn. In addition, in this model the class of wellfounded sets is exactly .


1989 ◽  
Vol 54 (4) ◽  
pp. 1382-1388 ◽  
Author(s):  
James H. Schmerl

The motivation for the results presented here comes from the following two known theorems which concern countable, recursively saturated models of Peano arithmetic.(1) if is a countable, recursively saturated model of PA, then for each infinite cardinal κ there is a resplendent which has cardinality κ. (See Theorem 10 of [1].)(2) if is a countable, recursively saturated model of PA, then is generated by a set of indiscernibles. (See [4].)It will be shown here that (1) and (2) can be amalgamated into a common generalization.(3) if is a countable, recursively saturated model of PA, then for each infinite cardinal κ there is a resplendent which has cardinality κ and which is generated by a set of indiscernibles.By way of contrast we will also get recursively saturated models of PA which fail to be resplendent and yet are generated by indiscernibles.(4) if is a countable, recursively saturated model of PA, then for each uncountable cardinal κ there is a κ-like recursively saturated generated by a set of indiscernibles.None of (1), (2) or (3) is stated in its most general form. We will make some comments concerning their generalizations. From now on let us fix a finite language L; all structures considered are infinite L-structures unless otherwise indicated.


1983 ◽  
Vol 48 (3) ◽  
pp. 623-628 ◽  
Author(s):  
Julia F. Knight

In [6], Nadel showed that if is a recursively saturated model of Pr = Th(ω, +) of power at most ℵ1, then there is a model such that ≡ ∞ω and can be expanded to a recursively saturated model of P. For a fixed completion T of P, can be chosen to have a recursively saturated expansion to a model of T just in case is recursive in T-saturated. (“Recursive in T-saturation” is defined just like recursive saturation except that the sets of formulas considered are those that are recursive in T.)Nadel also showed in [6] that for a fixed completion T of P, a countable nonstandard model of Pr can be expanded to a model of T (not necessarily recursively saturated) iff satisfies a condition called “exp(T)-saturation.” This condition is stronger than recursive saturation but weaker than recursive in T-saturation. Nadel left open the problem of characterizing the models of Pr of power ℵ1 such that for some , ≣ ∞ω and can be expanded to a model of T. The present paper gives such a characterization. The condition on is that it is recursively saturated, and for each n ∈ ω, the set Tn of Πn-sentences of T is recursive in some type realized in .This result can be interpreted in various ways, just as the results from [6] were interpreted in various ways in [4]. Friedman [2] introduced the notion of a “standard system.”


Sign in / Sign up

Export Citation Format

Share Document