Uniqueness of constructible models in continuous logic
James E. Hanson
TL;DR
The paper addresses the uniqueness of constructible models in complete continuous first-order theories, extending Ressayre-style results to the continuous setting. It introduces augmented construction sequences to track distance predicates and definability, and develops self-sufficiency and a dense back-and-forth framework to glue finite segments into a global isomorphism. The main result proves that any two constructible models of the same complete theory are isomorphic (over a base parameter set, if specified). This generalizes classical model-theoretic uniqueness to continuous logic and provides a robust method for stability-theoretic analysis in this context.
Abstract
We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.
