Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.13250

Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy

Christopher Sorg
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the exact-basis problem for Solvability Complexity Index (SCI) computational problem families through finite-query transports. A raw finite-query reduction permits arbitrary encodings and finite transcript reconstructions, with only a continuous output decoder. For the Colbrook-Hansen (CH23) singleton-window spectral/pseudospectral block, this raw preorder collapses the expected two-source structure: the diagonal exact spectral and fixed-$\varepsilon$ pseudospectral sources are raw- and continuous-finite-query equivalent, and, for computable $\varepsilon$ under the evaluation-name representations, TTE-finite-query equivalent, so the six-problem ambient is raw-principal. We then introduce modal finite-query preorders, whose admissibility conditions may restrict encodings, decoders, reconstructions, uniformity, and geometric naturality. We also characterize TTE finite-query transport as computable point transport with a uniform finite interface trace; after forgetting the trace this gives strong Weihrauch reducibility, and the implication is strict. Under a CH23 geometric modality generated by representation inclusions, unitary and graph relabelings, and neutral stabilizations, the same ambient has exactly two minimal exact sources. This gives a calibrated reformulation of the exact-basis problem: natural SCI families should be classified by modality-indexed exact bases and refinement maps, not by one raw preorder alone.

Explore related subjects

math.LOcs.NAmath.NAmath.SP

Keep this discovery

BibTeXRIS

Christopher Sorg. 2026-06-11. Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy. https://arxiv.org/abs/2606.13250

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↗