Characterizing alephepsilon-saturated models of superstable ndop theories by Linfty, alephepsilon-theory
Saharon Shelah
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.
Create a lesson
Related papers
The Logic of Emergence
David H. Wolpert, David C. Krakauer
The group of strong automorphisms of the differential field of transseries
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
Escaping and generics over ideals
Laurent Bienvenu, Noam Greenberg, Ludovic Patey et al.
Definably isometric cuboids over Hensel minimal fields
Marcelo Fortmann
A weak λ-set that is not a λ-set under p = c
Alexander V. Osipov, Anton E. Lipin
The Cone Fixing the Reals of $HODM2n(x)
Farmer Schlutzenberg, Connor Watson