Abstract
The results herein form part of a larger project to characterize the classification properties of the class of submodels of a homogeneous stable diagram in terms of the solvability (in the sense of [1]) of the potential isomorphism problem for this class of submodels.
We restrict ourselves to locally saturated submodels of the monster model
We show that the collection of pairs of submodels in 𝕃 as above which are potentially isomorphic with respect to certain cardinal-preserving extensions of 𝕃 is equiconstructible with 0#. As 0# is highly “transcendental” over 𝕃, this provides a very strong statement to the effect that potential isomorphism for this class of models not only fails to be set-theoretically absolute, but is of high (indeed of the highest possible) complexity.
The proof uses a novel method that does away with the need for a linear order on the skeleton.
Citation
Sy-David Friedman. Tapani Hyttinen. Agatha Walczak-Typke. "Potential isomorphism of elementary substructures of a strictly stable homogeneous model." J. Symbolic Logic 76 (3) 987 - 1004, September 2011. https://doi.org/10.2178/jsl/1309952530
Information