2025/05/04 by Saharon Shelah, Shelah, Saharon
Computer Science · Mathematics · #03C45 #03E45 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.2505.02088
openalex publication_date 2025/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For which (first-order complete, usually countable) T do there exist non-isomorphic models of T which become isomorphic after forcing with a forcing notion ℙ? Necessarily, ℙ is non-trivial; i.e.~it adds some new set of ordinals. It is best if we also demand that it collapses no cardinal. It is better to demand on the one hand that the models are non-isomorphic, and even far from each other (in a suitable sense), but on the other hand, L-equivalent in some suitable logic L. We give sufficient conditions: for theories with the independence property, we proved this when ℙ adds no new ω-sequence. We may prove it ``for some ℙ," but better would be for some specific forcing notions. Best would be to characterize the pairs (T,ℙ) for which we have such models. The results say (e.g.) that there are models M1,M2 which are not isomorphic (and even far from being isomorphic, in a rigorous sense) which become isomorphic when we extend the universe by adding a new branch to the tree (θ>2,\lhd). We shall mention some specific choices of ℙ: mainly (θ>2,\lhd) with θ= θ<θ. That is, the reader just has to agree that starting with a universe V of set theory (i.e.~a model of ZFC) and a quasiorder ℙ, there are new directed G ⊆ ℙ meeting every dense subset of D of ℙ, a universe V[G] (so it satisfies ZFC) of which the original V is a transitive subclass. We may say that V[G] (also denoted V^ℙ) is the universe obtained by forcing with ℙ. This work does not require any serious knowledge of forcings, nor of stability theory. This is part of the classification and Main Gap program.