English
Related papers

Related papers: On the existence of atomic models

200 papers

Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.

Logic · Mathematics 2009-09-25 Menachem Magidor , Saharon Shelah

We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…

Logic · Mathematics 2009-09-25 Saharon Shelah , Andrés Villaveces

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…

Logic · Mathematics 2014-08-15 Tarek Sayed Ahmed

We study the question of when an uncountable ccc topological space $X$ contains a ccc subspace of size $\aleph_1$. We show that it does if $X$ is compact Hausdorff and more generally if $X$ is Hausdorff with $\mathrm{pct}(X) \leq \aleph_1$.…

General Topology · Mathematics 2018-04-25 Ramiro de la Vega

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

Logic · Mathematics 2012-08-14 M. Malliaris , S. Shelah

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

Logic · Mathematics 2015-03-17 Juan Carlos Martinez , Lajos Soukup

We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take…

Logic · Mathematics 2018-12-04 Anne Fernengel , Peter Koepke

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

Operator Algebras · Mathematics 2013-01-28 Ilijas Farah , Takeshi Katsura

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on…

Logic in Computer Science · Computer Science 2023-06-22 Antonio Bucciarelli , Delia Kesner , Simona Ronchi Della Rocca

We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.

Logic · Mathematics 2021-10-01 Bektur Baizhanov , Tatyana Zambarnaya

Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_{\alpha}(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest…

Logic · Mathematics 2009-09-25 Mitch Rudominer

On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal…

Logic · Mathematics 2007-05-23 Apoloniusz Tyszka

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Logic · Mathematics 2015-04-24 Tarek Sayed Ahmed

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

Logic · Mathematics 2007-05-23 Lorenz Halbeisen , Saharon Shelah

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

We continue the work of [KlSh:362] and prove that for lambda successor, a lambda-categorical theory T in L_{kappa^*, omega} is mu-categorical for every mu, mu <= lambda which is above the (2^{LS(T)})^+-beth cardinal.

Logic · Mathematics 2009-09-25 Saharon Shelah

The consistency of a second-order version of a theorem of Morley on the number of countable models was proved in arXiv:2107.07636 with the aid of large cardinals. We here dispense with them.

Logic · Mathematics 2024-01-22 Franklin D. Tall , Jing Zhang

Let K be an abstract elementary classes which has arbitrarily large models and satisfies the amalgamation and joint embedding properties. Theorem 1. Suppose K is \chi-tame. If K is categorical in some \lambda^+ >LS(K) then it is categorical…

Logic · Mathematics 2007-05-23 Rami Grossberg , Monica VanDieren