Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-19T04:49:14.851Z Has data issue: false hasContentIssue false

The spectrum of resplendency

Published online by Cambridge University Press:  12 March 2014

John T. Baldwin*
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinoisat Chicago, Chicago, Illinois 60680

Abstract

Let T be a complete countable first order theory and λ an uncountable cardinal. Theorem 1. If T is not superstable, T has 2λ resplendent models of power λ. Theorem 2. If T is strictly superstable, then T has at least min(2λ, ℶ2) resplendent models of power λ. Theorem 3. If T is not superstable or is small and strictly superstable, then every resplendent homogeneous model of T is saturated. Theorem 4 (with Knight). For each μ ∈ ω ∪ {ω, 2ω} there is a recursive theory in a finite language which has μ resplendent models of power κ for every infinite κ.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1990

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