The spectrum of resplendency

Journal of Symbolic Logic 55 (2):626-636 (1990)
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^\lambda,\beth_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 κ
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 13,009
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #288,904 of 1,410,123 )

Recent downloads (6 months)

1 ( #177,589 of 1,410,123 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.