A short proof of a partition theorem for
✍
Jean A. Larson
📂
Article
📅
1973
🏛
Elsevier Science
⚖ 716 KB
An ordinal a is equal to the set of its predecessors and is ordered by the membership relation. For any ordinal a, one writes a -~ (a, m) 2 if and only if for any set A order-isomorphic to a, and any function f from the pairs of elements of A into {0, 1}, either there is a subset X c\_ A order-isomo