Categoricity and solvability of A.E.C., quite highly

Abstract

We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in Klambda. Moreover, our main result is that we can find a good lambda-frame s categorical in lambda such that Ks subseteq Klambda. We then show how to use [Sh:705] to get categoricity in every large enough cardinality if K has cases of mu-amalgamation for enough mu and 2mu<2mu+1 <... < 2mu+n... for enough mu.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…