SearcharxivSearch

arXiv · 1501.07316

The Joint Embedding Property and Maximal Models

Abstract

We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(λ_i : i \le α<\aleph_1)$ is a strictly increasing sequence of characterizable cardinals (Definition 2.1) whose models satisfy JEP$(<λ_0)$, there is an $L_{ω_1,ω}$ -sentence $ψ$ whose models form a pure AEC and (1) The models of $ψ$ satisfy JEP$(<λ_0)$, while JEP fails for all larger cardinals and AP fails in all infinite cardinals. (2) There exist $2^{λ_i^+}$ non-isomorphic maximal models of $ψ$ in $λ_i^+$, for all $i \le α$, but no maximal models in any other cardinality; and (3) $ψ$ has arbitrarily large models. In particular this shows the Hanf number for JEP and the Hanf number for maximality for pure AEC with Lowenheim number $\aleph_0$ are at least $\beth_{ω_1}$. We show that although AP$(κ)$ for each $κ$ implies the full amalgamation property, JEP$(κ)$ for each κdoes not imply the full joint embedding property. We show the main combinatorial device of this paper cannot be used to extend the main theorem to a complete sentence.

Explore related subjects

Keep this discovery

BibTeXRIS

John T. Baldwin, Martin Koerwien, Ioannis Souldatos. 2015-02-19. The Joint Embedding Property and Maximal Models. https://arxiv.org/abs/1501.07316

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