SearcharxivSearch

arXiv · 2109.07310

Non-absoluteness of Hjorth's Cardinal Characterization

Abstract

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of cardinality $\aleph_{\alpha+1}$. Unfortunately, his solution does not yield a single $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$, but a set of $\mathcal{L}_{\omega_1,\omega}$-sentences, one of which is guaranteed to work. It was conjectured in [9] that it is independent of the axioms of ZFC which of these sentences has the desired property. In the present paper, we prove that this conjecture is true. More specifically, we isolate a diagonalization principle for functions from $\omega_1$ to $\omega_1$ which is a consequence of the Bounded Proper Forcing Axiom (BPFA) and then we use this principle to prove that Hjorth's solution to characterizing $\aleph_2$ in models of BPFA is different than in models of CH. In addition, we show that large cardinals are not needed to obtain this independence result by proving that our diagonalization principle can be forced over models of CH.

Explore related subjects

Keep this discovery

BibTeXRIS

Philipp Lücke, Ioannis Souldatos. 2021-09-15. Non-absoluteness of Hjorth's Cardinal Characterization. https://arxiv.org/abs/2109.07310

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