betaFeedback

WorksMathematics

Eventual categoricity for abstract elementary classes

Abstract

We prove Shelah's eventual categoricity conjecture for abstract elementary classes in ZFC. For each infinite bound on the Löwenheim–Skolem number there is a uniform threshold such that categoricity in any one cardinal at or above that threshold implies categoricity in every cardinal at or above the same threshold.

Introduction

Categoricity asks whether cardinality determines a model up to isomorphism. For abstract elementary classes, the eventual categoricity conjecture predicts that uniqueness in one sufficiently large cardinal forces uniqueness in every cardinal above a uniform threshold. We prove this prediction in ZFC, with the threshold depending only on a bound for the Löwenheim–Skolem number.

The statement

We specify the axioms, including the union clause used throughout the proof. All structures have sets as their universes, and all languages are set-sized and finitary. We write ∣M∣|M| for the universe of a structure and ∥M∥\lVert M\rVert for its cardinality.

Definition 1.1 (Abstract elementary class). An abstract elementary class (AEC) is a pair K=(C,≤K)K = (\mathcal{C}, \leq_K), where C\mathcal{C} is a class of structures in a fixed language τ\tau and ≤K\leq_K is a partial order satisfying the following conditions.

(1) The class is closed under isomorphism. If M≤KNM \leq_K N, then MM is a τ\tau-substructure of NN. If f:N≅N′f : N \cong N' and M≤KNM \leq_K N, then f[M]≤KN′f[M] \leq_K N'.

(2) Coherence: if M0M_0 is a τ\tau-substructure of M1M_1, and M0≤KM2M_0 \leq_K M_2 and M1≤KM2M_1 \leq_K M_2, then M0≤KM1M_0 \leq_K M_1.

(3) For every nonzero ordinal δ\delta and increasing chain (Mi:i<δ)(M_i : i < \delta) under ≤K\leq_K, its union UU belongs to C\mathcal{C} and Mi≤KUM_i \leq_K U for all i<δi < \delta. If also Mi≤KNM_i \leq_K N for every ii, then U≤KNU \leq_K N.

(4) There is an infinite cardinal ℓ≥∣τ∣+ℵ0\ell\geq|\tau| + \aleph_0 such that, for every M∈CM \in\mathcal{C} and A⊆∣M∣A \subseteq|M|, there is N≤KMN \leq_K M with A⊆∣N∣A \subseteq|N| and ∥N∥≤∣A∣+ℓ\lVert N\rVert\leq|A| + \ell.

The least possible ℓ\ell is denoted LS⁡(K)\operatorname{LS}(K). A strong map is an isomorphism onto a strong substructure of its codomain. The class is categorical in κ\kappa if it has a model of cardinality κ\kappa and all its models of that cardinality are isomorphic.

The chain axioms equivalently give unions and the common-upper-bound clause for nonempty set-indexed directed systems of strong inclusions. We also use the corresponding direct limits of coherent strong maps, obtained by renaming their injective images. No intersection axiom is included.

Theorem 1.2 (Uniform eventual categoricity). For every infinite cardinal λ\lambda there is a cardinal μ(λ)≥λ\mu(\lambda) \geq\lambda such that the following holds for every AEC KK with LS⁡(K)≤λ\operatorname{LS}(K) \leq\lambda:

(∃κ≥μ(λ)K is categorical in κ)⟹(∀κ′≥μ(λ)K is categorical in κ′).(\exists\kappa\geq\mu(\lambda)\quad K\text{ is categorical in }\kappa) \quad\Longrightarrow\quad (\forall\kappa' \geq\mu(\lambda)\quad K\text{ is categorical in }\kappa').

The same threshold is used in the premise and the conclusion.

In particular, Theorem 1.2 resolves Shelah’s eventual categoricity conjecture positively. No amalgamation, joint embedding, tameness, no-maximal-models, or arbitrarily-large-models hypothesis is assumed. The starting categoricity cardinal may be a successor, a regular limit, or a singular cardinal. The theorem asserts the existence of a threshold, without prescribing a numerical bound for it.

