Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T05:33:01.092Z Has data issue: false hasContentIssue false

The two-cardinal problem for languages of arbitrary cardinality

Published online by Cambridge University Press:  12 March 2014

Luis Miguel
Affiliation:
Departamento de Matemáticas, Universidad Autónoma Metropolitana Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, Iztapalapa, 09340 D.F., México. E-mail: lmvs@xanum.uam.mx
Villegas Silva
Affiliation:
Departamento de Matemáticas, Universidad Autónoma Metropolitana Iztapalapa, Av. San Rafael Atlixco 186, Col. Vicentina, Iztapalapa, 09340 D.F., México. E-mail: lmvs@xanum.uam.mx

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable