Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNon-Absoluteness of Model Existence at $aleph_omega$
95
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In [FHK13], the authors considered the question whether model-existence of $L_{omega_1,omega}$-sentences is absolute for transitive models of ZFC, in the sense that if $V subseteq W$ are transitive models of ZFC with the same ordinals, $varphiin V$ and $Vmodels varphi text{ is an } L_{omega_1,omega}text{-sentence}$, then $V models varphi text{ has a model of size } aleph_alpha$ if and only if $W models varphi text{ has a model of size } aleph_alpha$. From [FHK13] we know that the answer is positive for $alpha=0,1$ and under the negation of CH, the answer is negative for all $alpha>1$. Under GCH, and assuming the consistency of a supercompact cardinal, the answer remains negative for each $alpha>1$, except the case when $alpha=omega$ which is an open question in [FHK13]. We answer the open question by providing a negative answer under GCH even for $alpha=omega$. Our examples are incomplete sentences. In fact, the same sentences can be used to prove a negative answer under GCH for all $alpha>1$ assuming the consistency of a Mahlo cardinal. Thus, the large cardinal assumption is relaxed from a supercompact in [FHK13] to a Mahlo cardinal. Finally, we consider the absoluteness question for the $aleph_alpha$-amalgamation property of $L_{omega_1,omega}$-sentences (under substructure). We prove that assuming GCH, $aleph_alpha$-amalgamation is non-absolute for $1<alpha<omega$. This answers a question from [SS]. The cases $alpha=1$ and $alpha$ infinite remain open. As a corollary we get that it is non-absolute that the amalgamation spectrum of an $L_{omega_1,omega}$-sentence is empty.
rate research
Read More
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 Hjorths 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.
Let ${mathfrak C}$ be a monster model of an arbitrary theory $T$, $bar alpha$ any tuple of bounded length of elements of ${mathfrak C}$, and $bar c$ an enumeration of all elements of ${mathfrak C}$. By $S_{bar alpha}({mathfrak C})$ denote the compact space of all complete types over ${mathfrak C}$ extending $tp(bar alpha/emptyset)$, and $S_{bar c}({mathfrak C})$ is defined analogously. Then $S_{bar alpha}({mathfrak C})$ and $S_{bar c}({mathfrak C})$ are naturally $Aut({mathfrak C})$-flows. We show that the Ellis groups of both these flows are of bounded size (i.e. smaller than the degree of saturation of ${mathfrak C}$), providing an explicit bound on this size. Next, we prove that these Ellis groups do not depend on the choice of the monster model ${mathfrak C}$; thus, we say that they are absolute. We also study minimal left ideals (equivalently subflows) of the Ellis semigroups of the flows $S_{bar alpha}({mathfrak C})$ and $S_{bar c}({mathfrak C})$. We give an example of a NIP theory in which the minimal left ideals are of unbounded size. We show that in each of these two cases, boundedness of a minimal left ideal is an absolute property (i.e. it does not depend on the choice of ${mathfrak C}$) and that whenever such an ideal is bounded, then its isomorphism type is also absolute. Assuming NIP, we give characterizations of when a minimal left ideal of the Ellis semigroup of $S_{bar c}({mathfrak C})$ is bounded. Then we adapt a proof of Chernikov and Simon to show that whenever such an ideal is bounded, the natural epimorphism (described by Krupinski, Pillay and Rzepecki) from the Ellis group of the flow $S_{bar c}({mathfrak C})$ to the Kim-Pillay Galois group $Gal_{KP}(T)$ is an isomorphism (in particular, $T$ is G-compact). We provide some counter-examples for $S_{bar alpha}({mathfrak C})$ in place of $S_{bar c}({mathfrak C})$.
We discuss a system of strengthenings of $aleph_omega$ is Jonsson indexed by real numbers, and identify a strongest one. We give a proof of a theorem of Silver and show that there is a barrier to weakening its hypothesis.
Let 0<n^*< omega and f:X-> n^*+1 be a function where X subseteq omega backslash (n^*+1) is infinite. Consider the following set S_f= {x subset aleph_omega : |x| <= aleph_{n^*} & (for all n in X)cf(x cap alpha_n)= aleph_{f(n)}}. The question, first posed by Baumgartner, is whether S_f is stationary in [alpha_omega]^{< aleph_{n^*+1}}. By a standard result, the above question can also be rephrased as certain transfer property. Namely, S_f is stationary iff for any structure A=< aleph_omega, ... > theres a B prec A such that |B|= aleph_{n^*} and for all n in X we have cf(B cap aleph_n)= aleph_{f(n)}. In this paper, we are going to prove a few results concerning the above question.
This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation $m$ that satisfies the minority equations $m(y,x,x) approx m(x,y,x) approx m(x,x,y) approx y$. We show that a common polynomial-time approach to testing for this type of condition will not work in this case and that this decision problem lies in the class NP.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