On the resulting categorical tail, every model strongly embeds into every model of at least its cardinality. Indeed, the Löwenheim–Skolem axiom supplies a strong submodel of the smaller cardinality, and categoricity identifies it with the given model. Taking a larger target gives proper strong extensions and a common target for any two models. Thus the tail has joint embedding and no maximal models.

It is useful to separate the uniform quantifier from the main structural argument.

Theorem 1.3 (The qualitative form). An AEC categorical in unboundedly many cardinals is categorical on a tail of the cardinals.

Here “unbounded” means unbounded in the class of all cardinals, and a tail contains every cardinal above some fixed cardinal. The set-coding argument in Proposition 2.3 proves the equivalence of the two theorems. Once that reduction is made, arbitrarily large models are available. The order construction in Theorem 2.6 then supplies actual models at every sufficiently large cardinal; subsequent categoricity arguments concern both existence and uniqueness.

The uniform theorem applies in particular to sentences of Lω1,ωL_{\omega_1,\omega} in countable languages, where countable conjunctions and disjunctions are allowed but quantifier strings are finite. For such a sentence φ\varphi, choose a countable fragment containing it and order its models by elementarity for that fragment. This is an AEC with Löwenheim–Skolem number ℵ0\aleph_0 [4] [Example 2.0.2]. The models and their isomorphisms are unchanged, so the same μ(ℵ0)\mu(\aleph_0) works for all these sentences. The prescribed ℶω1\beth_{\omega_1} threshold in the classical infinitary formulation remains a separate question [3] [Conjecture 1.1].

History and scope

Morley’s categoricity theorem gives the countable first-order prototype: a countable theory categorical in one uncountable cardinal is categorical in every uncountable cardinal [12]. Its structural approach connects uniqueness of models with stability and dimension. The geometry of strongly minimal sets, developed by Baldwin and Lachlan [1] [Sections 1–2], provides a central antecedent for classification by bases. In an AEC, elementary compactness and the first-order description of types are not part of the axioms. The corresponding amalgamation, independence, and geometry therefore require separate constructions.

Shelah’s eventual categoricity conjecture asks for an eventual dichotomy between categoricity and noncategoricity; see [15] [Conjecture N.4.2] and [3]. The equivalent formulation using one threshold depending on an LS bound is discussed in [17] [Remark 1.3]. Our set-coding argument makes that reduction explicit: it treats bounded categoricity spectra as well as classes categorical at unboundedly many cardinals. An explicit numerical threshold is a further question, separate from the existential threshold in Theorem 1.2; compare [15] [Conjecture N.4.3(1)(b)]. Under CH, the companion [13] [Theorem 1.1] constructs an AEC KK with LS⁡(K)=ℵ0\operatorname{LS}(K)=\aleph_0 that is categorical on a higher tail but not at ℶ(2ℵ0)+=ℵ2\beth_{(2^{\aleph_0})^+}=\aleph_2, ruling out this prescribed endpoint for arbitrary AECs.

Substantial special cases have been established. Makkai and Shelah proved transfer from sufficiently large successor categoricity for Lκ,ωL_{\kappa,\omega}-theories when κ\kappa is strongly compact [11] [Conclusion 5.1]. Grossberg and VanDieren obtained upward categoricity transfer from one sufficiently large successor cardinal for tame AECs with amalgamation, joint embedding, and arbitrarily large models [10] [Theorem 5.2]. Boney subsequently derived tameness from strongly compact cardinals and, combining it with the Grossberg–VanDieren transfer, established eventual categoricity for arbitrary AECs with a successor starting cardinal under a proper class of strongly compact cardinals [2]. These results explain the importance of removing restrictions on the starting cardinal as well as structural hypotheses on the class.

Universal classes admit a ZFC transfer without assuming amalgamation [18]. Tameness, amalgamation, and primes give another transfer [19]. Shelah and Vasey prove a ZFC categoricity theorem for excellent AECs and obtain broader results using strongly compact cardinals, or the weak generalized continuum hypothesis (WGCH), that is, 2κ<2κ+2^\kappa< 2^{\kappa^+} for every infinite cardinal κ\kappa, together with amalgamation [16]. Under WGCH, amalgamation, and arbitrarily large models, Vasey also gives a classification of categoricity spectra [20]. These hypotheses supply substantial structure. Here the amalgamation, bounded-tuple calculus, and geometry needed for the working schemes are constructed at selected levels from the AEC axioms and unbounded categoricity.

