We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had previously been (...) open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)

When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, leading to notions of pseudo-elementary classes, and the other is to allow infinite conjuncts and disjuncts. In this paper we examine the intersection. Namely, we address the question: Which classes of structures are both pseudo-elementary and ${\mathcal {L}}_{\omega _1, \omega }$ -elementary? (...) We find that these are exactly the classes that can be defined by an infinitary formula that has no infinitary disjunctions. (shrink)

The goal of this paper is to generalise Alex Rennet's proof of the non‐axiomatizability of the class of pseudo‐o‐minimal structures. Rennet showed that if is an expansion of the language of ordered fields and is the class of pseudo‐o‐minimal ‐structures (‐structures elementarily equivalent to an ultraproduct of o‐minimal structures) then is not computably axiomatizable. We give a general version of this theorem, and apply it to several classes of structures.

We show that Zilber’s conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in pseudo-exponentiation leads to a description of the elementary embeddings, and the result that pseudo-exponential fields are precisely the models of their common first-order theory which are atomic over exponential transcendence bases. We also show that the class of all pseudo-exponential fields is an example (...) of a nonfinitary abstract elementary class, answering a question of Kesälä and Baldwin. (shrink)

We define and investigate a family of local–global principles for fields involving both orderings and p-valuations. This family contains the PAC, PRC and PpC fields and exhausts the class of pseudo classically closed fields. We show that the fields satisfying such a local–global principle form an elementary class, admit diophantine definitions of holomorphy domains, and their orderings satisfy the strong approximation property.

A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes . We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled 69–88).

A class K of structures is controlled if, for all cardinals λ, the relation of L ∞,λ-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive linear orders is controlled, while any pseudo-elementary class with the ω-independence property is not controlled.

In this paper we study abstract elementary classes using infinitary logics and prove a number of results relating them. For example, if is an a.e.c. with Löwenheim–Skolem number κ then is closed under L∞,κ+-elementary equivalence. If κ=ω and has finite character then is closed under L∞,ω-elementary equivalence. Analogous results are established for . Galois types, saturation, and categoricity are also studied. We prove, for example, that if is finitary and λ-categorical for some infinite λ then there (...) is some σLω1,ω such that and contain precisely the same models of cardinality at least λ. (shrink)

In this paper we study abstract elementary classes with Löwenheim-Skolem number $\kappa$ , where $\kappa$ is cofinal with $\omega$ , which have finite character. We generalize results obtained by Kueker for $\kappa=\omega$ . In particular, we show that $\mathbb{K}$ is closed under $L_{\infty,\kappa}$ -elementary equivalence and obtain sufficient conditions for $\mathbb{K}$ to be $L_{\infty,\kappa}$ -axiomatizable. In addition, we provide an example to illustrate that if $\kappa$ is uncountable regular then $\mathbb{K}$ is not closed under $L_{\infty,\kappa}$ -elementary (...) equivalence. (shrink)

Dealing with topics of definability, this paper provides some interesting insights into the expressive power of basic modal logic. After some preliminary work it presents an abstract algebraic characterization of the elementary classes of basic modal logic, that is, of the classes of models that are definable by means of (sets of) basic modal formulas. Taking that for a start, the paper further contains characterization results for modal universal classes and modal positive classes.

We investigate properties of accessible categories with directed colimits and their relationship with categories arising from ShelahʼsElementary Classes. We also investigate ranks of objects in accessible categories, and the effect of accessible functors on ranks.

Fisher [10] and Baur [6] showed independently in the seventies that if T is a complete first-order theory extending the theory of modules, then the class of models of T with pure embeddings is stable. In [25, 2.12], it is asked if the same is true for any abstract elementary class $(K, \leq _p)$ such that K is a class of modules and $\leq _p$ is the pure submodule relation. In this paper we give some instances where this is (...) true:Theorem.Assume R is an associative ring with unity. Let $(K, \leq _p)$ be an AEC such that $K \subseteq R\text {-Mod}$ and K is closed under finite direct sums, then: •If K is closed under pure-injective envelopes, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda \geq \operatorname {LS}(\mathbf {K})$ such that $\lambda ^{|R| + \aleph _0}= \lambda $.•If K is closed under pure submodules and pure epimorphic images, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda $ such that $\lambda ^{|R| + \aleph _0}= \lambda $.•Assume R is Von Neumann regular. If $\mathbf {K}$ is closed under submodules and has arbitrarily large models, then $\mathbf {K}$ is $\lambda $ -stable for every $\lambda $ such that $\lambda ^{|R| + \aleph _0}= \lambda $.As an application of these results we give new characterizations of noetherian rings, pure-semisimple rings, Dedekind domains, and fields via superstability. Moreover, we show how these results can be used to show a link between being good in the stability hierarchy and being good in the axiomatizability hierarchy.Another application is the existence of universal models with respect to pure embeddings in several classes of modules. Among them, the class of flat modules and the class of $\mathfrak {s}$ -torsion modules. (shrink)

Let be a saturated model of inaccessible cardinality, and let be arbitrary. Let denote the expansion of with a new predicate for. Write for the collection of subsets such that ≡. We prove that if the VC-dimension of is finite then is externally definable.

The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah’s Categoricity Conjecture in this context. Here we tackle a problem of Shelah and Villaveces by proving that in their context, the uniqueness of limit models follows from categoricity under the assumption that the subclass of amalgamation bases is closed under unions of bounded, -increasing chains.

We characterize the elementary classes generated from a distinguished subclass closing by taking direct products and elementary equivalence. In the second part we give the same characterization in terms of atomic Boolean products. In the last part, we study the cases when the class of Boolean products is elementary but is not given by a discriminator.

In this paper we study a specific subclass of abstract elementary classes. We construct a notion of independence for these AEC’s and show that under simplicity the notion has all the usual properties of first order non-forking over complete types. Our approach generalizes the context of 0-stable homogeneous classes and excellent classes. Our set of assumptions follow from disjoint amalgamation, existence of a prime model over 0/, Löwenheim–Skolem number being ω, -tameness and a property we call (...) finite character. We also start the studies of these classes from the 0-stable case. Stability in 0 and -tameness can be replaced by categoricity above the Hanf number. Finite character is the main novelty of this paper. Almost all examples of AEC’s have this property and it allows us to use weak types, as we call them, in place of Galois types. (shrink)

We propose the notion of a quasiminimal abstract elementary class. This is an AEC satisfying four semantic conditions: countable Löwenheim–Skolem–Tarski number, existence of a prime model, closure under intersections, and uniqueness of the generic orbital type over every countable model. We exhibit a correspondence between Zilber’s quasiminimal pregeometry classes and quasiminimal AECs: any quasiminimal pregeometry class induces a quasiminimal AEC, and for any quasiminimal AEC there is a natural functorial expansion that induces a quasiminimal pregeometry class. We show (...) in particular that the exchange axiom is redundant in Zilber’s definition of a quasiminimal pregeometry class. (shrink)

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of a parabolic subgroup. We show that the class of all right-angled Coxeter groups is not smooth and establish some general combinatorial criteria for such classes to be abstract elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove two combinatorial conditions ensuring the strong rigidity of a right-angled Coxeter group of arbitrary rank. The combination (...) of these results translates into a machinery to build concrete examples of AECs satisfying given model-theoretic properties. We exhibit the power of our method by constructing three concrete examples of finitary classes. We show that the first and third classes are nonhomogeneous and that the last two are tame, uncountably categorical, and axiomatizable by a single Lω1,ω-sentence. We also observe that the isomorphism relation of any countable complete first-order theory is κ-Borel reducible (in the sense of generalized descriptive set theory) to the isomorphism relation of the theory of right-angled Coxeter groups whose Coxeter graph is an infinite random graph. (shrink)

