On strongly minimal sets

1971 ◽  
Vol 36 (1) ◽  
pp. 79-96 ◽  
Author(s):  
J. T. Baldwin ◽  
A. H. Lachlan
Keyword(s):  
Categorical Theory ◽  
Minimal Sets ◽  
Countable Models

The purpose of this paper is twofold. In §1 and §2 which are largely expository we develop the known theory of ℵ1-categoricity in terms of strongly minimal sets. In §3 we settle affirmatively Vaught's conjecture that a complete ℵ1-categorical theory has either just one or just ℵ0 countable models, and in §4 we present an example which serves to illustrate the ideas of §3.As far as we know the only work published on strongly minimal sets is that of Marsh [3]. The present exposition goes beyond [3] in showing that any ℵ-categorical theory has a principal extension in which some formula is strongly minimal.

On theories having a finite number of nonisomorphic countable models

1985 ◽  
Vol 50 (3) ◽  
pp. 806-808 ◽  
Author(s):  
Akito Tsuboi
Keyword(s):  
Finite Number ◽  
Positive Solutions ◽  
Linear Order ◽  
Order Property ◽  
Categorical Theory ◽  
Base Theory ◽  
Almost All ◽  
Countable Models

In this paper we shall state some interesting facts concerning non-ω-categorical theories which have only finitely many countable models. Although many examples of such theories are known, almost all of them are essentially the same in the following sense: they are obtained from ω-categorical theories, called base theories below, by adding axioms for infinitely many constant symbols. Moreover all known base theories have the (strict) order property in the sense of [6], and so they are unstable. For example, Ehrenfeucht's well-known example which has three countable models has the theory of dense linear order as its base theory.Many papers including [4] and [5] are motivated by the conjecture that every non-ω-categorical theory with a finite number of countable models has the (strict) order property, but this conjecture still remains open. (Of course there are partial positive solutions. For example, in [4], Pillay showed that if such a theory has few links (see [1]), then it has the strict order property.) In this paper we prove the instability of the base theory T0 of such a theory T rather that T itself. Our main theorem is a strengthening of the following which is also our result: if a theory T0 is stable and ω-categorical, then T0 cannot be extended to a theory T which has n countable models (1 < n < ω) by adding axioms for constant symbols.

Number of countable models

1978 ◽  
Vol 43 (3) ◽  
pp. 492-496 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Finite Number ◽  
Complete Theory ◽  
Prime Model ◽  
Categorical Theory ◽  
Definable Subset ◽  
Algebraic Elements ◽  
Minimal Prime ◽  
Countable Theory ◽  
The Universe ◽  
Countable Models

We prove that a countable complete theory whose prime model has an infinite definable subset, all of whose elements are named, has at least four countable models up to isomorphism. The motivation for this is the conjecture that a countable theory with a minimal model has infinitely many countable models. In this connection we first prove that a minimal prime model A has an expansion by a finite number of constants A′ such that the set of algebraic elements of A′ contains an infinite definable subset.We note that our main conjecture strengthens the Baldwin–Lachlan theorem. We also note that due to Vaught's result that a countable theory cannot have exactly two countable models, the weakest possible nontrivial result for a non-ℵ0-categorical theory is that it has at least four countable models.§1. Notation and preliminaries. Our notation follows Chang and Keisler [1], except that we denote models by A, B, etc. We use the same symbol to refer to the universe of a model. Models we refer to are always in a countable language. For T a countable complete theory we let n(T) be the number of countable models of T up to isomorphism. ∃n means ‘there are exactly n’.

The classification of small weakly minimal sets. II

1988 ◽  
Vol 53 (2) ◽  
pp. 625-635 ◽  
Author(s):  
Steven Buechler
Keyword(s):  
Stable Theory ◽  
Minimal Set ◽  
Minimal Sets ◽  
Finite Set ◽  
Unidimensional Theory ◽  
The Universe ◽  
Countable Models

AbstractThe main result is Vaught's conjecture for weakly minimal, locally modular and non-ω-stable theories. The more general results yielding this are the following.Theorem A. Suppose that T is a small unidimensional theory and D is a weakly minimal set, definable over the finite set B. Then for all finite A ⊂ D there are only finitely many nonalgebraic strong types over B realized in acl(A) ∩ D.Theorem B. Suppose that T is a small, unidimensional, non-ω-stable theory such that the universe is weakly minimal and locally modular. Then for all finite A there is a finite B ⊂ cl(A) such that a ∈ cl(A) iff a ∈ cl(b) for some b ∈ B.Recall the property (S) defined in the abstract of [B1].Theorem C. Let T be as in Theorem B. Then, if T does not satisfy (S), T hasmany countable models.Combining Theorem C and the results in [B1] we obtain Vaught's conjecture for such theories.

scholarly journals Minimal F2-flows

1985 ◽  
Vol 39 (2) ◽  
pp. 187-193
Author(s):  
Daniel Berend
Keyword(s):  
Hausdorff Dimension ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Affine Transformations ◽  
Dimensional Torus ◽  
Minimal Sets ◽  
Necessary And Sufficient

AbstractLet σ be an ergodic endomorphism of the r–dimensional torus and Π a semigroup generated by two affine transformations lying above σ. We show that the flow defined by Π admits minimal sets of positive Hausdorff dimension and we give necessary and sufficient conditions for this flow to be minimal.

Invariant Radon measures and minimal sets for subgroups of Homeo+(R)

2020 ◽  
Vol 285 ◽  
pp. 107378
Author(s):  
Hui Xu ◽  
Enhui Shi ◽  
Yiruo Wang
Keyword(s):  
Radon Measures ◽  
Minimal Sets

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.

Sign in / Sign up

Export Citation Format

Share Document