On Cohen and Gandy–Harrington forcing over countable models

2008 ◽  
pp. 223-229
Author(s):  
Vladimir Kanovei
Keyword(s):  
Countable Models

Remarks on weak notions of saturation in models of Peano arithmetic

1987 ◽  
Vol 52 (1) ◽  
pp. 129-148 ◽  
Author(s):  
Matt Kaufmann ◽  
James H. Schmerl
Keyword(s):  
Peano Arithmetic ◽  
Saturated Model ◽  
Simple Extension ◽  
Minimal Models ◽  
Recursively Saturated ◽  
Countable Models

This paper is a sequel to our earlier paper [2] entitled Saturation and simple extensions of models of Peano arithmetic. Among other things, we will answer some of the questions that were left open there. In §1 we consider the question of whether there are lofty models of PA which have no recursively saturated, simple extensions. We are still unable to answer this question; but we do show in that section that these models are precisely the lofty models which are not recursively saturated and which are κ-like for some regular κ. In §2 we use diagonal methods to produce minimal models of PA in which the standard cut is recursively definable, and other minimal models in which the standard cut is not recursively definable. In §3 we answer two questions from [2] by exhibiting countable models of PA which, in the terminology of this paper, are uniformly ω-lofty but not continuously ω-lofty and others which are continuously ω-lofty but not recursively saturated. We also construct a model (assuming ◇) which is not recursively saturated but every proper, simple cofinal extension of which is ℵ1-saturated. Finally, in §4 we answer another question from [2] by proving that for regular κ ≥ ℵ1; every κ-saturated model of PA has a κ-saturated proper, simple extension which is not κ+-saturated.Our notation and terminology are quite standard. Anything unfamiliar to the reader and not adequately denned here is probably defined in §1 of [2]. All models considered are models of Peano arithmetic.

Theories with a Countable Set of Countable Models

2000 ◽  
pp. 141-165
Author(s):  
Yuri L. Ershov ◽  
Sergei S. Goncharov
Keyword(s):  
Countable Models

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

Why some people are excited by Vaught's conjecture

1985 ◽  
Vol 50 (4) ◽  
pp. 973-982 ◽  
Author(s):  
Daniel Lascar
Keyword(s):  
Model Theory ◽  
Continuum Hypothesis ◽  
Complete Theory ◽  
Scott Sentences ◽  
Countable Theory ◽  
The Continuum ◽  
Countable Models

§I. In 1961, R. L. Vaught ([V]) asked if one could prove, without the continuum hypothesis, that there exists a countable complete theory with exactly ℵ1 isomorphism types of countable models. The following statement is known as Vaught conjecture:Let T be a countable theory. If T has uncountably many countable models, then T hascountable models.More than twenty years later, this question is still open. Many papers have been written on the question: see for example [HM], [M1], [M2] and [St]. In the opinion of many people, it is a major problem in model theory.Of course, I cannot say what Vaught had in mind when he asked the question. I just want to explain here what meaning I personally see to this problem. In particular, I will not speak about the topological Vaught conjecture, which is quite another issue.I suppose that the first question I shall have to face is the following: “Why on earth are you interested in the number of countable models—particularly since the whole question disappears if we assume the continuum hypothesis?” The answer is simply that I am not interested in the number of countable models, nor in the number of models in any cardinality, as a matter of fact. An explanation is due here; it will be a little technical and it will rest upon two names: Scott (sentences) and Morley (theorem).

Sign in / Sign up

Export Citation Format

Share Document