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 universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf