Twins: non-isomorphic models forced to be isomorphic. Part I
Saharon Shelah

TL;DR
This paper investigates conditions under which non-isomorphic models of a first-order complete theory become isomorphic after forcing extensions, exploring the interplay between model theory and set-theoretic forcing.
Contribution
It provides sufficient conditions for models to become isomorphic after forcing, especially for theories with the independence property, advancing the understanding of model isomorphism in forcing extensions.
Findings
Models far from isomorphic can become isomorphic after forcing.
For theories with the independence property, forcing with no new ω-sequences suffices.
Specific forcing notions like adding branches to trees can induce isomorphisms.
Abstract
For which (first-order complete, usually countable) do there exist non-isomorphic models of 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 \emph{far} from each other (in a suitable sense), but on the other hand, -equivalent in some suitable logic . 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 for which we have such models. The results say (e.g.) that there are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