The proof uses several established methods in forms that are proved locally. Order presentations originate in the work of Ehrenfeucht and Mostowski [5]; their AEC formulation and functorial maps are developed in [15]. We retain a finite-support presentation throughout the proof. Its extraction uses classical partition-calculus methods [6], while the later isolation argument uses Fodor’s pressing-down method [9]. Stationary independence and local character are central to Shelah’s good frames [15]. Sections 6 and 7 establish the bounded-tuple calculus, relative isolation, and dominated extensions required for the systems used here.

A version-sensitive issue matters for the order argument. Boney and Vasey [3] identify a gap in the unrestricted syntactic-characterization claim of Shelah’s Chapter IV and withdraw an earlier attempted repair. Their valid variants with exponentiation or cofinality assumptions do not cover all the starting cardinals of Theorem 1.2. We prove the required reversal of strong maps directly in Theorem 3.11.

Finite systems and dimension-raising arguments have a long history in nonelementary categoricity. Shelah’s existence and uniqueness methods [14] are antecedents of the passage from one additional dimension to a larger cardinal. The modern treatment in [16] distinguishes amalgamated completion from strong uniqueness onto a prescribed target. Both properties are needed below and are proved separately. Our final cardinal induction uses exact boundary maps for systems whose basis pieces may have different cardinalities.

Espíndola has announced eventual categoricity for arbitrary AECs and further accessible-category results [7], and subsequently an explicit-threshold categoricity theorem [8]. These are separate public claims. The argument here constructs its working-scheme calculus, isolation, marked and geometric boundary lifting, and common-level closure directly. None of these interfaces is imported from those preprints.

Proof overview

By the set-coding reduction in Section 2, it suffices to fix one AEC KK categorical in unboundedly many cardinals and prove categoricity on a tail. The proof first builds structure at selected cardinals, called working levels, and only at the end transfers it to every larger cardinal. A tuple is bounded at a level μ\mu when its length is strictly less than μ\mu.

From orders to comparison of tuples. An order presentation EE assigns a model to a linear order: each element is represented by a label and finitely many indices, and an order embedding induces a strong map by substituting indices. Section 3 uses specially chosen orders to control the automorphism orbits of short tuples. A small subpresentation can be aligned with a larger presentation so that all its short tuples have matching orbit records. An elimination chain then proves that a strong map can be reversed on any prescribed short tuple. The small model supplies the alignment; the larger model accommodates the enumeration of the small model’s tuples. This avoids an exponentiation hypothesis at the categoricity cardinal.

In Section 4, the resulting equivalence classes of tuples under strong maps stabilize as the categoricity cardinal increases. These are the comparison diagrams used later. Finite supports give two further tools: a bound on the parameter sets needed to distinguish comparisons, and simultaneous placement of coherent bounded prescriptions. Together they yield amalgamation and homogeneity for bounded tuples at suitable countably cofinal closure levels.

A calculus that can be applied to systems. The same tools will be needed for finite systems of models, not only for individual models. Section 5 records their precise hypotheses as a working scheme: a finite system shape, specified arrows, one finite-support presentation, and compatible tuple comparisons. Sections 6 and 7 derive the calculus from this package. A type over a base is determined by identification of tuples in an amalgam over that base. Its distinguished free extensions are computed by long approximation sequences already in the base. The isolation construction gives extensions controlled by a specified mark: the full type of each additional bounded tuple, together with the mark, is determined by the mark’s type and a bounded fragment of the base. Such extensions have the primeness and uniqueness needed for iteration.

Marked systems detect growth of a geometry. Section 8 shows that adjoining a finite mark and an extension controlled in this way again gives a working scheme. Iterating produces a model at each subset of a finite axis set, with commuting strong maps. Its boundary consists of the proper-subset vertices and their maps. Section 9 first completes a compatible boundary map into a common extension, then extends a boundary isomorphism onto the prescribed target. The return-tree argument keeps full maps coherent along individual branches but retains only boundary maps in the common accumulator. This distinction lets the orbit bound control joint comparisons across different faces, including their actual equalities.

