Countable infinitary theories admitting an invariant measure
Nathanael Ackerman, Cameron Freer, Rehana Patel

TL;DR
This paper characterizes countable theories in infinitary logic that admit an invariant probability measure, answering a longstanding open question and extending previous results through new measure construction techniques.
Contribution
It provides a definable closure-based characterization of theories with invariant measures and introduces a method for constructing such measures from directed systems.
Findings
Characterization of theories with invariant measures using definable closure
Resolution of Gaifman's open question from 1964
Development of a machinery for building invariant measures from directed systems
Abstract
Let be a countable language. We characterize, in terms of definable closure, those countable theories of for which there exists an -invariant probability measure on the collection of models of with underlying set . Restricting to , this answers an open question of Gaifman from 1964, via a translation between -invariant measures and Gaifman's symmetric measure-models with strict equality. It also extends the known characterization in the case where implies a Scott sentence. To establish our result, we introduce machinery for building invariant measures from a directed system of countable structures with measures.
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
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Computability, Logic, AI Algorithms
