Definable closure in randomizations

DOI10.1016/J.APAL.2014.11.005zbMATH Open1372.03061arXiv1304.7797OpenAlexW2032269027MaRDI QIDQ487692FDOQ487692

Uri Andrews, H. Jerome Keisler, Isaac Goldbring

Publication date: 23 January 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Abstract: The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient conditions for an element to be definable over a set of parameters in a model of T^R.

Full work available at URL: https://arxiv.org/abs/1304.7797

Recommendations

• Independence in randomizations
• Randomizing a model
• Random variables and integral logic
• Randomizations of models as metric structures
• Separable models of randomizations

zbMATH Keywords

definable closurerandomizations

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Many-valued logic (03B50) Categoricity and completeness of theories (03C35) Interpolation, preservation, definability (03C40)

Cites Work

• Model theory for metric structures
• On theories of random variables
• Continuous first order logic and local stability
• Thorn-forking in continuous logic
• Definable functions in Urysohn's metric space
• An approximate Herbrand's theorem and definable functions in metric structures
• Definable operators on Hilbert spaces
• Randomizations of models as metric structures
• Randomizing a model
• Separable models of randomizations
• Pseudofinite and pseudocompact metric structures

Cited In (3)

• Definable connectedness of randomizations of groups
• AUTOMORPHISM GROUPS OF RANDOMIZED STRUCTURES
• Independence in randomizations

This page was built for publication: Definable closure in randomizations

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