Search arXivSearch

arXiv · 2511.16188

Generalized Descriptive Set Theory at Singular Cardinals of Countable Cofinality

Abstract

We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $λ$ of countable confinality. Somewhat unexpectedly, the resulting theory is remarkably similar to the classical one, although the methods used are necessarily fairly different and combine ideas and results from general topology, infinite combinatorics, and set theory. More in detail, we study $λ$-Polish spaces and standard $λ$-Borel spaces (characterization of the generalized Cantor and Baire spaces, analogues of the Cantor-Bendixson theorem, classification up to $λ$-Borel isomorphism, etc.), their $λ$-Borel hierarchy (structural properties, changes of topologies, and so on), $λ$-analytic sets (including generalizations of the Lusin separation theorem and of the Souslin theorem), $λ$-coanalytic sets (including $λ$-$\boldsymbolΠ^1_1$-ranks and alike), and $λ$-projective sets. We also consider more advanced topics, and provide e.g. various uniformization results for $λ$-Borel set; these in turn lead to fundamental applications to the study of $λ$-Borel equivalence relations, such as a generalization of the celebrated Feldman-Moore theorem. Finally, we study a natural generalization of the classical Perfect Set Property, and develop tools to show that all definable sets enjoy such property under suitable large cardinal assumptions, most notably including Woodin's $\mathsf{I0}(λ)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincenzo Dimonte, Luca Motto Ros. 2025-11-20. Generalized Descriptive Set Theory at Singular Cardinals of Countable Cofinality. https://arxiv.org/abs/2511.16188

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

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 relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO