scholarly journals ALMOST GALOIS ω-STABLE CLASSES

2015 ◽  
Vol 80 (3) ◽  
pp. 763-784 ◽  
Author(s):  
JOHN T. BALDWIN ◽  
PAUL B. LARSON ◽  
SAHARON SHELAH

AbstractTheorem. Suppose that k = (K, $$\prec_k$$) is an ℵ0-presentable abstract elementary class with Löwenheim–Skolem number ℵ0, satisfying the joint embedding and amalgamation properties in ℵ0. If K has only countably many models in ℵ1, then all are small. If, in addition, k is almost Galois ω-stable then k is Galois ω-stable. Suppose that k = (K, $$\prec_k$$) is an ℵ0-presented almost Galois ω-stable AEC satisfying amalgamation for countable models, and having a model of cardinality ℵ1. The assertion that K is ℵ1-categorical is then absolute.

2019 ◽  
Vol 84 (3) ◽  
pp. 1240-1251
Author(s):  
SIMON HENRY

AbstractWe show that for any uncountable cardinal λ, the category of sets of cardinality at least λ and monomorphisms between them cannot appear as the category of points of a topos, in particular is not the category of models of a ${L_{\infty ,\omega }}$-theory. More generally we show that for any regular cardinal $\kappa < \lambda$ it is neither the category of κ-points of a κ-topos, in particular, nor the category of models of a ${L_{\infty ,\kappa }}$-theory.The proof relies on the construction of a categorified version of the Scott topology, which constitute a left adjoint to the functor sending any topos to its category of points and the computation of this left adjoint evaluated on the category of sets of cardinality at least λ and monomorphisms between them. The same techniques also apply to a few other categories. At least to the category of vector spaces of with bounded below dimension and the category of algebraic closed fields of fixed characteristic with bounded below transcendence degree.


2006 ◽  
Vol 71 (2) ◽  
pp. 553-568 ◽  
Author(s):  
Rami Grossberg ◽  
Monica Vandieren

AbstractWe prove a categoricity transfer theorem for tame abstract elementary classes.Suppose that K is a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Let λ ≥ Max{χ, LS(K+}. If K is categorical in λ and λ+, then K is categorical in λ++.Combining this theorem with some results from [37]. we derive a form of Shelah's Categoricity Conjecture for tame abstract elementary classes:Suppose K is χ-tame abstract elementary class satisfying the amalgamation and joint embedding properties. Let μ0 ≔ Hanf(K). Ifand K is categorical in somethen K is categorical in μ for all μ .


2017 ◽  
Vol 82 (1) ◽  
pp. 98-119 ◽  
Author(s):  
JOHN T. BALDWIN ◽  
MARTIN KOERWIEN ◽  
MICHAEL C. LASKOWSKI

AbstractWe introduce the concept of a locally finite abstract elementary class and develop the theory of disjoint$\left( { \le \lambda ,k} \right)$-amalgamation) for such classes. From this we find a family of complete ${L_{{\omega _1},\omega }}$ sentences ${\phi _r}$ that a) homogeneously characterizes ${\aleph _r}$ (improving results of Hjorth [11] and Laskowski–Shelah [13] and answering a question of [21]), while b) the ${\phi _r}$ provide the first examples of a class of models of a complete sentence in ${L_{{\omega _1},\omega }}$ where the spectrum of cardinals in which amalgamation holds is other that none or all.


1985 ◽  
Vol 50 (3) ◽  
pp. 604-610
Author(s):  
Francoise Point

The starting point of this work was Saracino and Wood's description of the finitely generic abelian ordered groups [S-W].We generalize the result of Saracino and Wood to a class ∑UH of subdirect products of substructures of elements of a class ∑, which has some relationships with the discriminator variety V(∑t) generated by ∑. More precisely, let ∑ be an elementary class of L-algebras with theory T. Burris and Werner have shown that if ∑ has a model companion then the existentially closed models in the discriminator variety V(∑t) form an elementary class which they have axiomatized. In general it is not the case that the existentially closed elements of ∑UH form an elementary class. For instance, take for ∑ the class ∑0 of linearly ordered abelian groups (see [G-P]).We determine the finitely generic elements of ∑UH via the three following conditions on T:(1) There is an open L-formula which says in any element of ∑UH that the complement of equalizers do not overlap.(2) There is an existentially closed element of ∑UH which is an L-reduct of an element of V(∑t) and whose L-extensions respect the relationships between the complements of the equalizers.(3) For any models A, B of T, there exists a model C of TUH such that A and B embed in C.(Condition (3) is weaker then “T has the joint embedding property”. It is satisfied for example if every model of T has a one-element substructure. Condition (3) implies that ∑UH has the joint embedding property and therefore that the class of finitely generic elements of ∑UH is complete.)


1979 ◽  
Vol 44 (3) ◽  
pp. 289-306 ◽  
Author(s):  
Victor Harnik

The central notion of this paper is that of a (conjunctive) game-sentence, i.e., a sentence of the formwhere the indices ki, ji range over given countable sets and the matrix conjuncts are, say, open -formulas. Such game sentences were first considered, independently, by Svenonius [19], Moschovakis [13]—[15] and Vaught [20]. Other references are [1], [3]—[5], [10]—[12]. The following normal form theorem was proved by Vaught (and, in less general forms, by his predecessors).Theorem 0.1. Let L = L0(R). For every -sentence ϕ there is an L0-game sentence Θ such that ⊨′ ∃Rϕ ↔ Θ.(A word about the notations: L0(R) denotes the language obtained from L0 by adding to it the sequence R of logical symbols which do not belong to L0; “⊨′α” means that α is true in all countable models.)0.1 can be restated as follows.Theorem 0.1′. For every-sentence ϕ there is an L0-game sentence Θ such that ⊨ϕ → Θ and for any-sentence ϕ if ⊨ϕ → ϕ and L′ ⋂ L ⊆ L0, then ⊨ Θ → ϕ.(We sketch the proof of the equivalence between 0.1 and 0.1′.0.1 implies 0.1′. This is obvious once we realize that game sentences and their negations satisfy the downward Löwenheim-Skolem theorem and hence, ⊨′α is equivalent to ⊨α whenever α is a boolean combination of and game sentences.


2007 ◽  
Vol 149 (1-3) ◽  
pp. 25-39 ◽  
Author(s):  
John T. Baldwin ◽  
Paul C. Eklof ◽  
Jan Trlifaj

2019 ◽  
Vol 84 (3) ◽  
pp. 1007-1019
Author(s):  
DANUL K. GUNATILLEKA

AbstractWe continue the study of the theories of Baldwin–Shi hypergraphs from [5]. Restricting our attention to when the rank δ is rational valued, we show that each countable model of the theory of a given Baldwin–Shi hypergraph is isomorphic to a generic structure built from some suitable subclass of the original class used in the construction. We introduce a notion of dimension for a model and show that there is a an elementary chain $\left\{ {\mathfrak{M}_\beta :\beta \leqslant \omega } \right\}$ of countable models of the theory of a fixed Baldwin–Shi hypergraph with $\mathfrak{M}_\beta \preccurlyeq \mathfrak{M}_\gamma $ if and only if the dimension of $\mathfrak{M}_\beta $ is at most the dimension of $\mathfrak{M}_\gamma $ and that each countable model is isomorphic to some $\mathfrak{M}_\beta $. We also study the regular types that appear in these theories and show that the dimension of a model is determined by a particular regular type. Further, drawing on a large body of work, we use these structures to give an example of a pseudofinite, ω-stable theory with a nonlocally modular regular type, answering a question of Pillay in [11].


2013 ◽  
Vol 78 (2) ◽  
pp. 602-632 ◽  
Author(s):  
Adi Jarden ◽  
Alon Sitton

AbstractThe notion J is independent in (M, M0, N) was established by Shelah, for an AEC (abstract elementary class) which is stable in some cardinal λ and has a non-forking relation, satisfying the good λ-frame axioms and some additional hypotheses. Shelah uses independence to define dimension.Here, we show the connection between the continuity property and dimension: if a non-forking satisfies natural conditions and the continuity property, then the dimension is well-behaved.As a corollary, we weaken the stability hypothesis and two additional hypotheses, that appear in Shelah's theorem.


2019 ◽  
Vol 84 (3) ◽  
pp. 1168-1175
Author(s):  
BYUNGHAN KIM

AbstractIn this article, we prove that if a countable non-${\aleph _0}$-categorical NSOP1 theory with nonforking existence has finitely many countable models, then there is a finite tuple whose own preweight is ω. This result is an extension of a theorem of the author on any supersimple theory.


1977 ◽  
Vol 42 (3) ◽  
pp. 341-348 ◽  
Author(s):  
Małgorzata Dubiel

Let L be a countable first-order language and L(Q) be obtained by adjoining an additional quantifier Q. Q is a generalization of the quantifier “there exists uncountably many x such that…” which was introduced by Mostowski in [4]. The logic of this latter quantifier was formalized by Keisler in [2]. Krivine and McAloon [3] considered quantifiers satisfying some but not all of Keisler's axioms. They called a formula φ(x) countable-like iffor every ψ. In Keisler's logic, φ(x) being countable-like is the same as ℳ⊨┐Qxφ(x). The main theorem of [3] states that any countable model ℳ of L[Q] has an elementary extension N, which preserves countable-like formulas but no others, such that the only sets definable in both N and M are those defined by formulas countable-like in M. Suppose C(x) in M is linearly ordered and noncountable-like but with countable-like proper segments. Then in N, C will have new elements greater than all “old” elements but no least new element — otherwise it will be definable in both models. The natural question is whether it is possible to use generalized quantifiers to extend models elementarily in such a way that a noncountable-like formula C will have a minimal new element. There are models and formulas for which it is not possible. For example let M be obtained from a minimal transitive model of ZFC by letting Qxφ(x) mean “there are arbitrarily large ordinals satisfying φ”.


Sign in / Sign up

Export Citation Format

Share Document