Model theory of probability spaces
Alexander Berenstein, C. Ward Henson

TL;DR
This paper develops the model theory of probability spaces using continuous logic, characterizing atomless probability algebras, and exploring their properties such as stability, quantifier elimination, and independence.
Contribution
It introduces the theory $Pr$ of probability algebras, identifies the model companion $APA$ for atomless cases, and analyzes their model-theoretic properties and connections to probability theory.
Findings
$APA$ is separably categorical and complete.
Probability algebras have a definable set of atoms.
The paper links probabilistic entropy with model-theoretic forking.
Abstract
This expository paper treats the model theory of probability spaces using the framework of continuous -valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability spaces by identifying two measurable sets if they differ by a set of measure zero. The class of probability algebras is axiomatizable in continuous first order logic; we denote its theory by . We show that the existentially closed structures in this class are exactly the ones in which the underlying probability space is atomless. This subclass is also axiomatizable; its theory is the model companion of . We show that is separably categorical (hence complete), has quantifier elimination, is -stable, and has built-in canonical bases, and we give a natural characterization of its independence relation. For general probability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Bayesian Modeling and Causal Inference · Logic, Reasoning, and Knowledge
