We prove a main gap theorem for e-saturated submodels of a homogeneous structure. We also study the number of e-saturated models, which are not elementarily embeddable to each other
We show that if M is a stable unsuperstable homogeneous structure, then for most kappa < |M|, the number of elementary submodels of M of power kappa is 2^kappa .
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_θ$. We show that forcing with this poset adds a Kurepa tree $T$. Moreover, if $\mathcal P_c$ is a suborder of $\mathcal P$ containing only continuous matrices, then the Kurepa tree $T$ is almost Souslin, i.e. the level set of any antichain in $T$ is not stationary in $ω_1$.
This article is an investigation of a method of deriving a topology from a space and an elementary submodel containing it. We first define and give the basic properties of this construction, known as $X/M$. In the next section, we construct some examples and analyse the topological relationship between $X$ and $X/M$. In the final section, we apply $X/M$ to get novel results about Lindelöf spaces, giving partial answers to a question of F.D. Tall and another question of Tall and M. Scheepers.
Matthew Baker investigated, in previous work, an elegant, infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an important technique from set theory, or a different technique from infinite game theory, may be used to answer Baker's question on whether this game provides a precise characterization for countable subsets of real numbers, and we connect this game to the well-studied Banach-Mazur game from topology.
In this note, we use elementary submodels to prove that a separable monotonically normal compactum can be mapped on a separable metric space via a continuous function whose fibers have cardinality at most 2.
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of Nash-Williams's theorem on cycle-decomposition of graphs, and finally we improve a decomposition theorem of Laviolette concerning bond-faithful decompositions of graphs.
We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its value group is stably embedded in its corresponding extension, its residue field is stably embedded in its corresponding extension, and the extension of valued fields satisfies a certain algebraic condition. We show for instance that all types over the Hahn field $\mathbb{R}((\mathbb{Z}))$ are definable. Similarly, all types over the quotient field of the Witt…
We study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [T. Hyttinen, On nonstructure of elementary submodels of a stable homogeneous structure, Fundamenta Mathematicae, 156(1998): 167-182]. We apply this to prove a structure theorem. We also show that dop and sdop are essentially equivalent, where the negation of dop is the property we use in our structure theorem and sdop implies nonstructure.
In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $λ>μ\geq LS(\mathcal{K})$ and $θ$ is a limit ordinal $<λ^+$. If $\mathcal{K}$ is $μ$ superstable and $μ^+$-superstable and satisfies $μ^+$-symmetry, then for any increasing sequence $\langle M_i\mid i<θ\rangle$ of $μ^+$-saturated models of cardinality $λ$, the model $\bigcup_{i<θ}M_i$ is $μ^+$-saturated.
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This phenomenon is called automatic homeomorphicity. In this paper we show that whenever the automorphism group of a countable saturated structure has automatic homeomorphicity and a trivial center, then the monoid of elementary self-embeddings has automatic homeomorphicity, too. As a second result we strengthen a result by Lascar by showing that whenever $\mathbf{A}$ is…
Our main result (Theorem 1) suggests a possible dividing line ($μ$-superstable $+$ $μ$-symmetric) for abstract elementary classes without using extra set-theoretic assumptions or tameness. This theorem illuminates the structural side of such a dividing line. Theoerem 1: Let $\mathcal{K}$ be an abstract elementary class with no maximal models of cardinality $μ^+$ which satisfies the joint embedding and amalgamation properties. Suppose $μ\geq LS(\mathcal{K})$. If $\mathcal{K}$ is $μ$- and $μ^+$-superstable and satisfies $μ^+$-symmetry, then for any increasing sequence $\langle M_i\in\mathcal{K}_…
We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism class of their absolute Galois groups. Our results concern two cases: saturated PAC structures and non-saturated PAC structures.
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy and to falsify. We show, by means of an elementary chains construction, that each model can be elementarily extended to a saturated model where as many types as possible are realized. In order to prove this theorem we obtain, as by-products, some results on tableaux (understood as pairs of sets of formulas) and their consistency and satisfiability, and a gener…
In this paper we address a problem posed by Shelah in 1999 to find a suitable notion for superstability for abstract elementary classes in which limit models of cardinality $μ$ are saturated. Theorem 1. Suppose that $\mathcal{K}$ is a $χ$-tame abstract elementary class with no maximal models satisfying the joint embedding property and the amalgamation property. Suppose $μ$ is a cardinal with $μ\geq\beth_{(2^{LS(\mathcal{K})+χ})^+}$. Let $M$ be a model of cardinality $μ$. If $\mathcal{K}$ is both $χ$-stable and $μ$-stable and satisfies the $μ$-superstability assumptions, then any two $μ$-limit …
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already, we significantly broaden this framework by developing the corresponding technique for countably closed models of size continuum. The applications range from various theorems on paradoxical decompositions of the plane, to coloring sparse set systems, results on graph chromatic number and constructions from point-set topology. Our main purpose is to demonstra…
We show how to build primes models in classes of saturated models of abstract elementary classes (AECs) having a well-behaved independence relation: $\mathbf{Theorem.}$ Let $K$ be an almost fully good AEC that is categorical in $\text{LS} (K)$ and has the $\text{LS} (K)$-existence property for domination triples. For any $λ> \text{LS} (K)$, the class of Galois saturated models of $K$ of size $λ$ has prime models over every set of the form $M \cup \{a\}$. This generalizes an argument of Shelah, who proved the result when $λ$ is a successor cardinal.
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to find dividing lines, prove their consequences, prove "structure theorems, positive theorems" on those in the "low side" (in particular stable and superstable theories), and prove "non-structure, complexity theorems" on the "high side". It has started with categoricity and number of non-isomorphic models. It is probably recognized as the central part of model …
lambda-good frame is for us a parallel of the class of models of a superstable theory. Our main line is to start with lambda-good^+ frame s, categorical in lambda, n-successful for n large enough and try to have parallel of stability theory for K_{s(+l)} for l<n not too large. Characteristically from time to time we have to increase n relative to l to get our desirable properties; we do not critically mind the exact n, so one may think of an omega-successful s. A posteriori we are interested in the model theory of such classes K_s per-se, and see as a test for this theory, that in the omega-su…
For $K$ an abstract elementary class with amalgamation and no maximal models, we show that categoricity in a high-enough cardinal implies structural properties such as the uniqueness of limit models and the existence of good frames. This improves several classical results of Shelah. $\mathbf{Theorem}$ Let $μ\ge \text{LS} (K)$. If $K$ is categorical in a $λ\ge \beth_{\left(2^μ\right)^+}$, then: 1) Whenever $M_0, M_1, M_2 \in K_μ$ are such that $M_1$ and $M_2$ are limit over $M_0$, we have $M_1 \cong_{M_0} M_2$. 2) If $μ> \text{LS} (K)$, the model of size $λ$ is $μ$-saturated. 3) If $μ\ge \beth_…
We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness (a locality property for orbital types), and are stable (in terms of the number of orbital types) in some cardinal. Assuming the singular cardinal hypothesis (SCH), we prove a full characterization of the (high-enough) stability cardinals, and connect the stability spectrum with the behavior of saturated models. We deduce (in ZFC) that if a class is stable on a tail of cardinals, then it has no long splitting chains (the converse is known). This indicates that there is a clear not…
In this paper we analyze the relationship between o-minimal structures and the notion of ω-saturated one dimensional t.t.t structures. We prove that if removing any point from such a structure splits it into more than one definably connected component then it must be a one dimensional simplex of a finite number of o-minimal structures. In addition, we show that even if removing points doesn't split the structure, additional topological assumptions ensure that the structure is locally o-minimal. As a corollary we obtain the result that if an ω-saturated one dimensional t.t.t structure admits a …
We prove a version of a small index property theorem for strong amalgamation classes. Our result builds on an earlier theorem by Lascar and Shelah (in their case, for saturated models of uncountable first-order theories). We then study versions of the small index property for various non-elementary classes. In particular, we obtain the small index property for quasiminimal pregeometry structures.
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for transparency, a model M is kappa-resplendent means: when we expand M by <kappa individual constants (c_i:i < alpha), if (M, c_i)_ {i<alpha} has an elementary extension expandable to be a model of T' where Th((M,c_i)_{i<alpha}) subseteq T', |T'| < kappa then already (M,c_i)_{i<α} can be expanded to a model of T'. Trivially any saturated model of cardinality lambda is la…