Section 10 chooses a minimal singleton type, one with a unique nonalgebraic extension over each relevant base. Its realizations form the points of a pregeometry, with independence defined by finite products of the type. We retain a distinguished strong copy of its base model M0M_0, with a fixed diagram for its enumeration, in the later models; these are the pointed models used below. Exact lifting for all finite marked systems at one common level rules out a proper strong extension with no new points. A downward construction then extends this no-growth conclusion to arbitrary larger cardinalities. Thus the geometry detects every proper extension, and its basis cardinality equals model cardinality above the resulting threshold.

From geometric systems to a categorical tail. Sections 11 and 12 organize bases into finitely many pieces assigned to vertices. Tiled order presentations give systems with these pieces; a paired induction establishes their working packages and classification by prescribed basis maps. A second boundary argument gives exact lifting for every finite geometric shape at suitable levels.

The two finite-dimensional applications require separate common-level choices. Section 13 supplies both: fixed set codes for all finite constructions and their bound requests produce a level where every finite depth is available. The geometric application is made after the marked application has supplied the no-growth threshold. Finally, Section 14 starts from a common geometric level and inducts on the maximum cardinality of the basis pieces, simultaneously for all finite shapes. One additional axis records the previously constructed isomorphism at each extension step; coherent unions handle limits. The zero-axis case gives pointed categoricity. The Löwenheim–Skolem axiom and categoricity at one fixed smaller cardinal place the chosen base pattern in every sufficiently large model. Forgetting that base gives the qualitative theorem, and the set-code reduction gives the uniform theorem. Figure 1 summarizes the proof and the two uses of common-level closure.

Qualitative proof flowchart showing unbounded categoricity, order presentations and orbit reversal; single-model diagrams, uniform testing and compact placement; working schemes, free extension and relative isolation, extensions controlled by a mark; minimal type and fixed pointed models; finite marked systems and exact boundary lifting at fixed depth; no proper extension with unchanged points, basis size equals model size on a tail; geometric systems and relative bases, exact lifting for each finite shape; induction through larger cardinalities and categoricity on a tail, with dashed boxes for common marked levels and common geometric levels

Figure 1. The qualitative proof, ordered by its principal dependencies. The two dashed boxes are separate applications of Section 13. The first makes all finite marked depths available for the no-growth argument over the fixed point. The second is chosen after that argument and supplies the starting cardinal for the final transfer. These classes of common levels need not contain a tail. The small-code reduction then gives the uniform threshold of Theorem 1.2.

Conventions

All size variables are cardinals unless explicitly called ordinals. An assertion about bounded tuples at a level μ\mu concerns tuples of length strictly below μ\mu. Eligible working levels have countable cofinality and are strong limits closed under the displayed bounds. Whenever smaller adequate levels are needed cofinally below a working level, that requirement is stated and included in the closure bookkeeping. Automorphisms of an index order always mean automorphisms of its pure linear order. Charts, auxiliary hulls, and basis choices are not added to the structures whose isomorphisms are being compared.

Set codes and models indexed by orders

We first separate the uniformity over AECs from the transfer argument for one AEC. All directed families below are nonempty and set-indexed. We begin by deriving the directed forms of the chain axioms in Definition 1.1.

Lemma 2.1 (Directed unions and coherent direct limits). If a nonempty set of models is directed under strong inclusion, its union belongs to KK and every member is strong in the union. If every member is strong in a common model NN, its union is strong in NN. More generally, a coherent diagram of strong maps indexed by a nonempty directed partial order has a direct limit in KK, with strong canonical maps. Every compatible family of strong maps from the diagram into a model induces a strong map from the direct limit.

Proof. The union is a well-defined τ\tau-structure: finitely many arguments are contained in one family member, and any two choices of such a member agree after passing to a common strong upper member. Here finitarity is used for functions and relations alike. We prove the union and common-upper-bound assertions together by induction on the cardinality of the family. A finite directed family has a member containing every other member, so its union is that member. A countable directed family has a cofinal increasing sequence: enumerate the family and successively choose a member above the previous choice and the next enumerated member. The chain axioms apply to this sequence, including their common-upper-bound clause.

Suppose the family is indexed by a set II of uncountable cardinality κ\kappa, and the two assertions hold for smaller families. Choose an operation assigning to each pair of indices an index of a strong upper bound. Express II as the union of an increasing continuous sequence (Iα)α<cf⁡(κ)(I_\alpha)_{\alpha<\operatorname{cf}(\kappa)} of nonempty subsets of size less than κ\kappa, each closed under that operation. To obtain this sequence, enumerate II by κ\kappa, use a cofinal sequence of ordinals below κ\kappa to specify the required initial segments, close each stage under the binary operation by countably many iterations, and take unions at limit stages. A union of fewer than cf⁡(κ)\operatorname{cf}(\kappa) sets of size less than κ\kappa still has size less than κ\kappa; countable closure preserves the size of each infinite stage. This construction also works when κ\kappa is a successor cardinal, using κ\kappa many stages.

Let UαU_\alpha be the union of the family on IαI_\alpha. The induction hypothesis gives Uα∈KU_\alpha\in K. For α<β\alpha<\beta, every member indexed by IαI_\alpha is strong in UβU_\beta. The inductive common-upper-bound assertion therefore gives Uα≤KUβU_\alpha\leq_K U_\beta. The chain axioms now give the required union over II. If the original

family is strong in NN, induction first gives Uα≤KNU_\alpha\le_K N for every α\alpha, and the chain common-upper-bound clause gives the same conclusion for their union. This completes the induction.

For a diagram (Mi,fij)(M_i, f_{ij}) indexed by a directed partial order, form the quotient of the disjoint union of its underlying sets by

(i,x)∼(j,y)⟺(∃k≥i,j) fik(x)=fjk(y).(i,x) \sim(j,y) \quad\Longleftrightarrow\quad(\exists k \ge i,j)\ f_{ik}(x)=f_{jk}(y).

Directedness and coherence make this an equivalence relation. The canonical map from each MiM_i is injective. Interpret any finitary function or relation in a common later model containing representatives of its arguments; coherence and the fact that the maps are structure embeddings make this interpretation well-defined. The images of the MiM_i are models forming a directed family of strong inclusions. The first assertion puts their union, which is the quotient just constructed, in KK and makes all canonical maps strong.

Finally, compatible strong maps gi:Mi⟶Ng_i:M_i \longrightarrow N induce a map on that quotient. It is injective: if two images agree, compare their representatives in a common later MkM_k and use injectivity of gkg_k. The same argument gives a structure embedding. Its image is the directed union of the strong submodels gi[Mi]g_i[M_i] of NN, so the common-upper-bound assertion makes the induced map strong. The quotient construction also gives uniqueness, and hence the stated direct-limit property. □\square

Lemma 2.2 (Recovery from small models and pairs). Fix an infinite cardinal λ\lambda and a finitary language τ\tau of cardinality at most λ\lambda. An AEC in τ\tau with LS⁡(K)≤λ\operatorname{LS}(K) \le\lambda is determined by its models of cardinality at most λ\lambda and its strong inclusions between such models, both taken up to isomorphism. These data have a set code, and the recovered class and strong-submodel relation are uniformly first-order definable in set theory from that code.

Proof. Represent small structures on ordinals of cardinality at most λ\lambda. Represent a small pair M⊆NM \subseteq N by such a representative for NN together with the distinguished subset that is the domain of MM. The possible structures and pairs form sets. A code specifies which structure types and which pair types are allowed. Testing whether a given small structure or pair has an allowed type is a set-theoretic condition: quantify over the relevant isomorphisms.

For an actual M∈KM \in K, let

D(M)={A≤KM:∥A∥≤λ}.D(M)=\{A \le_K M : \lVert A\rVert\le\lambda\}.

This is a set. It is nonempty by the LS axiom applied to the empty set, and its union is MM by the LS axiom applied to singletons. If A,B∈D(M)A,B \in D(M), the LS axiom inside MM supplies a small strong submodel containing ∣A∣∪∣B∣|A| \cup|B|. Coherence makes both AA and BB strong in that submodel. Thus D(M)D(M) is directed.

Conversely, suppose a structure MM is the union of a nonempty directed family of small structures whose membership and pair inclusions are allowed by the code of KK. These are actual members and strong inclusions of KK, so the directed-union axiom gives M∈KM \in K. Consequently the following condition recovers membership, including for structures not already assumed to belong to KK:

MM is a union of a nonempty directed family of allowed small models, with all its directed inclusions allowed by the small-pair code.

To recover the strong relation, require a directed presentation N=⋃DN = \bigcup D of this kind and a nonempty directed subfamily E⊆DE \subseteq D with M=⋃EM = \bigcup E. If M≤KNM \le_K N, use D=D(N)D = D(N) and E=D(M)E = D(M); transitivity makes the second a subfamily of the first. In the reverse direction, every member of E\mathcal{E} is strong in NN by the union clause for D\mathcal{D}. The common-upper-bound clause for E\mathcal{E} then gives M≤KNM \leq_{\mathcal{K}} N.

Each presentation can be quantified over as a set of substructures of the structure being decoded. All the preceding conditions are thus first-order set-theoretic formulas with the small code as parameter. They recover both the class and the order, as asserted.

The equivalence below is the usual Hanf-number reduction; compare [17], Remark 1.3. We spell out the set coding to make the uniform quantifier explicit.

Proposition 2.3 (The uniform reduction). The uniform assertion in Theorem 1.2 is equivalent to the following qualitative assertion:

Every AEC categorical in unboundedly many cardinals is categorical in all cardinals above some bound depending on that AEC.

Proof. At a fixed LS bound λ\lambda, the languages can be renamed into a fixed set of symbols with specified finite arities. By Lemma 2.2, the possible AECs in those languages are determined by members of a set of small codes. A code is valid exactly when its decoded class and relation satisfy the AEC axioms with LS bound λ\lambda. This is a first-order condition on the code, so the valid codes form a set.

Assume the qualitative assertion. For each valid code cc, its categoricity spectrum is either bounded or unbounded. In the bounded case choose the least infinite cardinal bcb_c strictly above every categoricity cardinal. In the unbounded case choose the least infinite cardinal bcb_c such that the decoded AEC is categorical in every cardinal at least bcb_c. These choices are definable, and the second choice exists by the qualitative assertion. Replacement bounds the set of all bcb_c. Choose a cardinal μ(λ)≥λ\mu(\lambda) \geq\lambda strictly above that set of bounds. If an AEC with LS number at most λ\lambda is categorical at some κ≥μ(λ)\kappa\geq\mu(\lambda), its code cannot be in the bounded-spectrum case. It is therefore categorical at every κ′≥bc\kappa' \geq b_c, in particular at every κ′≥μ(λ)\kappa' \geq\mu(\lambda). This is exactly the same threshold in the premise and conclusion.

Conversely, for an AEC categorical unboundedly often, apply the uniform assertion with λ=LS⁡(K)\lambda= \operatorname{LS}(\mathcal{K}). Some categoricity cardinal crosses the resulting threshold, and the asserted tail follows.

Remark 2.4. Lemma 2.2 also supplies the usual ZFC interpretation of quantification over AECs: one quantifies over their set codes and uses the decoded class predicates. No choice of representatives from a proper class and no class choice axiom is needed. Below we fix one AEC categorical unboundedly often and write ℓ=LS⁡(K)\ell= \operatorname{LS}(\mathcal{K}). It has arbitrarily large models because categoricity includes existence.

A finite-arity partition argument

The following end-homogeneous argument belongs to classical partition calculus; compare Erdős and Rado [6], Theorem 39 and its corollary. We prove the finite-arity form and bounds used by the order-template construction.

Lemma 2.5. For infinite cardinals ξ\xi, ν\nu, and a positive integer kk, there is an infinite cardinal Rk(ξ,ν)R_k(\xi,\nu) such that every coloring of the kk-element subsets of an ordinal of cardinality at least Rk(ξ,ν)R_k(\xi,\nu) into ξ\xi colors has a homogeneous subset of cardinality ν\nu. Finitely many specified arities can be made homogeneous simultaneously by enlarging the initial cardinal.

