Definable closure in randomizations

DOI10.1016/J.APAL.2014.11.005MaRDI QIDQ487692zbMATH OpenOpenAlexFDO

Authors Uri Andrews, Isaac Goldbring, H. Jerome Keisler

Publication date 23 January 2015

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

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

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)

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.

Recommendations

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

Cites work

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

Cited in

(4)

• Definable connectedness of randomizations of groups
• Separable models of randomizations
• Independence in randomizations
• Automorphism groups of randomized structures

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)