Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2101.04552

Structural reflection, shrewd cardinals and the size of the continuum

Philipp Lücke
View original source ↗Read source document ↗Export metadata ↓

Abstract

Motivated by results of Bagaria, Magidor and V\"a\"an\"anen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower end of the large cardinal hierarchy through the principle $\mathrm{SR}^-$ introduced by Bagaria and V\"a\"an\"anen. Our results isolate a narrow interval in the large cardinal hierarchy that is bounded from below by total indescribability and from above by subtleness, and contains all large cardinals that can be characterized through the validity of the principle $\mathrm{SR}^-$ for all classes of structures defined by formulas in a fixed level of the L\'{e}vy hierarchy. Moreover, it turns out that no property that can be characterized through this principle can provably imply strong inaccessibility. The proofs of these results rely heavily on the notion of "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, and embedding characterizations of these cardinals that resembles Magidor's classical characterization of supercompactness. In addition, we show that several important weak large cardinal properties, like weak inaccessibility, weak Mahloness or weak $\Pi^1_n$-indescribability, can be canonically characterized through localized versions of the principle $\mathrm{SR}^-$. Finally, the techniques developed in the proofs of these characterizations also allow us to show that Hamkin's "weakly compact embedding property" is equivalent to L\'{e}vy's notion of weak $\Pi^1_1$-indescribability.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Philipp Lücke. 2021-01-12. Structural reflection, shrewd cardinals and the size of the continuum. https://arxiv.org/abs/2101.04552

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↗