Let ? be a first-order language of cardinality k~(++) with a distinguished unary predicate symbol U. In this paper we prove, working on L, the two cardinal transfer theorem (K~+, K) ? (K ~(++),K~+) for this language. This problem was posed by Chang and Keisler more than twenty years ago.
展开▼
