We construct a Borel maximal cofinitary group.

A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a $\mathbf {0}'$-computable low$_3$ compact Polish space which is not homeomorphic to a computable one, and that, for any natural number $n\geq 2$, there exists a Polish space $X_n$ such that exactly the high$_{n}$-degrees are required to present the homeomorphism type of $X_n$. Along the way we investigate the computable aspects of Čech homology groups. We also show that no compact Polish space has a least presentation with respect to Turing reducibility.

I continue the study of the blurry HOD hierarchy. The technically most involved result is that the theory ZFC + “$\aleph _\omega $ is a strong limit cardinal and $\aleph _{\omega +1}$ is the least leap” is equiconsistent with the theory ZFC + “there is a measurable cardinal.”

We construct divergent models of $\mathsf {AD}^+$ along with the failure of the Continuum Hypothesis ($\mathsf {CH}$) under various assumptions. Divergent models of $\mathsf {AD}^+$ play an important role in descriptive inner model theory; all known analyses of HOD in $\mathsf {AD}^+$ models (without extra iterability assumptions) are carried out in the region below the existence of divergent models of $\mathsf {AD}^+$. Our results are the first step toward resolving various open questions concerning the length of definable prewellorderings of the reals and principles implying $\neg \mathsf {CH}$, like $\mathsf {MM}$, that divergent models shed light on, see Question 5.1.

There is a balance between the amount of (weak) indestructibility one can have and the amount of strong cardinals. It’s consistent relative to large cardinals to have lots of strong cardinals and all of their degrees of strength are weakly indestructible. But this necessitates the destructibility of the partially strong cardinals. Guaranteeing the indestructibility of the partially strong cardinals is shown to be harder. In particular, this work establishes an equiconsistency between:

1. 1. a proper class of cardinals that are strong reflecting strongs; and

2. 2. weak indestructibility for (κ+2)-strength for all cardinals κ in the presence of a proper class of strong cardinals.

1. 3. weak indestructibility for all degrees of strength for a proper class of strong cardinals.

One direction of the equiconsistency of (1) and (2) is proven using forcing and the other using core model techniques from inner model theory. Additionally, connections between weak indestructibility and the reflection properties associated with Woodin cardinals are discussed, and similar results are derived for supercompacts and supercompacts reflecting supercompacts.

Abstract prepared by James Holland.

E-mail: jch258@scarletmail.rutgers.edu

URL: https://sites.math.rutgers.edu/~jch258/assets/dis.pdf

We study the complexities of isometry and isomorphism classes of separable Banach spaces in the Polish spaces of Banach spaces, recently introduced and investigated by the authors in [14]. We obtain sharp results concerning the most classical separable Banach spaces.

We prove that the infinite-dimensional separable Hilbert space is characterized as the unique separable infinite-dimensional Banach space whose isometry class is closed, and also as the unique separable infinite-dimensional Banach space whose isomorphism class is $F_\sigma $. For $p\in \left [1,2\right )\cup \left (2,\infty \right )$, we show that the isometry classes of $L_p[0,1]$ and $\ell _p$ are $G_\delta $-complete sets and $F_{\sigma \delta }$-complete sets, respectively. Then we show that the isometry class of $c_0$ is an $F_{\sigma \delta }$-complete set.

Additionally, we compute the complexities of many other natural classes of separable Banach spaces; for instance, the class of separable $\mathcal {L}_{p,\lambda +}$-spaces, for $p,\lambda \geq 1$, is shown to be a $G_\delta $-set, the class of superreflexive spaces is shown to be an $F_{\sigma \delta }$-set, and the class of spaces with local $\Pi $-basis structure is shown to be a $\boldsymbol {\Sigma }^0_6$-set. The paper is concluded with many open problems and suggestions for a future research.

Ultrafilters play a significant role in model theory to characterize logics having various compactness and interpolation properties. They also provide a general method to construct extensions of first-order logic having these properties. A main result of this paper is that every class $\Omega $ of uniform ultrafilters generates a $\Delta $-closed logic ${\mathcal {L}}_\Omega $. ${\mathcal {L}}_\Omega $ is $\omega $-relatively compact iff some $D\in \Omega $ fails to be $\omega _1$-complete iff ${\mathcal {L}}_\Omega $ does not contain the quantifier “there are uncountably many.” If $\Omega $ is a set, or if it contains a countably incomplete ultrafilter, then ${\mathcal {L}}_\Omega $ is not generated by Mostowski cardinality quantifiers. Assuming $\neg 0^\sharp $ or $\neg L^{\mu }$, if $D\in \Omega $ is a uniform ultrafilter over a regular cardinal $\nu $, then every family $\Psi $ of formulas in ${\mathcal {L}}_\Omega $ with $|\Phi |\leq \nu $ satisfies the compactness theorem. In particular, if $\Omega $ is a proper class of uniform ultrafilters over regular cardinals, ${\mathcal {L}}_\Omega $ is compact.

An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey’s theorem on uncountable cardinals asserting that if we color edges of the complete graph, we can find a large highly connected monochromatic subgraph. In particular, several questions of Bergfalk, Hrušák, and Shelah (2021, Acta Mathematica Hungarica 163, 309–322) are answered by showing that assuming the consistency of suitable large cardinals, the following are relatively consistent with ZFC:

• • $\kappa \to _{hc} (\kappa )^2_\omega $ for every regular cardinal $\kappa \geq \aleph _2$,

• • $\neg \mathsf {CH}+ \aleph _2 \to _{hc} (\aleph _1)^2_\omega $.

Building on a work of Lambie-Hanson (2023, Fundamenta Mathematicae. 260(2):181–197), we also show that

• • $\aleph _2 \to _{hc} [\aleph _2]^2_{\omega ,2}$ is consistent with $\neg \mathsf {CH}$.

To prove these results, we use the existence of ideals with strong combinatorial properties after collapsing suitable large cardinals.

I provide simplified proofs for each of the following fundamental theorems regarding selection principles:

1. (1) The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of continuous functions on a space is actually preserved by Borel images of that space.

2. (2) The Scheepers Diagram Last Theorem, due to Peng, completing all provable implications in the diagram.

3. (3) The Menger Game Theorem, due to Telgársky, determining when Bob has a winning strategy in the game version of Menger’s covering property.

4. (4) A lower bound on the additivity of Rothberger’s covering property, due to Carlson.

The simplified proofs lead to several new results.

Given an uncountable cardinal $\kappa $, we consider the question of whether subsets of the power set of $\kappa $ that are usually constructed with the help of the axiom of choice are definable by $\Sigma _1$-formulas that only use the cardinal $\kappa $ and sets of hereditary cardinality less than $\kappa $ as parameters. For limits of measurable cardinals, we prove a perfect set theorem for sets definable in this way and use it to generalize two classical nondefinability results to higher cardinals. First, we show that a classical result of Mathias on the complexity of maximal almost disjoint families of sets of natural numbers can be generalized to measurable limits of measurables. Second, we prove that for a limit of countably many measurable cardinals, the existence of a simply definable well-ordering of subsets of $\kappa $ of length at least $\kappa ^+$ implies the existence of a projective well-ordering of the reals. In addition, we determine the exact consistency strength of the nonexistence of $\Sigma _1$-definitions of certain objects at singular strong limit cardinals. Finally, we show that both large cardinal assumptions and forcing axioms cause analogs of these statements to hold at the first uncountable cardinal $\omega _1$.

We study the $\kappa $-Borel-reducibility of isomorphism relations of complete first-order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T’, if T is classifiable and T’ is unsuperstable, then the isomorphism of models of T’ is strictly above the isomorphism of models of T with respect to $\kappa $-Borel-reducibility.

In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu $ such that the singular cardinal hypothesis fails at $\nu $ and every collection of fewer than $\operatorname {\mathrm {cf}}(\nu )$ stationary subsets of $\nu ^{+}$ reflects simultaneously. For $\operatorname {\mathrm {cf}}(\nu )> \omega $, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\operatorname {\mathrm {cf}}(\nu ) = \omega $ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.

We consider of constructing normal ultrafilters in extensions are here Easton support iterations of Prikry-type forcing notions. New ways presented. It turns out that, in contrast with other supports, seemingly unrelated measures or extenders can be involved here.

Katok’s special representation theorem states that any free ergodic measure- preserving $\mathbb {R}^{d}$-flow can be realized as a special flow over a $\mathbb {Z}^{d}$-action. It provides a multidimensional generalization of the ‘flow under a function’ construction. We prove the analog of Katok’s theorem in the framework of Borel dynamics and show that, likewise, all free Borel $\mathbb {R}^{d}$-flows emerge from $\mathbb {Z}^{d}$-actions through the special flow construction using bi-Lipschitz cocycles.

We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2) a proper class of cardinals that are strong reflecting strongs. We in fact get weak indestructibility for degrees of strength far beyond $\kappa +2$, well beyond the next inaccessible limit of measurables (of the ground model). One direction is proven using forcing and the other using core model techniques from inner model theory. Additionally, connections between weak indestructibility and the reflection properties associated with Woodin cardinals are discussed. This work is a part of my upcoming thesis [7].

It is consistent relative to an inaccessible cardinal that ZF+DC holds, and the hypergraph of isosceles triangles on $\mathbb {R}^2$ has countable chromatic number while the hypergraph of isosceles triangles on $\mathbb {R}^3$ has uncountable chromatic number.

1. (1) We show that it is possible to add $\kappa ^+$-Cohen subsets to $\kappa $ with a Prikry forcing over $\kappa $. This answers a question from [9].

2. (2) A strengthening of non-Galvin property is introduced. It is shown to be consistent using a single measurable cardinal which improves a previous result by S. Garti, S. Shelah, and the first author [5].

3. (3) A situation with Extender-based Prikry forcings is examined. This relates to a question of H. Woodin.

We answer a question of Usuba by showing that the combinatorial principle $\mathrm {UB}_\lambda $ can fail at a singular cardinal. Furthermore, $\lambda $ can be taken to be $\aleph _\omega .$

We continue investigating variants of the splitting and reaping numbers introduced in [4]. In particular, answering a question raised there, we prove the consistency of and of . Moreover, we discuss their natural generalisations $\mathfrak {s}_{\rho }$ and $\mathfrak {r}_{\rho }$ for $\rho \in (0,1)$, and show that $\mathfrak {r}_{\rho }$ does not depend on $\rho $.

We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity, strategic closure, and precipitousness.