SearcharxivSearch

arXiv · 1808.03017

A Lower Bound for the Hanf Number for Joint Embedding

Abstract

In [13] the authors show that if $\mu$ is a strongly compact cardinal, $K$ is an Abstract Elementary Class (AEC) with $LS(K)<\mu$, and $K$ satisfies joint embedding (amalgamation) cofinally below $\mu$, then $K$ satisfies joint embedding (amalgamation) in all cardinals $\ge \mu$. The question was raised if the strongly compact upper bound was optimal. In this paper we prove the existence of an AEC $K$ that can be axiomatized by an $\mathcal{L}_{\omega_1,\omega}$-sentence in a countable vocabulary, so that if $\mu$ is the first measurable cardinal, then (1) $K$ satisfies joint embedding cofinally below $\mu$ ; (2) $K$ fails joint embedding cofinally below $\mu$; and (3) $K$ satisfies joint embedding above $\mu$. Moreover, the example can be generalized to an AEC $K^\chi$ axiomatized in $\mathcal{L}_{\chi^+, \omega}$, in a vocabulary of size $\chi$, such that (1)-(3) hold with $\mu$ being the first measurable above $\chi$. This proves that the Hanf number for joint embedding is contained in the interval between the first measurable and the first strongly compact. Since these two cardinals can consistently coincide, the upper bound from [13] is consistently optimal. This is also the first example of a sentence whose joint embedding spectrum is (consistently) neither an initial nor an eventual interval of cardinals. By Theorem 3.26, it is consistent that for any club $C$ on the first measurable $\mu$, JEP holds exactly on $\lim C$ and everywhere above $\mu$.

Explore related subjects

Keep this discovery

BibTeXRIS

Will Boney, Ioannis Souldatos. 2018-08-09. A Lower Bound for the Hanf Number for Joint Embedding. https://arxiv.org/abs/1808.03017

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