Approximate isomorphism of randomization pairs

DOI10.5802/CML.85MaRDI QIDQ6390548arXivFDO

Authors James N. Hanson, Tomás Ibarlucía

Publication date 8 February 2022

Published in arXiv

Full work available at URL https://doi.org/10.5802/CML.85

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Classification theory, stability, and related concepts in model theory (03C45) Continuous model theory, model theory of metric structures (03C66) Groups as automorphisms of other structures (22F50)

arXiv classification

math.LO

Abstract: We study approximate $alep{h}_0$-categoricity of theories of beautiful pairs of randomizations, in the sense of continuous logic. This leads us to disprove a conjecture of Ben Yaacov, Berenstein and Henson, by exhibiting $alep{h}_0$-categorical, $alep{h}_0$-stable metric theories $Q$ for which the corresponding theory $Q_P$ of beautiful pairs is not approximately $alep{h}_0$-categorical, i.e., has separable models that are not isomorphic even up to small perturbations of the smaller model of the pair. The theory $Q$ of randomized infinite vector spaces over a finite field is such an example. On the positive side, we show that the theory of beautiful pairs of randomized infinite sets is approximately $alep{h}_0$-categorical. We also prove that a related stronger property, which holds in that case, is stable under various natural constructions, and formulate our guesswork for the general case.

This page was built for publication: Approximate isomorphism of randomization pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6390548)