English
Related papers

Related papers: When an Equivalence Relation with All Borel Classe…

200 papers

If $\rho$ is a binary relation on a set $X$, the structure ${\mathbb X}=\langle X,\rho\rangle$ is connected iff the minimal equivalence relation containing $\rho$ is the full relation on $X$. We show that, for a set $I$ the following…

Logic · Mathematics 2022-08-02 Miloš S. Kurilić

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

Logic · Mathematics 2022-01-28 Gabriel Goldberg

Suppose that $X$ is a Polish space, $E$ is a countable Borel equivalence relation on $X$, and $\mu$ is an $E$-invariant Borel probability measure on $X$. We consider the circumstances under which for every countable non-abelian free group…

Logic · Mathematics 2020-02-25 Clinton T. Conley , Benjamin D. Miller

We show that for a $\sigma $-ideal $\ci$ with a Borel base of subsets of an uncountable Polish space, if $\ca$ is (in several senses) a "regular" family of subsets from $\ci $ then there is a subfamily of $\ca$ whose union is completely…

Logic · Mathematics 2023-01-25 Robert Ralowski , Szymon Zeberski

We clarify the relationship between the linear commutator and the ordinary commutator by showing that in any variety satisfying a nontrivial idempotent Mal'cev condition the linear commutator is definable in terms of the centralizer…

Rings and Algebras · Mathematics 2008-02-03 Keith A. Kearnes , Ågnes Szendrei

We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2^{|A|} = 2^{|B|}. This implies in particular that B has 2^{|B|} subalgebras. We also discuss…

Logic · Mathematics 2009-09-25 James Cummings , Saharon Shelah

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

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

Logic · Mathematics 2020-07-21 Andrew D. Brooke-Taylor , Filippo Calderoni , Sheila K. Miller

A subset $X$ of a Polish group $G$ is \emph{Haar null} if there exists a Borel probability measure $\mu$ and a Borel set $B$ containing $X$ such that $\mu(gBh)=0$ for every $g,h \in G$. A set $X$ is \emph{Haar meager} if there exists a…

Logic · Mathematics 2020-12-15 Márton Elekes , Márk Poór

Given a complete, cocomplete category $\mathcal C$, we investigate the problem of describing those small categories $I$ such that the diagonal functor $\Delta:\mathcal C\to {\rm Functors}(I,\mathcal C)$ is a Frobenius functor. This…

Category Theory · Mathematics 2009-06-04 Alexandru Chirvasitu

J. Zapletal asked if all the forcing notions considered in his monograph are homogeneous. Specifically, he asked if the forcing consisting of Borel sets of $\sigma$-finite 2-dimensional Hausdorff measure in $\mathbb{R}^3$ (ordered under…

Logic · Mathematics 2018-09-07 Márton Elekes , Juris Steprāns

We characterise all linear maps $\mathcal{A}\colon\mathbb{R}^{n\times n}\to\mathbb{R}^{n\times n}$ such that, for $1\leq p<n$, \begin{align*} \|P\|_{L^{p^{*}}(\mathbb{R}^{n})}\leq…

Analysis of PDEs · Mathematics 2023-06-30 Franz Gmeineder , Peter Lewintan , Patrizio Neff

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

Logic · Mathematics 2021-07-01 Sakaé Fuchino , Hiroshi Sakai

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…

Logic · Mathematics 2016-07-20 Andrew S. Marks

Whenever x is a tame cardinal invariant and ZFC+large cardinals proves that x=aleph one implies WCG then ZFC+large cardinals proves that x=aleph one implies b=aleph one, and b=aleph one implies WCG. Here WCG is a certain prediction…

Logic · Mathematics 2007-05-23 Jindrich Zapletal

When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…

Rings and Algebras · Mathematics 2018-05-14 Alexey Gordienko , Ofir Schnabel

We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that irr(B_0 times B_1)= max(irr(B_0),irr(B_1)). We prove…

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

We prove that, for $1 \le p<q<\infty$, the partially ordered set $P(\omega)/{\rm Fin}$ can be embedded into Borel equivalence relations between $\mathbb{R}^\omega/\ell_p$ and $\mathbb{R}^\omega/\ell_q$. Since there is an antichain of size…

Logic · Mathematics 2013-10-21 Zhi Yin

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

We define a generic Vop\v{e}nka cardinal to be an inaccessible cardinal $\kappa$ such that for every first-order language $\mathcal{L}$ of cardinality less than $\kappa$ and every set $\mathscr{B}$ of $\mathcal{L}$-structures, if…

Logic · Mathematics 2019-08-13 Trevor M. Wilson