We suggest a method of finding a notion of type to abstract elementary classes and determine under what assumption on these types the class has a well-behaved homogeneous and universal "monster" model, where homogeneous and universal are defined relative to our notion of type.

The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by restricting to positive and deliberate uses. Rather than using an ad hoc proof, we give a general framework of abstract Skolemizations. This method gives a uniform proof that a wide rang of classes are Abstract Elementary Classes.

In this paper we study abstract elementary classes of modules. We give several characterizations of when the class of modules A with is abstract elementary class with respect to the notion that M1 is a strong submodel M2 if the quotient remains in the given class.

We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper, we explore stability results in this new context. We assume that [Formula: see text] is a tame abstract elementary class satisfying the amalgamation property with no maximal model. The main results include:. Theorem 0.1. Suppose that [Formula: see text] is not only tame, but [Formula: see text]-tame. If (...) [Formula: see text] and [Formula: see text] is Galois stable in μ, then [Formula: see text], where [Formula: see text] is a relative of κ from first order logic. [Formula: see text] is the Hanf number of the class [Formula: see text]. It is known that [Formula: see text]. The theorem generalizes a result from [17]. It is used to prove both the existence of Morley sequences for non-splitting and the following initial step towards a stability spectrum theorem for tame classes:. Theorem 0.2. If [Formula: see text] is Galois-stable in some [Formula: see text], then [Formula: see text] is stable in every κ with κμ=κ. For example, under GCH we have that [Formula: see text] Galois-stable in μ implies that [Formula: see text] is Galois-stable in μ+n for all n < ω. (shrink)

We present a way of topologizing sets of Galois types over structures in abstract elementary classes with amalgamation. In the elementary case, the topologies thus produced refine the syntactic topologies familiar from first order logic. We exhibit a number of natural correspondences between the model-theoretic properties of classes and their constituent models and the topological properties of the associated spaces. Tameness of Galois types, in particular, emerges as a topological separation principle. © 2011 WILEY-VCH Verlag GmbH (...) & Co. KGaA, Weinheim. (shrink)

We introduce a family of rank functions and related notions of total transcendence for Galois types in abstract elementary classes. We focus, in particular, on abstract elementary classes satisfying the condition known as tameness, where the connections between stability and total transcendence are most evident. As a byproduct, we obtain a partial upward stability transfer result for tame abstract elementary classes stable in a cardinal $\lambda$ satisfying $\lambda^{\aleph_{0}}\gt \lambda$, a substantial generalization of a result (...) of Baldwin, Kueker, and VanDieren. (shrink)

We prove a categoricity transfer theorem for tame abstract elementary classes. Theorem 0.1. Suppose that K is a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Let λ ≥ Max{χ.LS(K)⁺}. If K is categorical in λ and λ⁺, then K is categorical in λ⁺⁺. Combining this theorem with some results from [37], we derive a form of Shelah's Categoricity Conjecture for tame abstract elementary classes: Corollary 0.2. (...) Suppose K is a χ-tame abstract elementary class satisfying the amalgamation and joint embedding properties. Let μ₀:= Hanf(K). If χ ≤ ‮ב‬(2μ0)+ and K is categorical in some λ⁺ > ‮ב‬(2μ0)+, then K is categorical in μ for all μ > ‮ב‬(2μ0)+. (shrink)

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also (...) present an application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)

In this paper, we study a stability transfer theorem in d-tame metric abstract elementary classes, in a similar way as in 2, but using superstability-like assumptions which involves a new independence notion instead of ℵ0-locality.

Theorem 0.1LetK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}be an abstract elementary class with amalgamation and no maximal models. Letλ>LS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda > {LS}$$\end{document}. IfK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is categorical inλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, then the model of cardinalityλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}is Galois-saturated.This answers a question asked independently by Baldwin (...) and Shelah. We deduce several corollaries: K\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document} has a unique limit model in each cardinal below λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, K\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document} is weakly tame below λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, and the thresholds of several existing categoricity transfers can be improved.We also prove a downward transfer of solvability :Corollary 0.2LetK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}be an AEC with amalgamation and no maximal models. Letλ>μ>LS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda> \mu > {LS}$$\end{document}. IfK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is solvable inλ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, thenK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {K}$$\end{document}is solvable inμ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}. (shrink)

