Undefinability of κ-well-orderings in l∞κ

Journal of Symbolic Logic 62 (3):999 - 1020 (1997)
  Copy   BIBTEX

Abstract

We prove that the class of trees with no branches of cardinality ≥κ is not RPC definable in L ∞κ when κ is regular. Earlier such a result was known for L κ + κ under the assumption $\kappa^{ . Our main result is actually proved in a stronger form which covers also L ∞λ (and makes sense there) for every strong limit cardinal $\lambda > \kappa$ of cofinality κ

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
30 (#550,560)

6 months
10 (#308,654)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A new approach to infinitary languages.J. Hintikka - 1976 - Annals of Mathematical Logic 10 (1):95.
Relative separation theorems for $\scr L_{\kappa+\kappa}$.Heikki Tuuri - 1992 - Notre Dame Journal of Formal Logic 33 (3):383-401.
Large Infinitary Languages. Model Theory.Michael Makkai - 1978 - Journal of Symbolic Logic 43 (1):144-145.

Add more references