Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9903010

Patterns of Compact Cardinals

Arthur W. Apter
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model of ``ZFC + Omega is the least inaccessible limit of measurable limits of supercompact cardinals + f :Omega-->2 is a function'', then there is a partial ordering P in V so that for Vbar = V^P, Vbar_Omega models ``ZFC + There is a proper class of compact cardinals + If f(alpha) = 0, then the alpha-th compact cardinal isn't supercompact + If f(alpha) = 1, then the alpha-th compact cardinal is supercompact''. We then prove a generalized version of this theorem assuming kappa is a supercompact limit of supercompact cardinals and f:kappa-->2 is a function, and we derive as corollaries of the generalized version of the theorem the consistency of the least measurable limit of supercompact cardinals being the same as the least measurable limit of non-supercompact strongly compact cardinals and the consistency of the least supercompact cardinal being a limit of strongly compact cardinals.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Arthur W. Apter. 1999-03-01. Patterns of Compact Cardinals. https://arxiv.org/abs/math/9903010

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↗