References

  1. [1][BL71] J. T. Baldwin and A. H. Lachlan. On strongly minimal sets. The Journal of Symbolic Logic, 36(1):79–96, 1971.DOI
  2. [2][Bon14] Will Boney. Tameness from large cardinal axioms. The Journal of Symbolic Logic, 79(4):1092–1119, 2014.arxiv.org/abs/1303.0550
  3. [3][BV15] Will Boney and Sebastien Vasey. Categoricity and infinitary logics. https://arxiv.org/abs/1508.03316v2, 2015. Preprint, revised 16 October 2015, 9 pp.
  4. [4][BV17] Will Boney and Sebastien Vasey. A survey on tame abstract elementary classes. In José Iovino, editor, Beyond First Order Model Theory, pages 353–427. CRC Press, 2017. Preprint: https://arxiv.org/abs/1512.00060v4.
  5. [5][EM56] Andrzej Ehrenfeucht and Andrzej Mostowski. Models of axiomatic theories admitting automorphisms. Fundamenta Mathematicae, 43:50–68, 1956.
  6. [6][ER56] Paul Erdős and Richard Rado. A partition calculus in set theory. Bulletin of the American Mathematical Society, 62(5):427–489, 1956.
  7. [7][Esp22] Christian Espíndola. A proof of Shelah’s eventual categoricity conjecture and an extension to accessible categories with directed colimits. https://arxiv.org/abs/1906.09169v7, 2022. Preprint, version 7, 13 April 2022; first posted 21 June 2019.
  8. [8][Esp23] Christian Espíndola. A complete classification of categoricity spectra of accessible categories with directed colimits. https://arxiv.org/abs/2301.13167v1, 2023. Preprint, version 1, 30 January 2023.
  9. [9][Fod56] G. Fodor. Eine Bemerkung zur Theorie der regressiven Funktionen. Acta Scientiarum Mathematicarum (Szeged), 17:139–142, 1956.
  10. [10][GV06] Rami Grossberg and Monica VanDieren. Categoricity from one successor cardinal in tame abstract elementary classes. Journal of Mathematical Logic, 6(2):181–201, 2006.
  11. [11][MS90] Michael Makkai and Saharon Shelah. Categoricity of theories in L_{κ,ω}, with κ a compact cardinal. Annals of Pure and Applied Logic, 47(1):41–97, 1990.DOI
  12. [12]Michael Morley. Categoricity in power. Transactions of the American Mathematical Society, 114(2):514–538, 1965.DOI
  13. [13]OpenAI. A CH obstruction to a prescribed categoricity threshold. OpenAI Math Release preprint OAI:A-CH-Obstruction-to-a-Prescribed-Categoricity-Threshold-September-24-2026, 2026.
  14. [14]Saharon Shelah. Classification theory for nonelementary classes. I. the number of uncountable models of ψ ∈ Lω1,ω. Part B. Israel Journal of Mathematics, 46(4):241–273, 1983.
  15. [15]Saharon Shelah. Classification Theory for Abstract Elementary Classes, volume 18 of Studies in Logic (London). College Publications, London, 2009.
  16. [16]Saharon Shelah and Sebastien Vasey. Categoricity and multidimensional diagrams. Journal of the European Mathematical Society, 26(7):2301–2372, 2024.
  17. [17]Sebastien Vasey. Shelah’s eventual categoricity conjecture in universal classes: Part I. Annals of Pure and Applied Logic, 168(9):1609–1642, 2017.
  18. [18]Sebastien Vasey. Shelah’s eventual categoricity conjecture in universal classes: Part II. Selecta Mathematica. New Series, 23(2):1469–1506, 2017.
  19. [19]Sebastien Vasey. Shelah’s eventual categoricity conjecture in tame abstract elementary classes with primes. Mathematical Logic Quarterly, 64(1–2):25–36, 2018.DOI
  20. [20]Sebastien Vasey. The categoricity spectrum of large abstract elementary classes. Selecta Mathematica. New Series, 25(5), 2019. Article 65, 51 pp.arxiv.org/abs/1805.04068

Paper details

vlnc:W_6nnajzvr
Version
v1 · latest
Published
License
LicenseRef-OpenAI-public
Usage

views · 44

downloads · 3

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

unreleased internal OpenAI model

View statement
Looking for related papers…
Contents