Undefinability of κ-well-orderings in l∞κ

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

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 κ

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

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
20 (#563,761)

6 months
11 (#68,416)

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

Similar books and articles

Normality and P(Κ)/J.R. Zrotowski - 1991 - Journal of Symbolic Logic 56 (3):1064-1067.
A Recursion Principle for Linear Orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
On Ehrenfeucht-Fraïssé Equivalence of Linear Orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Strong Compactness and Stationary Sets.John Krueger - 2005 - Journal of Symbolic Logic 70 (3):767 - 777.
A Gitik Iteration with Nearly Easton Factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
On Some Small Cardinals for Boolean Algebras.Ralph Mckenzie & J. Donald Monk - 2004 - Journal of Symbolic Logic 69 (3):674-682.