scholarly journals COUNTABLE MODELS OF THE THEORIES OF BALDWIN–SHI HYPERGRAPHS AND THEIR REGULAR TYPES

2019 ◽  
Vol 84 (3) ◽  
pp. 1007-1019
Author(s):  
DANUL K. GUNATILLEKA
Keyword(s):  
Large Body ◽  
Countable Model ◽  
Stable Theory ◽  
Generic Structure ◽  
Elementary Chain ◽  
Regular Type ◽  
Image Position ◽  
Original Class ◽  
Countable Models

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

Generalized quantifiers and elementary extensions of countable models

1977 ◽  
Vol 42 (3) ◽  
pp. 341-348 ◽  
Author(s):  
Małgorzata Dubiel
Keyword(s):  
Countable Model ◽  
Generalized Quantifiers ◽  
Natural Question ◽  
Elementary Extension ◽  
First Order ◽  
Transitive Model ◽  
Order Language ◽  
Image Position ◽  
Countable Models

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 φ”.

On Cantor-Bendixson spectra containing (1,1). II

1985 ◽  
Vol 50 (3) ◽  
pp. 611-618 ◽  
Author(s):  
Annalisa Marcja ◽  
Carlo Toffalori
Keyword(s):  
Boolean Algebras ◽  
Stable Theory ◽  
Definable Subset ◽  
Limit Ordinal ◽  
Image Position ◽  
Countable Models

Let T be a (countable, complete, quantifier eliminable) ω-stable theory; an analysis of T, and consequently a classification of ω-stable theories, can be done by looking at the Boolean algebras B(M) of definable subsets of its countable models M (as usual, we often confuse a definable subset of M with the class of formulas defining it). If M ⊨ T, ∣M∣ = ℵ0, then, for every LM-formula ϕ(v) and for every ordinal α, we define a relation(CB = Cantor-Bendixson, of course) by induction on α:CB-rank ϕ(v) ≥ 0 if ϕ(M) ≠ ∅CB-rank ϕ(v) ≥ λ for λ a limit ordinal, if CB-rank ϕ(v) ≥ for all v < λ;CB-rank ϕ(v)≥ α + 1 if, for all n ∈ ω,(*) there are LM-formulas ϕ0(v), …, ϕn − 1(v) such thatIt is well known that the ω-stability of T implies that, for every consistent LM-formula ϕ(v), there is exactly one ordinal α < ω1 such that CB-rank ϕ(v) ≥ α and CB-rank ϕ(v)≱α + 1. Therefore we define:CB-rank ϕ(v) = αCB-degree ϕ(v) = d if d is the maximal n ∈ ω satisfying (*); andCB-type ϕ(v) = (α, d).

A note on finitely generated models

1983 ◽  
Vol 48 (1) ◽  
pp. 163-166
Author(s):  
Anand Pillay
Keyword(s):  
Countable Model ◽  
Stable Theory ◽  
Prime Model ◽  
Finitely Generated ◽  
First Order ◽  
Elementary Chain ◽  
Skolem Functions ◽  
Order Language ◽  
Finite Set

A model M (of a countable first order language) is said to be finitely generated if it is prime over a finite set, namely if there is a finite tuple ā in M such that (M, ā) is a prime model of its own theory. Similarly, if A ⊂ M, then M is said to be finitely generated overA if there is finite ā in M such that M is prime over A ⋃ ā. (Note that if Th(M) has Skolem functions, then M being prime over A is equivalent to M being generated by A in the usual sense, that is, M is the closure of A under functions of the language.) We show here that if N is ā model of an ω-stable theory, M ≺ N, M is finitely generated, and N is finitely generated over M, then N is finitely generated. A corollary is that any countable model of an ω-stable theory is the union of an elementary chain of finitely generated models. Note again that all this is trivial if the theory has Skolem functions.The result here strengthens the results in [3], where we show the same thing but assuming in addition that the theory is either nonmultidimensional or with finite αT. However the proof in [3] for the case αT finite actually shows the following which does not assume ω-stability): Let A be atomic over a finite set, tp(ā / A) have finite Cantor-Bendixson rank, and B be atomic over A ⋃ ā. Then B is atomic over a finite set.

Refinements of Vaught's normal from theorem

1979 ◽  
Vol 44 (3) ◽  
pp. 289-306 ◽  
Author(s):  
Victor Harnik
Keyword(s):  
Normal Form ◽  
Boolean Combination ◽  
Form Theorem ◽  
Central Notion ◽  
The Matrix ◽  
Normal Form Theorem ◽  
Skolem Theorem ◽  
Image Position ◽  
Countable Models

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.

scholarly journals GROUPOIDS AND RELATIVE INTERNALITY

2019 ◽  
Vol 84 (3) ◽  
pp. 987-1006
Author(s):  
LÉO JIMENEZ
Keyword(s):  
Stable Theory ◽  
Sufficient Condition ◽  
Natural Type ◽  
Image Position ◽  
Stationary Type

AbstractIn a stable theory, a stationary type $q \in S\left( A \right)$ internal to a family of partial types ${\cal P}$ over A gives rise to a type-definable group, called its binding group. This group is isomorphic to the group $Aut\left( {q/{\cal P},A} \right)$ of permutations of the set of realizations of q, induced by automorphisms of the monster model, fixing ${\cal P}\,\mathop \cup \nolimits \,A$ pointwise. In this article, we investigate families of internal types varying uniformly, what we will call relative internality. We prove that the binding groups also vary uniformly, and are the isotropy groups of a natural type-definable groupoid (and even more). We then investigate how properties of this groupoid are related to properties of the type. In particular, we obtain internality criteria for certain 2-analysable types, and a sufficient condition for a type to preserve internality.

ON THE NUMBER OF COUNTABLE MODELS OF A COUNTABLE NSOP1 THEORY WITHOUT WEIGHT ω

2019 ◽  
Vol 84 (3) ◽  
pp. 1168-1175
Author(s):  
BYUNGHAN KIM
Keyword(s):  
Image Position ◽  
Countable Models

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.

Bad models in nice neighborhoods

1986 ◽  
Vol 51 (4) ◽  
pp. 1043-1055 ◽  
Author(s):  
Terry Millar
Keyword(s):  
Linear Order ◽  
Homogeneous Model ◽  
Order Type ◽  
Saturated Model ◽  
Countable Number ◽  
Decidable Theory ◽  
Type Spectrum ◽  
Image Position ◽  
Countable Models

This paper contains an example of a decidable theory which has1) only a countable number of countable models (up to isomorphism);2) a decidable saturated model; and3) a countable homogeneous model that is not decidable.By the results in [1] and [2], this can happen if and only if the set of types realized by the homogeneous model (the type spectrum of the model) is not .If Γ and Σ are types of a theory T, define Γ ◁ Σ to mean that any model of T realizing Γ must realize Σ. In [3] a decidable theory is constructed that has only countably many countable models, only recursive types, but whose countable saturated model is not decidable. This is easy to do if the restriction on the number of countable models is lifted; the difficulty arises because the set of types must be recursively complex, and yet sufficiently related to control the number of countable models. In [3] the desired theory T is such thatis a linear order with order type ω*. Also, the set of complete types of T is not . The last feature ensures that the countable saturated model is not decidable; the first feature allows the number of countable models to be controlled.

scholarly journals ALMOST GALOIS ω-STABLE CLASSES

2015 ◽  
Vol 80 (3) ◽  
pp. 763-784 ◽  
Author(s):  
JOHN T. BALDWIN ◽  
PAUL B. LARSON ◽  
SAHARON SHELAH
Keyword(s):  
Elementary Class ◽  
Joint Embedding ◽  
Image Position ◽  
Abstract Elementary Class ◽  
Countable Models

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.

scholarly journals MINIMUM MODELS OF SECOND-ORDER SET THEORIES

2019 ◽  
Vol 84 (02) ◽  
pp. 589-620
Author(s):  
KAMERYN J. WILLIAMS
Keyword(s):  
Set Theory ◽  
Second Order ◽  
Countable Model ◽  
Main Question ◽  
Minimal Models ◽  
Transitive Model ◽  
Transfinite Recursion ◽  
Order Set ◽  
Countable Models

AbstractIn this article I investigate the phenomenon of minimum and minimal models of second-order set theories, focusing on Kelley–Morse set theory KM, Gödel–Bernays set theory GB, and GB augmented with the principle of Elementary Transfinite Recursion. The main results are the following. (1) A countable model of ZFC has a minimum GBC-realization if and only if it admits a parametrically definable global well order. (2) Countable models of GBC admit minimal extensions with the same sets. (3) There is no minimum transitive model of KM. (4) There is a minimum β-model of GB+ETR. The main question left unanswered by this article is whether there is a minimum transitive model of GB+ETR.

scholarly journals ENAYAT MODELS OF PEANO ARITHMETIC

2018 ◽  
Vol 83 (04) ◽  
pp. 1501-1511 ◽  
Author(s):  
ATHAR ABDUL-QUADER
Keyword(s):  
Linear Order ◽  
Peano Arithmetic ◽  
Countable Model ◽  
Natural Question ◽  
Conservative Extension ◽  
Image Position ◽  
Definable Elements

AbstractSimpson [6] showed that every countable model ${\cal M} \models PA$ has an expansion $\left( {{\cal M},X} \right) \models P{A^{\rm{*}}}$ that is pointwise definable. A natural question is whether, in general, one can obtain expansions of a nonprime model in which the definable elements coincide with those of the underlying model. Enayat [1] showed that this is impossible by proving that there is ${\cal M} \models PA$ such that for each undefinable class X of ${\cal M}$, the expansion $\left( {{\cal M},X} \right)$ is pointwise definable. We call models with this property Enayat models. In this article, we study Enayat models and show that a model of $PA$ is Enayat if it is countable, has no proper cofinal submodels and is a conservative extension of all of its elementary cuts. We then show that, for any countable linear order γ, if there is a model ${\cal M}$ such that $Lt\left( {\cal M} \right) \cong \gamma$, then there is an Enayat model ${\cal M}$ such that $Lt\left( {\cal M} \right) \cong \gamma$.

Sign in / Sign up

Export Citation Format

Share Document