Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.05620

On the computational properties of ambivalent sets and functions

Dag Normann·Sam Sanders
View original source ↗Read source document ↗Export metadata ↓

Abstract

Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise limit of a sequence of continuous functions; the latter form a class nowadays simply called `Baire 1'. We shall study a class strictly between the semi-continuous and Baire 1 functions, called the ambivalent fuctions. In particular, we investigate the computational properties of the class of ambivalent functions and sets, denoted $\bf \Delta$, working with Kleene's S1-S9 schemes. Computational equivalences for various standard operations (supremum, Baire 1 representation, \dots) on $\bf \Delta$ are established, including the structure functional $\Omega_{\bf \Delta}$ that decides if a given ambivalent set is non-empty. A selector is shown to be computable relative to $\Omega_{\bf \Delta}$ and Kleene's quantifier $\exists^{2}$.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Dag Normann, Sam Sanders. 2026-02-05. On the computational properties of ambivalent sets and functions. https://arxiv.org/abs/2602.05620

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