Diverse classes

Journal of Symbolic Logic 54 (3):875-893 (1989)
Abstract
Let $\mathbf{I}(\mu,K)$ denote the number of nonisomorphic models of power $\mu$ and $\mathbf{IE}(\mu,K)$ the number of nonmutually embeddable models. We define in this paper the notion of a diverse class and use it to prove a number of results. The major result is Theorem B: For any diverse class $K$ and $\mu$ greater than the cardinality of the language of $K$, $\mathbf{IE}(\mu,K) \geq \min(2^\mu,\beth_2).$ From it we deduce both an old result of Shelah, Theorem C: If $T$ is countable and $\lambda_0 > \aleph_0$ then for every $\mu > \aleph_0,\mathbf{IE}(\mu,T) \geq \min(2^\mu,\beth_2)$, and an extension of that result to uncountable languages, Theorem D: If $|T| < 2^\omega,\lambda_0 > |T|$, and $|D(T)| = |T|$ then for $\mu > |T|$, $\mathbf{IE}(\mu,T) \geq \min(2^\mu,\beth_2).$
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274749
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,133
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
2 ( #786,991 of 2,191,806 )

Recent downloads (6 months)
1 ( #290,783 of 2,191,806 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature