Do you want to publish a course? Click here

A Lower Bound for the Hanf Number for Joint Embedding

65   0   0.0 ( 0 )
 Added by Ioannis Souldatos
 Publication date 2018
  fields
and research's language is English




Ask ChatGPT about the research

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$.



rate research

Read More

The Hanf number for a set $S$ of sentences in $L_{omega_1,omega}$ (or some other logic) is the least infinite cardinal $kappa$ such that for all $varphiin S$, if $varphi$ has models in all infinite cardinalities less than $kappa$, then it has models of all infinite cardinalities. S-D. Friedman asked what is the Hanf number for Scott sentences of computable structures. We show that the value is $beth_{omega_1^{CK}}$. The same argument proves that $beth_{omega_1^{CK}}$ is the Hanf number for Scott sentences of hyperarithmetical structures.
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 $(lambda_i : i le alpha<aleph_1)$ is a strictly increasing sequence of characterizable cardinals (Definition 2.1) whose models satisfy JEP$(<lambda_0)$, there is an $L_{omega_1,omega}$ -sentence $psi$ whose models form a pure AEC and (1) The models of $psi$ satisfy JEP$(<lambda_0)$, while JEP fails for all larger cardinals and AP fails in all infinite cardinals. (2) There exist $2^{lambda_i^+}$ non-isomorphic maximal models of $psi$ in $lambda_i^+$, for all $i le alpha$, but no maximal models in any other cardinality; and (3) $psi$ 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_{omega_1}$. We show that although AP$(kappa)$ for each $kappa$ implies the full amalgamation property, JEP$(kappa)$ for each kappa 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.
153 - J. Scott Carter 2005
We study the number of Reidemeister type III moves using Fox n-colorings of knot diagrams.
Let $(S,mathcal L)$ be a smooth, irreducible, projective, complex surface, polarized by a very ample line bundle $mathcal L$ of degree $d > 35$. In this paper we prove that $K^2_Sgeq -d(d-6)$. The bound is sharp, and $K^2_S=-d(d-6)$ if and only if $d$ is even, the linear system $|H^0(S,mathcal L)|$ embeds $S$ in a smooth rational normal scroll $Tsubset mathbb P^5$ of dimension $3$, and here, as a divisor, $S$ is linearly equivalent to $frac{d}{2}Q$, where $Q$ is a quadric on $T$.
We show in this note that the average number of terms in the optimal double-base number system is in Omega(n / log n). The lower bound matches the upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp. 2008).
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا