Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T05:32:42.004Z Has data issue: false hasContentIssue false

On atomic or saturated sets

Published online by Cambridge University Press:  12 March 2014

Ludomir Newelski*
Affiliation:
Impan, ul. Kopernika 18, 51-617 Wrocław, Poland, E-mail: newelski@math.uni.wroc.pl

Abstract

Assume T is stable, small and Φ(x) is a formula of L(T). We study the impact on T⌈Φ of naming finitely many elements of a model of T. We consider the cases of T⌈Φ which is ω-stable or superstable of finite rank. In these cases we prove that if T has countable models and Q = Φ(M) is countable and atomic or saturated, then any good type in S(Q) is τ-stable. If T⌈Φ is ω-stable and (bounded, 1-based or of finite rank) with , then we prove that every good p ∈ S(Q) is τ-stable for any countable Q. The proofs of these results lead to several new properties of small stable theories, particularly of types of finite weight in such theories.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable