A short proof of a partition theorem for the ordinal omega ω

Annals of Mathematical Logic 6 (2):129 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(73)90006-5

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
An Ordinal Partition Avoiding Pentagrams.Jean Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
On a result of Szemerédi.Albin L. Jones - 2008 - Journal of Symbolic Logic 73 (3):953-956.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
Weak partition properties on trees.Michael Hrušák, Petr Simon & Ondřej Zindulka - 2013 - Archive for Mathematical Logic 52 (5-6):543-567.
Effective Versions of Ramsey's Theorem: Avoiding the Cone Above $\mathbf{0}$'.Tamara Lakins Hummel - 1994 - Journal of Symbolic Logic 59 (4):1301-1325.
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. [REVIEW]Andreas Weiermann - 1995 - Archive for Mathematical Logic 34 (5):313-330.
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Some Results in the Partition Calculus.Albin Lee Jones - 1999 - Dissertation, Dartmouth College
The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
A short proof of reny's existence theorem for payoff secure games.Pavlo Prokopovych - unknown
Exact upper bounds and their uses in set theory.Menachem Kojman - 1998 - Annals of Pure and Applied Logic 92 (3):267-282.
A proof of Hechler's theorem on embedding \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\aleph_1$\end{document}-directed sets cofinally into \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $(\omega^\omega,<^*)$\end{document}. [REVIEW]Maxim R. Burke - 1997 - Archive for Mathematical Logic 36 (6):399-403.
Scattered and hereditarily irresolvable spaces in modal logic.Guram Bezhanishvili & Patrick J. Morandi - 2010 - Archive for Mathematical Logic 49 (3):343-365.

Analytics

Added to PP
2014-01-17

Downloads
15 (#952,403)

6 months
4 (#798,550)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A formalised theorem in the partition calculus.Lawrence C. Paulson - 2024 - Annals of Pure and Applied Logic 175 (1):103246.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.

Add more citations

References found in this work

No references found.

Add more references