Transfering saturation, the finite cover property, and stability

Journal of Symbolic Logic 64 (2):678-684 (1999)
$\underline{\text{Saturation is} (\mu, \kappa)-\text{transferable in} T}$ if and only if there is an expansion T 1 of T with ∣ T 1 ∣ = ∣ T ∣ such that if M is a μ-saturated model of T 1 and ∣ M ∣ ≥ κ then the reduct M ∣ L(T) is κ-saturated. We characterize theories which are superstable without f.c.p., or without f.c.p. as, respectively those where saturation is (ℵ 0 , λ)- transferable or (κ (T), λ)-transferable for all λ. Further if for some $\mu \geq \mid T \mid, 2^\mu > \mu^+$ , stability is equivalent to for all μ ≥ ∣ T ∣, saturation is (μ, 2 μ )- transferable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586492
 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: 23,674
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.

Add more references

Citations of this work BETA
John T. Baldwin (2006). The Metamathematics of Random Graphs. Annals of Pure and Applied Logic 143 (1):20-28.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #380,552 of 1,903,042 )

Recent downloads (6 months)

1 ( #446,009 of 1,903,042 )

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.