SearcharxivSearch

arXiv · 2211.13361

PCF Theory and the Tukey Spectrum

Abstract

In this paper, we investigate the relationship between the Tukey order and PCF theory, as applied to sets of regular cardinals. We show that it is consistent that for all sets $A$ of regular cardinals that the Tukey spectrum of $A$, denoted $\operatorname{spec}(A)$, is equal to the set of possible cofinalities of $A$, denoted $\operatorname{pcf}(A)$; this is to be read in light of the $\mathsf{ZFC}$ fact that $\operatorname{pcf}(A)\subseteq\operatorname{spec}(A)$ holds for all $A$. We also prove results about when regular limit cardinals must be in the Tukey spectrum or must be out of the Tukey spectrum of some $A$, and we show the relevance of these for forcings which might separate $\operatorname{spec}(A)$ from $\operatorname{pcf}(A)$. Finally, we show that the strong part of the Tukey spectrum can be used in place of PCF-theoretic scales to lift the existence of Jonsson algebras from below a singular to hold at its successor. We close with a list of questions.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Gilton. 2022-11-24. PCF Theory and the Tukey Spectrum. https://arxiv.org/abs/2211.13361

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