SearcharxivSearch

arXiv · 2602.09592

Super Black Boxes Revisited

Abstract

Let $ \kappa , \theta < \lambda$ be cardinals, with $\lambda$ and $\kappa$ regular. Concentrating on a simple case, we say that the triple $(\lambda,\kappa,\theta)$ has a Super Black Box when the following holds. For some stationary $S \subseteq \{\delta < \lambda : cf(\delta) = \kappa\}$ and $\overline C = \langle C_\delta : \delta \in S \rangle$, where $C_\delta$ is a club of $\delta$ of order type $\kappa$, for every coloring $\overline F = \langle F_\delta : \delta \in S \rangle$ with $F_\delta : {}^{C_\delta}\lambda \to \theta$, there exists $\langle c_\delta : \delta \in S\rangle \in {}^S\!\theta$ such that for every $f : \lambda \to \theta$, for stationarily many $\delta \in S$, we have $F_\delta(f \upharpoonright C_\delta) = c_\delta$. In an earlier work, it was proved (along with much more) that for a class of cardinals $\lambda$ this holds for many pairs $(\kappa,\theta)$. E.g.~$\kappa < \aleph_\omega$ is large enough, and $\beth_\omega(\theta) < \lambda$. However, the most interesting cases (at least with regards to Abelian groups) are $\kappa = \aleph_0,\aleph_1$ (which have not been covered yet). Here we restrict ourselves to the case where $\overline F$ is a {so-called} \emph{continuous coloring}, which includes the case where $F_\delta$ is computed from some $$ \big\langle F_{\delta,\beta}'(f \upharpoonright (C_\delta \cap \beta)) : \beta \in C_\delta \big\rangle. $$ This covers the cases we have in mind. We mainly prove results without any other caveats: e.g. For every regular $\kappa$ and $\theta$ there exists such a $\lambda$. We also deal with having multiple {$\bar C$-s}, and the existence of quite free subsets of ${}^\kappa\mu$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saharon Shelah. 2026-02-10. Super Black Boxes Revisited. https://arxiv.org/abs/2602.09592

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