# Partitioning pairs of countable ordinals

@article{Todorcevic1987PartitioningPO, title={Partitioning pairs of countable ordinals}, author={Stevo Todorcevic}, journal={Acta Mathematica}, year={1987}, volume={159}, pages={261-294} }

On montre que les paires d'ordinaux denombrables peuvent etre colorees avec une infinite non denombrable de couleurs de telle sorte que tout ensemble non denombrable contienne des paires de chaque couleur

## 245 Citations

### WALKS ON COUNTABLE ORDINALS AND SELECTIVE ULTRAFILTERS

- Mathematics
- 2010

In our previous work we have introduced filters on the set of countable ordinals as invariants to standard characteristics of walks in this domain. In this note we examine their projections to the…

### FORCING WITH A COHERENT SOUSLIN TREE

- Physics
- 2011

We investigate the effect of forcing with a coherent Souslin trees on two standard set-theoretic dichotomies and several topological chain conditions.

### Notes on Singular Cardinal Combinatorics

- MathematicsNotre Dame J. Formal Log.
- 2005

We present a survey of combinatorial set theory relevant to the study of singular cardinals and their successors. The topics covered include diamonds, squares, club guessing, forcing axioms, and PCF…

### Simultaneous reflection and impossible ideals

- MathematicsThe Journal of Symbolic Logic
- 2012

Abstract We prove that if holds for a singular cardinal μ, then any collection of fewer than cf(μ) stationary subsets of μ+ must reflect simultaneously.

### Successors of singular cardinals and coloring theorems I

- MathematicsThe Journal of Symbolic Logic
- 2009

This work continues Section 2 of [1], but now the emphasis is on finding colorings of pairs of ordinals, rather than coloring of finite sets of Ordinals.

### Weak square bracket relations for Pκ(λ)

- MathematicsJournal of Symbolic Logic
- 2008

Abstract We study the partition relation that is a weakening of the usual partition relation . Our main result asserts that if κ is an uncountable strongly compact cardinal and , then does not hold.

### Rectangular square-bracket operation for successor of regular cardinals

- Mathematics
- 2013

We give a uniform proof that λ 6→ [λ;λ]λ+ holds for every regular cardinal λ.

### Trees and Ehrenfeucht–fra Ssã E Games

- Mathematics
- 1999

Trees are natural generalizations of ordinals and this is especially apparent when one tries to nd an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of…

### Products of regular cardinals and cardinal invariants of products of Boolean algebras

- Mathematics
- 1990

We answer some questions of Monk, and give some information on others concerning cardinal invariants of Boolean algebras under ultraproducts and products.

### Weakly α-favourable measure spaces

- Mathematics
- 2000

I discuss the properties of α-favourable and weakly α-favourable measure spaces, with remarks on their relations with other classes.

## References

SHOWING 1-10 OF 19 REFERENCES

### Some Counterexamples in the Partition Calculus

- MathematicsJ. Comb. Theory, Ser. A
- 1973

### Some higher-gap examples in combinatorial set theory

- MathematicsAnn. Pure Appl. Log.
- 1987

### Partition relations for uncountable ordinals

- Mathematics
- 1975

Partition relations of the form α→(α,m)2, where α is an ordinal andm is a positive integer, are considered. Let κ be a cardinal. The following are proved: If κ is singular and 2K=K+ then…

### A graph which embeds all small graphs on any large set of vertices

- MathematicsAnn. Pure Appl. Log.
- 1988

### Regressive partition relations for infinite cardinals

- Mathematics
- 1987

The regressive partition relation, which turns out to be important in incompleteness phenomena, is completely characterized in the transfinite case. This work is related to Schmerl [SI, whose…

### Weak partition relations

- Mathematics
- 1972

The partition relation 1+x1)3 ,,, which was known to contradict the continuLlm hypothesis [1], is disproved without this hypothesis. For cardinals K>?) and 2>1, let P(K, A) be the following partition…

### Partition relations for partially ordered sets

- Mathematics
- 1985

Let P be a partially ordered set. If r<to, then [p]r denotes the set of all sequences (al . . . . . ar) such that al . . . . . arEP and al<e. . . <par. If ~' is an ordinal and if ai, i<y r are order…

### On the complete subgraphs of graphs defined by systems of sets

- Mathematics
- 1966

is a mapping from the set M into the set of all subsets of the set S . If μ E M, the image of It by the mapping (1 . 1) is Fμ . In particular, if M is a set of power m and S is an ordered set of…

### Decomposing Uncountable Squares to Countably Many Chains

- MathematicsJ. Comb. Theory, Ser. A
- 1976