𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A partition theorem for ordinals

✍ Scribed by Diana Schmidt


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
138 KB
Volume
27
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

Negative Partition Relations for Ordinal
✍ Carl Darby πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 177 KB

For ordinals :, ;, and #, the expression : Γ„ % ( ;, #) 2 means there is a partition of the pairs from :, [:] 2 =2 0 \_ 2 1 such that for any X :, if the order type of X is ; then [X] 2 3 2 0 and if the order type of X is # then [X] 2 3 2 1 . It is shown that if :<| 1 is multiplicatively decomposable

A Theorem on Definitions of the Zermelo-
✍ Hao Wang πŸ“‚ Article πŸ“… 1967 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

B THEOREM ON DEFINITIONS O F THE ZERMELO-NEUMANN ORDINALS'l) by HAO WANG in Cambridge, Mass. (USA)

A Quartic Key Identity for a Partition T
✍ Krishnaswami Alladi; George E. Andrews πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 144 KB

A key identity in three free parameters involving partitions into distinct parts is proved using Jackson's q-analog of Dougall's summation. This identity is shown to be combinatorially equivalent to a reformulation of a deep partition theorem of Go llnitz obtained by the use of a quartic transformat