Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0901.1583

Randomizations of models as metric structures

Itaï Ben Yaacov·H. Jerome Keisler
View original source ↗Read source document ↗Export metadata ↓

Abstract

The notion of a randomization of a first order structure was introduced by Keisler in the paper Randomizing a Model, Advances in Math. 1999. The idea was to form a new structure whose elements are random elements of the original first order structure. In this paper we treat randomizations as continuous structures in the sense of Ben Yaacov and Usvyatsov. In this setting, the earlier results show that the randomization of a complete first order theory is a complete theory in continuous logic that admits elimination of quantifiers and has a natural set of axioms. We show that the randomization operation preserves the properties of being omega-categorical, omega-stable, and stable.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Itaï Ben Yaacov, H. Jerome Keisler. 2009-09-23. Randomizations of models as metric structures. https://doi.org/10.1142/s1793744209000080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Newelski's Conjecture for $o$-Minimal and $p$-Adic Groups

Let $M_0$ denote either the field of $p$-adic numbers $\mathbb{Q}_p$ or an $o$-minimal expansion of the real field $\mathbb{R}$. We study the minimal flows and Ellis groups of groups definable over $M_0$ from the viewpoint of definable topological dynamics. The computation of Ellis groups, together with the closely related Newelski conjecture, has so far been available only under restrictive hypotheses: in the $p$-adic setting, the results of \cite{BY-APAL} apply to reductive algebraic groups, while in the $o$-minimal setting the known computations rely on a compact-torsion-free (Iwasawa) decomposition. In this paper we remove both restrictions. We show that every definable group $G$ has a definably amenable radical $D$, with quotient map $π:G\to A$ onto a centreless semisimple group $A$. In $A$, a definably amenable component $V$ is selected: a maximal definably amenable subgroup containing a maximal definably solvable subgroup. Its preimage $B=π^{-1}(V)$ is a definably amenable component of $G$, contains $D$, and is the carrier for the computation of the Ellis group. Our main result is that, for every $M\succ M_0$, the Ellis group of the universal definable flow of $G$ over $M$ is isomorphic to that of $B$ over $M$, and hence to $B/B^{00}$. In particular, the Ellis groups of $G$ are model-independent. As a consequence, when $G$ is definable over a $p$-adically closed field, Newelski's conjecture holds for $G$ if and only if $G$ is definably amenable. The amenable direction is the known result of \cite{CS-Definably-Amenable-NIP-Groups}, while the converse is new.

math.LO↗
arXiv2026

Short Axiomatization of Stratified Comprehension

Several finite axiomatizations of stratified comprehension are known. This paper gives five set existence principles which, in the presence of Extensionality, yield the fourteen set-construction principles used in the finite basis recorded by Holmes. In addition, a direct unordered proof is given showing that the same five principles, together with extensionality only for nonempty sets, already imply every stratified comprehension instance, without passing through the Holmes ordered-pair machinery. The displayed reductions for unordered products, Cartesian products, and ordered relative products have been corrected. The original Holmes-basis reduction and the new direct weak-extensionality development have been checked by the Lean 4 kernel; the complete Lean source is supplied with this version.

math.LO↗
arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