We prove several results showing that every locally finite Borel graph whose large-scale geometry is ‘tree-like’ induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs (i.e., CAT(0) cube complexes). Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty–Jackson–Kechris.

In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group G that moreover admits an integer n satisfying that for every uncountable $X\subseteq G$, every element of G may be written as a group word of length n in the elements of X. The former is called a Jónsson group, and the latter is called a Shelah group.

In this paper, we construct a Shelah group on the grounds of $\textsf {{ZFC}}$ alone – that is, without assuming the continuum hypothesis. More generally, we identify a combinatorial condition (coming from the theories of negative square-bracket partition relations and strongly unbounded subadditive maps) sufficient for the construction of a Shelah group of size $\kappa $, and we prove that the condition holds true for all successors of regular cardinals (such as $\kappa =\aleph _1,\aleph _2,\aleph _3,\ldots $). This also yields the first consistent example of a Shelah group of size a limit cardinal.

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb {Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a pair of Borel $\mathbb {Z}$-orderings are compatible with each other. We show that, if a pair of Borel $\mathbb {Z}$-orderings are incompatible, then a canonical incompatible pair of Borel $\mathbb {Z}$-orderings of $E_0$ can be Borel embedded into the given pair. We then consider hyperfinite-over-finite equivalence relations, which are countable Borel equivalence relations admitting Borel $\mathbb {Z}^2$-orderings. We show that if a hyperfinite-over-hyperfinite equivalence relation E admits a Borel $\mathbb {Z}^2$-ordering which is self-compatible, then E is hyperfinite.

In this paper, we show that $\mathsf {ZFC}+\mathsf {WA}_{n+1}$ implies the consistency of $\mathsf {ZFC}+\mathsf {WA}_n$ for $n\ge 0$. We also prove that $\mathsf {ZFC}+\mathsf {WA}_n$ is finitely axiomatizable, and $\mathsf {ZFC}+\mathsf {WA}$ is not finitely axiomatizable unless it is inconsistent.

Using iterated Sacks forcing and topological games, we prove that the existence of a totally imperfect Menger set in the Cantor cube with cardinality continuum is independent from ZFC. We also analyze the structure of Hurewicz and consonant subsets of the Cantor cube in the Sacks model.

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories can be embedded into a model constructed by forcing. Our results rely on the model-theoretic properties of good ultrafilters, for which we provide a new existence proof on non-necessarily complete Boolean algebras.

We investigate Steel’s conjecture in ‘The Core Model IterabilityProblem’ [10], that if $\mathcal {W}$ and $\mathcal {R}$ are $\Omega +1$-iterable, $1$-small weasels, then $\mathcal {W}\leq ^{*}\mathcal {R}$ iff there is a club $C\subset \Omega $ such that for all $\alpha \in C$, if $\alpha $ is regular, then $\alpha ^{+\mathcal {W}}\leq \alpha ^{+\mathcal {R}}$. We will show that the conjecture fails, assuming that thereis an iterable premouse M which models KP and which has a-Woodin cardinal. On the other hand, we show thatassuming there is no transitive model of KP with a Woodin cardinal theconjecture holds. In the course of this we will also show that ifM is a premouse which models KP with a largest, regular,uncountable cardinal $\delta $, and $\mathbb {P} \in M$ is a forcing poset such that $M\models "\mathbb {P}\text { has the }\delta \text {-c.c.}"$, and $g\subset \mathbb {P}$ is M-generic, then $M[g]\models \text {KP}$. Additionally, we study the preservation of admissibilityunder iteration maps. At last, we will prove a fact about the closure of the setof ordinals at which a weasel has the S-hull property. Thisanswers another question implicit in remarks in [10].

We argue that some of Brouwer’s assumptions, rejected by Bishop, should be considered and studied as possible axioms. We show that Brouwer’s Continuity Principle enables one to prove an intuitionistic Borel Hierarchy Theorem. We also explain that Brouwer’s Fan Theorem is useful for a development of the theory of measure and integral different from the one worked out by Bishop. We show that Brouwer’s bar theorem not only proves the Fan Theorem but also a stronger statement that we call the Almost-fan Theorem. The Almost-fan Theorem implies intuitionistic versions of Ramsey’s Theorem and the Bolzano-Weierstrass Theorem.

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper, ${}^\omega \omega $-bounding forcing notions, 2) the class of subproper, T-preserving forcing notions (where T is a fixed Souslin tree) and 3) the class of subproper, $[T]$-preserving forcing notions (where T is an $\omega _1$-tree) are iterable with revised countable support. In the second part, we adopt Miyamoto’s theory of nice iterations, rather than revised countable support. We show that this approach allows us to drop a technical condition in the definitions of subcompleteness and subproperness, still resulting in forcing classes that are iterable in this way, preserve $\omega _1$, and, in the case of subcompleteness, don’t add reals. Further, we show that the analogs of the iteration theorems proved in the first part for RCS iterations hold for nice iterations as well.

In this work, we investigate various combinatorial properties of Borel ideals on countable sets. We extend a theorem presented in [13] and identify an $F_\sigma $ tall ideal in which player II has a winning strategy in the Cut and Choose Game, thereby addressing a question posed by J. Zapletal. Additionally, we explore the Ramsey properties of ideals, demonstrating that the random graph ideal is critical for the Ramsey property when considering more than two colors. The previously known result for two colors is extended to any finite number of colors. Furthermore, we comment on the Solecki ideal and identify an $F_\sigma $ tall K-uniform ideal that is not equivalent to $\mathcal {ED}_{\text {fin}}$, thereby addressing a question from M. Hrušák’s work [10].

In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$ if and only if every regular first-countable space of weight $< \mathfrak c$ can be densely embedded into a regular first-countable countably compact space.

We prove a full measurable version of Vizing’s theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal {G}$ of degree uniformly bounded by $\Delta \in \mathbb {N}$ defined on a standard probability space $(X,\mu )$ admits a $\mu $-measurable proper edge coloring with $(\Delta +1)$-many colors. This answers a question of Marks [Question 4.9, J. Amer. Math. Soc. 29 (2016)] also stated in Kechris and Marks as a part of [Problem 6.13, survey (2020)], and extends the result of the author and Pikhurko [Adv. Math. 374, (2020)], who derived the same conclusion under the additional assumption that the measure $\mu $ is $\mathcal {G}$-invariant.

We investigate natural variations of behaviourally correct learning and explanatory learning—two learning paradigms studied in algorithmic learning theory—that allow us to “learn” equivalence relations on Polish spaces. We give a characterization of the learnable equivalence relations in terms of their Borel complexity and show that the behaviourally correct and explanatory learnable equivalence relations coincide both in uniform and non-uniform versions of learnability and provide a characterization of the learnable equivalence relations in terms of their Borel complexity. We also show that the set of uniformly learnable equivalence relations is $\boldsymbol {\Pi }^1_1$-complete in the codes and study the learnability of several equivalence relations arising naturally in logic as a case study.

Given a Polish group G, let $E(G)$ be the right coset equivalence relation $G^\omega /c(G)$, where $c(G)$ is the group of all convergent sequences in G. We first established two results:

1. (1) Let $G,H$ be two Polish groups. If H is TSI but G is not, then $E(G)\not \le _BE(H)$.

2. (2) Let G be a Polish group. Then the following are equivalent: (a) G is TSI non-archimedean; (b)$E(G)\leq _B E_0^\omega $; and (c) $E(G)\leq _B {\mathbb {R}}^\omega /c_0$. In particular, $E(G)\sim _B E_0^\omega $ iff G is TSI uncountable non-archimedean.

A critical theorem presented in this article is as follows: Let G be a TSI Polish group, and let H be a closed subgroup of the product of a sequence of TSI strongly NSS Polish groups. If $E(G)\le _BE(H)$, then there exists a continuous homomorphism $S:G_0\rightarrow H$ such that $\ker (S)$ is non-archimedean, where $G_0$ is the connected component of the identity of G. The converse holds if G is connected, $S(G)$ is closed in H, and the interval $[0,1]$ can be embedded into H.

As its applications, we prove several Rigid theorems for TSI Lie groups, locally compact Polish groups, separable Banach spaces, and separable Fréchet spaces, respectively.

We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any non-trivial strictly increasing function from a section of the tree into itself maps into a cofinal branch.

We show that in the Silver model the inequality $\mathrm {cov}(\mathfrak {C} _2) < \mathrm {cov}(\mathfrak {P}_2)$ holds true, where $\mathfrak {C}_2$ and $\mathfrak {P}_2$ are the two-dimensional Mycielski ideals.

This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065–1092]. For an ideal $\mathcal {I}$ on $\omega $ we denote $\mathcal {D}_{\mathcal {I}}=\{f\in \omega ^{\omega }: f^{-1}[\{n\}]\in \mathcal {I} \text { for every } n\in \omega \}$ and write $f\leq _{\mathcal {I}} g$ if $\{n\in \omega :f(n)>g(n)\}\in \mathcal {I}$, where $f,g\in \omega ^{\omega }$.

We study the cardinal numbers $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))$ describing the smallest sizes of subsets of $\mathcal {D}_{\mathcal {I}}$ that are unbounded from below with respect to $\leq _{\mathcal {I}}$.

In particular, we examine the relationships of $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))$ with the dominating number $\mathfrak {d}$. We show that, consistently, $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))>\mathfrak {d}$ for some ideal $\mathcal {I}$, however $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))\leq \mathfrak {d}$ for all analytic ideals $\mathcal {I}$. Moreover, we give example of a Borel ideal with $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal {I}}))=\operatorname {\mathrm {add}}(\mathcal {M})$.

In $\mathsf {ZF}$ (i.e., Zermelo–Fraenkel set theory minus the axiom of choice ($\mathsf {AC}$)), we investigate the open problem of the deductive strength of the principle

which was introduced by Herzberg, Kanovei, Katz, and Lyubetsky [(2018), Journal of Symbolic Logic, 83(1), 385–391]. Typical results are:

