SearcharxivSearch

arXiv · 1707.08506

The weakly compact reflection principle need not imply a high order of weak compactness

Abstract

The weakly compact reflection principle $\text{Refl}_{\text{wc}}(\kappa)$ states that $\kappa$ is a weakly compact cardinal and every weakly compact subset of $\kappa$ has a weakly compact proper initial segment. The weakly compact reflection principle at $\kappa$ implies that $\kappa$ is an $\omega$-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that $\kappa$ is $(\omega+1)$-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at $\kappa$ then there is a forcing extension preserving this in which $\kappa$ is the least $\omega$-weakly compact cardinal. Along the way we generalize the well-known result which states that if $\kappa$ is a regular cardinal then in any forcing extension by $\kappa$-c.c. forcing the nonstationary ideal equals the ideal generated by the ground model nonstationary ideal; our generalization states that if $\kappa$ is a weakly compact cardinal then after forcing with a `typical' Easton-support iteration of length $\kappa$ the weakly compact ideal equals the ideal generated by the ground model weakly compact ideal.

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Cody, Hiroshi Sakai. 2017-07-26. The weakly compact reflection principle need not imply a high order of weak compactness. https://arxiv.org/abs/1707.08506

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