Countable partition ordinals

Annals of Pure and Applied Logic 161 (10):1195-1215 (2010)
  Copy   BIBTEX

Abstract

The structure of ordinals of the form ωωβ for countable β is studied. The main result is:Theorem 1If β<ω1 is the sum of one or two indecomposable ordinals, thenωωβ→2. Also an example is given to show that α→2 need not imply α→2 for all n<ω

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

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

Through your library

Similar books and articles

Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
Ramsey Theory for Countable Binary Homogeneous Structures.Jean A. Larson - 2005 - Notre Dame Journal of Formal Logic 46 (3):335-352.
Possible PCF algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):313-317.
The reals in core models.Philip Welch - 1987 - Journal of Symbolic Logic 52 (1):64-67.
Some remarks on the partition calculus of ordinals.Péter Komjáth - 1999 - Journal of Symbolic Logic 64 (2):436-442.
Reflection and partition properties of admissible ordinals.Evangelos Kranakis - 1982 - Annals of Mathematical Logic 22 (3):213-242.
Elementary extensions of countable models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (1):139-145.
A comparison of two systems of ordinal notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.

Analytics

Added to PP
2013-12-18

Downloads
28 (#571,386)

6 months
8 (#365,731)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.

Add more references