SearcharxivSearch

arXiv · 2607.08909

Ranked Discontinuities of Multivalued Functions

Abstract

We study discontinuity of multivalued functions (also known as problems) $P$ on Baire space by assigning an ordinal rank to points in the domain of $P$ that have no local realizers. For each countable ordinal $\alpha$, let $\mathsf{ACC}_{\mathbb N}^{\alpha}$ be the problem of solving $\mathsf{ACC}_{\mathbb N}$ in at most $\alpha$ many attempts, with a new instance provided for each attempt. Our main theorem shows that, for any problem $P$, the following are equivalent: (i) $P$ is discontinuous on some set all of whose points have Cantor--Bendixson rank at most $\alpha$, and (ii) $\mathsf{ACC}_{\mathbb N}^{\alpha}\leq_{\mathrm W}^{*}P$. This extends to points: $P \geq_{\mathrm{W}}^* \mathsf{ACC}_{\mathbb{N}}^\alpha$ via a forward function that sends $\#^{\mathbb{N}}$ to $p \in \operatorname{dom}(P)$ if and only if $P$ is discontinuous on a set $A$ with $\operatorname{rank}_A(p) \leq \alpha$. We also characterize these properties via a Wadge-style discontinuity game for $P$. We apply this framework to the thin set and achromatic Ramsey theorems. Extending $\mathsf{RT}^{n}_{k,j}$ to ordinal parameters, we define $\mathsf{RT}^{n}_{\alpha,\beta}$ and compute their ranks of discontinuity. The problems $\mathsf{RT}^n_{\alpha,\beta}$ provide examples of problems with discontinuities of each countable rank which are not reducible to $\mathsf{ACC}_{\mathbb{N}}$. The separation from $\mathsf{ACC}_{\mathbb{N}}$ is obtained via the notion of guessability with identified errors.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Samir Mourad. 2026-07-09. Ranked Discontinuities of Multivalued Functions. https://arxiv.org/abs/2607.08909

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