SearcharxivSearch

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 $\lambda$ 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 $\lambda$-Polish spaces and standard $\lambda$-Borel spaces (characterization of the generalized Cantor and Baire spaces, analogues of the Cantor-Bendixson theorem, classification up to $\lambda$-Borel isomorphism, etc.), their $\lambda$-Borel hierarchy (structural properties, changes of topologies, and so on), $\lambda$-analytic sets (including generalizations of the Lusin separation theorem and of the Souslin theorem), $\lambda$-coanalytic sets (including $\lambda$-$\boldsymbol{\Pi}^1_1$-ranks and alike), and $\lambda$-projective sets. We also consider more advanced topics, and provide e.g. various uniformization results for $\lambda$-Borel set; these in turn lead to fundamental applications to the study of $\lambda$-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}(\lambda)$.

Explore related subjects

Keep this discovery

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO