Characterizing alephepsilon-saturated models of superstable ndop theories by Linfty, alephepsilon-theory

Abstract

After the main gap theorem was proved (see [Sh:c]), in discussion, Harrington expressed a desire for a finer structure - of finitary character (when we have a structure theorem at all). I point out that the logic Linfty,aleph0(d.q.) (d.q. stands for dimension quantifier) does not suffice: e.g., for T=Th(lambda x 2ω,En)n<omega where (alpha,eta)En(beta,nu) =: eta|n=nu|n and for a subset S of 2omega we define MS = M | (alpha,eta): [eta in S -> alpha<omega1] and [eta in 2ω backslash S -> alpha<omega]. Hence, it seems to me we should try Linfty,alephepsilon(d.q.) (essentially, in C we can quantify over sets which are included in the algebraic closure of finite sets), and Harrington accepts this interpretation. Here the conjecture is proved for alephepsilon-saturated models. I.e., the main theorem is M equivLinfty,alephepsilon(d.q.) N iff M cong N for alephepsilon--saturated models of a superstable countable (first order) theory T without dop.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…