English
Related papers

Related papers: Forcing constructions and countable Borel equivale…

200 papers

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

Logic · Mathematics 2014-12-31 John D. Clemens , Dominique Lecomte , Benjamin D. Miller

In this paper, we show that there is a one-to-one correspondence between operator monotone functions on the nonnegative reals and finite Borel measures on the unit interval. This correspondence appears as an integral representation of…

Functional Analysis · Mathematics 2013-05-01 Pattrawut Chansangiam

A long-standing conjecture of Sacks states that it is provable in ZFC that every locally countable partial order of size continuum embeds into the Turing degrees. We show that this holds for partial orders of height two, but provide…

Logic · Mathematics 2023-09-18 Kojiro Higuchi , Patrick Lutz

I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…

Logic · Mathematics 2020-02-25 Uri Andrews , Noah Schweber , Andrea Sorbi

We study topological groups that can be defined as Polish, pro-countable abelian groups, as non-archimedean abelian groups or as quasi-countable abelian groups, i.e., Polish subdirect products of countable, discrete groups, endowed with the…

Logic · Mathematics 2016-04-26 Maciej Malicki

We present a general method of constructing an uncountable family of regular Borel measures on certain path spaces of Lipschitz functions having fixed Lipschitz constants. We use this method to give a definition of Lebesgue measure and…

Functional Analysis · Mathematics 2007-05-23 Richard L. Baker

We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.

Geometric Topology · Mathematics 2010-03-26 Arthur Bartels , Wolfgang Lueck

Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…

Logic · Mathematics 2022-06-30 Aristotelis Panagiotopoulos , Allison Wang

For a countable ordinal epsilon we construct a Sigma^0_2 subset of the Cantor space for which one may force aleph_epsilon translations with intersections of size 2i, but such that it has no perfect set of such translations in any ccc…

Logic · Mathematics 2022-04-21 Andrzej Roslanowski , Saharon Shelah

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.

Rings and Algebras · Mathematics 2007-05-23 J. Gomez-Torrecillas , A. Louly

This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…

Logic · Mathematics 2020-06-11 Tommaso Flaminio , Lluis Godo , Hykel Hosni

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

Dynamical Systems · Mathematics 2020-01-15 Ariel Rapaport

We prove that any divisible dynamical simplex is the set of invariant measures of some Toeplitz subshift. We apply our construction to prove that orbit equivalence of Toeplitz subshifts is Borel bireducible to the universal equivalence…

Logic · Mathematics 2018-10-22 Julien Melleray

In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…

Number Theory · Mathematics 2024-02-28 Sabi Biswas , Nipen Saikia

We establish Borel equivariant analogues of several classical theorems from complex analysis and PDE. The starting point is an equivariant Weierstrass theorem for entire functions: there exists a Borel mapping which assigns to each…

Dynamical Systems · Mathematics 2025-12-19 Konstantin Slutsky , Mikhail Sodin , Aron Wennman

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…

Logic · Mathematics 2014-01-14 C. Laflamme , L. Nguyen Van The , M. Pouzet , N. Sauer