English
Related papers

Related papers: Forcing constructions and countable Borel equivale…

200 papers

We consider countable Borel equivalence relations on quotient Borel spaces. We prove a generalization of the Feldman-Moore representation theorem, but provide some examples showing that other very simple properties of countable equivalence…

Logic · Mathematics 2007-05-23 Roberto Pinciroli

We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We…

Logic · Mathematics 2025-03-28 Su Gao , Ming Xiao

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

Logic · Mathematics 2024-07-22 Iian B. Smythe

The following will be shown: Let $I$ be a $\sigma$-ideal on a Polish space $X$ with the property that the associated forcing of $I^+$ Borel subsets ordered by $\subseteq$ is a proper forcing. Let E be an analytic or coanalytic equivalence…

Logic · Mathematics 2015-12-09 William Chan

We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…

Logic · Mathematics 2017-09-22 Ruiyuan Chen

Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we…

Logic · Mathematics 2019-08-16 Samuel Coskey , Scott Schneider

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Logic · Mathematics 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…

Logic · Mathematics 2025-12-30 Tyler Arant , Alexander S. Kechris , Patrick Lutz

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

Logic · Mathematics 2018-10-03 Ruiyuan Chen , Alexander S. Kechris

We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…

Logic · Mathematics 2019-08-16 Samuel Coskey , Joel David Hamkins

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

Logic · Mathematics 2007-05-23 Randall Dougherty , Alexander S. Kechris

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

Logic · Mathematics 2024-09-26 Joshua Frisch , Forte Shinko , Zoltan Vidnyanszky

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

General Topology · Mathematics 2013-10-22 Marion Scheepers

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

We address some fundamental problems concerning the structure of idealistic equivalence relations. In particular, we show that, under analytic determinacy, there are continuum many idealistic analytic equivalence relations that are not…

Logic · Mathematics 2025-06-11 Filippo Calderoni , Luca Motto Ros

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

Commutative Algebra · Mathematics 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

Probability · Mathematics 2013-12-31 Peter Orbanz , Balazs Szegedy

In this paper we study the Borel structure of the space of left-orderings $\mathrm{LO}(G)$ of a group $G$ modulo the natural conjugacy action, and by using tools from descriptive set theory we find many examples of countable left-orderable…

Group Theory · Mathematics 2022-10-04 Filippo Calderoni , Adam Clay

We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a sigma-ideal, and factor forcings of subsets of countable sets modulo an ideal.

Logic · Mathematics 2007-05-23 Michael Hrusak , Jindrich Zapletal
‹ Prev 1 2 3 10 Next ›