We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo-elementary class, it is not elementary nor even ℒ∞ω-axiomatizable. We also axiomatize the first-order theory of this class.

We prove Baldwin-Lachlan theorem for local (LS(K)-)tame abstract elementary classes K with disjoint amalgamation property and with LS(K)=ω.

We show that for any uncountable cardinal λ, the category of sets of cardinality at least λ and monomorphisms between them cannot appear as the category of points of a topos, in particular is not the category of models of a ${L_{\infty,\omega }}$-theory. More generally we show that for any regular cardinal $\kappa < \lambda$ it is neither the category of κ-points of a κ-topos, in particular, nor the category of models of a ${L_{\infty,\kappa }}$-theory.The proof relies on the construction (...) of a categorified version of the Scott topology, which constitute a left adjoint to the functor sending any topos to its category of points and the computation of this left adjoint evaluated on the category of sets of cardinality at least λ and monomorphisms between them. The same techniques also apply to a few other categories. At least to the category of vector spaces of with bounded below dimension and the category of algebraic closed fields of fixed characteristic with bounded below transcendence degree. (shrink)

The stability theory of first order theories was initiated by Saharon Shelah in 1969. The classification of abstract elementary classes was initiated by Shelah, too. In several papers, he introduced non-forking relations. Later, Shelah [17, II] introduced the good non-forking frame, an axiomatization of the non-forking notion.We improve results of Shelah on good non-forking frames, mainly by weakening the stability hypothesis in several important theorems, replacing it by the almost λ-stability hypothesis: The number of types over a model (...) of cardinality λ is at most λ+.We present conditions on Kλ, that imply the existence of a model in Kλ+n for all n. We do this by providing sufficiently strong conditions on Kλ, that they are inherited by a properly chosen subclass of Kλ+. What are these conditions? We assume that there is a ‘non-forking’ relation which satisfies the properties of the non-forking relation on superstable first order theories. Note that here we deal with models of a fixed cardinality, λ.While in Shelah [17, II] we assume stability in λ, so we can use brimmed models, here we assume almost stability only, but we add an assumption: The conjugation property.In the context of elementary classes, the superstability assumption gives the existence of types with well-defined dimension and the ω-stability assumption gives the existence and uniqueness of models prime over sets. In our context, the local character assumption is an analog to superstability and the density of the class of uniqueness triples with respect to the relation ≼bs is the analog to ω-stability. (shrink)

We highlight connections between accessible categories and abstract elementary classes , and provide a dictionary for translating properties and results between the two contexts. We also illustrate a few applications of purely category-theoretic methods to the study of AECs, with model-theoretically novel results. In particular, the category-theoretic approach yields two surprising consequences: a structure theorem for categorical AECs, and a partial stability spectrum for weakly tame AECs.

We study versions of limit models adapted to the context of metric abstract elementary classes. Under categoricity and superstability-like assumptions, we generalize some theorems from 7, 15-17. We prove criteria for existence and uniqueness of limit models in the metric context.

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion Q such that, in any Q-generic extension of the universe, there are non-isomorphic models M 1 and M 2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `c.c.c.' is replaced by other cardinal-preserving adjectives. We also give (...) an example showing that membership in a pseudo-elementary class can be altered by very simple cardinal-preserving forcings. (shrink)

In the paper “Categoricity in abstract elementary classes with no maximal models”, we address gaps in Saharon Shelah and Andrés Villavecesʼ proof in [4] of the uniqueness of limit models of cardinality μ in λ-categorical abstract elementary classes with no maximal models, where λ is some cardinal larger than μ. Both [4] and [5] employ set theoretic assumptions, namely GCH and Φμ+μ+).Recently, Tapani Hyttinen pointed out a problem in an early draft of [3] to Villaveces. This (...) problem stems from the proof in Shelah and Villavecesʼ [4] that reduced towers are continuous. Residues of this problem also infect the proof of Proposition II.7.2 in VanDieren [5]. We respond to the issues in Shelah and Villaveces [4] and VanDieren [5] with alternative proofs under the strengthened assumption that the abstract elementary class is categorical in μ+. (shrink)

We continue our study of finitary abstract elementary classes, defined in [7]. In this paper, we prove a categoricity transfer theorem for a case of simple finitary AECs. We introduce the concepts of weak κ-categoricity and f-primary models to the framework of א₀-stable simple finitary AECs with the extension property, whereby we gain the following theorem: Let (������, ≼ ������ ) be a simple finitary AEC, weakly categorical in some uncountable κ. Then (������, ≼ ������ ) is weakly (...) categorical in each λ ≥ min { \group{ \{\kappa,\beth_{ \group{ (2^{ \aleph_{ 0 _} ^});^{ + ^} \group} _}\}; \group} . If the class (������, ≼ ������ ) is also LS(������)-tame, weak κ-categoricity is equivalent with κ-categoricity in the usual sense. We also discuss the relation between finitary AECs and some other non-elementary frameworks and give several examples. (shrink)

We prove that from categoricity in λ+ we can get categoricity in all cardinals ≥ λ+ in a χ-tame abstract elementary classe [Formula: see text] which has arbitrarily large models and satisfies the amalgamation and joint embedding properties, provided [Formula: see text] and λ ≥ χ. For the missing case when [Formula: see text], we prove that [Formula: see text] is totally categorical provided that [Formula: see text] is categorical in [Formula: see text] and [Formula: see text].

A new case of Shelah's eventual categoricity conjecture is established: Let be an abstract elementary class with amalgamation. Write and. Assume that is H2‐tame and has primes over sets of the form. If is categorical in some, then is categorical in all. The result had previously been established when the stronger locality assumptions of full tameness and shortness are also required. An application of the method of proof of the mentioned result is that Shelah's categoricity conjecture holds in the (...) context of homogeneous model theory (this was known, but our proof gives new cases): If D be a homogeneous diagram in a first‐order theory T and D is categorical in a, then D is categorical in all. (shrink)

Shelah has shown that $\aleph_1$-categoricity for Abstract Elementary Classes (AECs) is not absolute in the following sense: There is an example $K$ of an AEC (which is actually axiomatizable in the logic $L(Q)$) such that if $2^{\aleph_0}.

Grossberg and VanDieren have started a program to develop a stability theory for tame classes. We name some variants of tameness and prove the following. Let K be an AEC with Löwenheim-Skolem number ≤κ. Assume that K satisfies the amalgamation property and is κ-weakly tame and Galois-stable in κ. Then K is Galois-stable in κ⁺ⁿ for all n<ω. With one further hypothesis we get a very strong conclusion in the countable case. Let K be an AEC satisfying the amalgamation (...) property and with Löwenheim-Skolem number ℵ₀ that is ω-local and ℵ₀-tame. If K is ℵ₀-Galois-stable then K is Galois-stable in all cardinalities. (shrink)

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, the so-called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore, we give an example where the Galois type itself does not have finite character in such a class.

We give a complete and elementary proof of the following upward categoricity theorem: let be a local abstract elementary class with amalgamation and joint embedding, arbitrarily large models, and countable Löwenheim–Skolem number. If is categorical in 1 then is categorical in every uncountable cardinal. In particular, this provides a new proof of the upward part of Morley’s theorem in first order logic without any use of prime models or heavy stability theoretic machinery.

In the setup of abstract elementary classes satisfying a local version of superstability, we prove the uniqueness property for μ‐forking, a certain independence notion arising from splitting. This had been a longstanding technical difficulty when constructing forking‐like notions in this setup. As an application, we show that the two versions of forking symmetry appearing in the literature (the one defined by Shelah for good frames and the one defined by VanDieren for splitting) are equivalent.