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: 93,990

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

Possible PCF algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):313-317.
Order types of free subsets.Heike Mildenberger - 1997 - Annals of Pure and Applied Logic 89 (1):75-83.
On series of ordinals and combinatorics.James P. Jones, Hilbert Levitz & Warren D. Nichols - 1997 - Mathematical Logic Quarterly 43 (1):121-133.
The model N = ∪ {L[A]: A countable set of ordinals}.Claude Sureson - 1987 - Annals of Pure and Applied Logic 36:289-313.
Iterated local reflection versus iterated consistency.Lev Beklemishev - 1995 - Annals of Pure and Applied Logic 75 (1-2):25-48.
Trees and Ehrenfeucht–Fraı̈ssé games.Jouko Väänänen & Stevo Todorcevic - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.

Analytics

Added to PP
2013-12-18

Downloads
28 (#557,911)

6 months
8 (#505,340)

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