1. (1) “$\aleph _{1}\leq 2^{\aleph _{0}}$” is strictly weaker than $\mathsf {UF_{wob}}(\omega )$ in $\mathsf {ZF}$.

2. (2) “There exists a free ultrafilter on $\omega $” does not imply “$\aleph _{1}\leq 2^{\aleph _{0}}$” in $\mathsf {ZF}$, and thus (by (1)) neither does it imply $\mathsf {UF_{wob}}(\omega )$ in $\mathsf {ZF}$. This fills the gap in information in Howard and Rubin [Mathematical Surveys and Monographs, American Mathematical Society, 1998], as well as in Herzberg et al. (2018).

3. (3) Martin’s Axiom ($\mathsf {MA}$) implies “no free ultrafilter on $\omega $ has a well-orderable base of cardinality $<2^{\aleph _{0}}$”, and the latter principle is not implied by $\aleph _{0}$-Martin’s Axiom ($\mathsf {MA}(\aleph _{0})$) in $\mathsf {ZF}$.

4. (4) $\mathsf {MA} + \mathsf {UF_{wob}}(\omega )$ implies $\mathsf {AC}(\mathbb {R})$ (the axiom of choice for non-empty sets of reals), which in turn implies $\mathsf {UF_{wob}}(\omega )$. Furthermore, $\mathsf {MA}$ and $\mathsf {UF_{wob}}(\omega )$ are mutually independent in $\mathsf {ZF}$.

5. (5) For any infinite linearly orderable set X, each of “every filter base on X can be well ordered” and “every filter on X has a well-orderable base” is equivalent to “$\wp (X)$ can be well ordered”. This yields novel characterizations of the principle “every linearly ordered set can be well ordered” in $\mathsf {ZFA}$ (i.e., Zermelo–Fraenkel set theory with atoms), and of $\mathsf {AC}$ in $\mathsf {ZF}$.

6. (6) “Every filter on $\mathbb {R}$ has a well-orderable base” implies “every filter on $\omega $ has a well-orderable base”, which in turn implies $\mathsf {UF_{wob}}(\omega )$, and none of these implications are reversible in $\mathsf {ZF}$.

7. (7) “Every filter on $\omega $ can be extended to an ultrafilter with a well-orderable base” is equivalent to $\mathsf {AC}(\mathbb {R}),$ and thus is strictly stronger than $\mathsf {UF_{wob}}(\omega )$ in $\mathsf {ZF}$.

8. (8) “Every filter on $\omega $ can be extended to an ultrafilter” implies “there exists a free ultrafilter on $\omega $ which has no well-orderable base of cardinality ${<2^{\aleph _{0}}}$”. The former principle does not imply “there exists a free ultrafilter on $\omega $ which has no well-orderable base” in $\mathsf {ZF}$, and the latter principle is true in the Basic Cohen Model.

In this article, we propose a new classification of $\Sigma ^0_2$ formulas under the realizability interpretation of many-one reducibility (i.e., Levin reducibility). For example, $\mathsf {Fin}$, the decision of being eventually zero for sequences, is many-one/Levin complete among $\Sigma ^0_2$ formulas of the form $\exists n\forall m\geq n.\varphi (m,x)$, where $\varphi $ is decidable. The decision of boundedness for sequences $\mathsf {BddSeq}$ and for width of posets $\mathsf {FinWidth}$ are many-one/Levin complete among $\Sigma ^0_2$ formulas of the form $\exists n\forall m\geq n\forall k.\varphi (m,k,x)$, where $\varphi $ is decidable. However, unlike the classical many-one reducibility, none of the above is $\Sigma ^0_2$-complete. The decision of non-density of linear orders $\mathsf {NonDense}$ is truly $\Sigma ^0_2$-complete.

We contribute to the study of generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set ${\mathcal {P}}({\lambda })$ of a singular cardinal $\lambda $ of countable cofinality or products $\prod _{i<\omega }\lambda _i$ for a strictly increasing sequence $\langle {\lambda _i}~\vert ~{i<\omega }\rangle $ of cardinals. We consider the question under which large cardinal hypothesis classes of definable subsets of these spaces possess such regularity properties, focusing on rank-into-rank axioms and classes of sets definable by $\Sigma _1$-formulas with parameters from various collections of sets. We prove that $\omega $-many measurable cardinals, while sufficient to prove the perfect set property of all $\Sigma _1$-definable sets with parameters in $V_\lambda \cup \{V_\lambda \}$, are not enough to prove it if there is a cofinal sequence in $\lambda $ in the parameters. For this conclusion, the existence of an I2-embedding is enough, but there are parameters in $V_{\lambda +1}$ for which I2 is still not enough. The situation is similar for the Baire property: under I2 all sets that are $\Sigma _1$-definable using elements of $V_\lambda $ and a cofinal sequence as parameters have the Baire property, but I2 is not enough for some parameter in $V_{\lambda +1}$. Finally, the existence of an I0-embedding implies that all sets that are $\Sigma ^1_n$-definable with parameters in $V_{\lambda +1}$ have the Baire property.