No CrossRef data available.
Article contents
The two-cardinal problem for languages of arbitrary cardinality
Published online by Cambridge University Press: 12 March 2014
Abstract
Let ℒ be a first-order language of cardinality κ++ with a distinguished unary predicate symbol U. In this paper we prove, working on L, the two cardinal transfer theorem (κ+,κ) ⇒ (κ++, κ+) for this language. This problem was posed by Chang and Keisler more than twenty years ago.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2010
References
REFERENCES
[Chang65]Chang, C. C., A note on the two-cardinal problem, Proceedings of the American Mathematical Society, vol. 16 (1965), pp. 1148–1155.CrossRefGoogle Scholar
[Don81]Donder, H. D., Coarse morasses in L, Lecture Notes in Mathematics, vol. 872, Springer-Verlag, 1981.Google Scholar
[Jen72]Jensen, R. B., The fine structure of the constructible hierarchy, Annals of Mathematical Logic, vol. 4 (1972), pp. 229–308.CrossRefGoogle Scholar
[JenKar]Jensen, R. B. and Karp, C., Primitive recursive set functions, Axiomatic set theory (Scott, D., editor), Proceedings of Symposia in Pure Mathematics, vol. 13, American Mathematical Society, 1971, pp. 143–167.CrossRefGoogle Scholar
[KenSh02]Kennedy, J. and Shelah, S., On regular reduced products, this Journal, vol. 67 (2002), pp. 1169–1177.Google Scholar
[Vill06]Villegas-Silva, L. M., A gap-1 transfer theorem, Mathematical Logic Quarterly, vol. 52 (2006), no. 4, pp. 340–350.CrossRefGoogle Scholar