An ordinal partition avoiding pentagrams

Journal of Symbolic Logic 65 (3):969-978 (2000)
  Copy   BIBTEX

Abstract

Suppose that α = γ + δ where $\gamma \geq \delta > 0$ . Then there is a graph G = (ω ω α ,E) which has no independent set of order type ω ω α and has no pentagram (a pentagram is a set of five points with all pairs joined by edges). In the notation of Erdos and Rado, who generalized Ramsey's Theorem to this setting, $\omega^{\omega^\alpha} \nrightarrow (\omega^{\omega^\alpha},5)^2.$

Links

PhilArchive



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

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

An Ordinal Partition Avoiding Pentagrams.Jean Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Rekursion über Dilatoren und die Bachmann-Hierarchie.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (1):57-73.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
The amalgamation spectrum.John T. Baldwin, Alexei Kolesnikov & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (3):914-928.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Supplements of bounded permutation groups.Stephen Bigelow - 1998 - Journal of Symbolic Logic 63 (1):89-102.
Locally countable models of Σ1-separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.

Analytics

Added to PP
2009-01-28

Downloads
38 (#116,676)

6 months
15 (#941,355)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.

Add more citations

References found in this work

Add more references