𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Register computations on ordinals

✍ Scribed by Peter Koepke; Ryan Siders

Book ID
105842305
Publisher
Springer
Year
2008
Tongue
English
Weight
238 KB
Volume
47
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ordinal computations
Ordinal computations
✍ KOEPKE, PETER; KOERWIEN, MARTIN πŸ“‚ Article πŸ“… 2006 πŸ› Cambridge University Press 🌐 English βš– 570 KB
On Moschovakis Closure Ordinals
On Moschovakis Closure Ordinals
✍ Jon Barwise πŸ“‚ Article πŸ“… 1977 πŸ› Association for Symbolic Logic 🌐 English βš– 170 KB
On Closed Sets of Ordinals
On Closed Sets of Ordinals
✍ Harvey Friedman πŸ“‚ Article πŸ“… 1974 πŸ› American Mathematical Society 🌐 English βš– 136 KB
On Series of Ordinals and Combinatorics
On Series of Ordinals and Combinatorics
✍ James P. Jones; Hilbert Levitz; Warren D. Nichols πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 660 KB

## Abstract This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well‐known that for finite ordinals βˆ‘~bT<Ξ±Ξ²~ is the number of 2‐element subsets of an α‐element set. It is shown here that for any well‐ordered set of arbitrary infinite order t