Galvin's "racing pawns" game and a well-ordering of trees / [electronic resource] S. B. Grantham.
Material type:
TextSeries: Memoirs of the American Mathematical Society ; no. 316.Publication details: Providence, R.I., USA : American Mathematical Society, 1985.Description: 1 online resource (iii, 62 p. : ill.)ISBN: - 9781470407292 (online)
- 510 s 512/.7 19
- QA3 .A57 no. 316 QA248
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK12769 |
"Volume 53, number 316 (third of 5 numbers)"
Bibliography: p. 63.
1. Introduction and preliminaries 2. Galvin's original game, the restricted game, and the relations $<_R$ and $\equiv _R$ 3. The explicit strategy for finite trees and the definitions of $\overset {\rightharpoonup }{E}$ and $\overset {\rightharpoonup }{F}$ 4. The explicit strategy for infinite trees and the characterization of $<_R$ and $\equiv _R$ in terms of $\overset {\rightharpoonup }{E}$ and $\overset {\rightharpoonup }{F}$ 5. The structure of the $\overset {\rightharpoonup }{E}$ and $\overset {\rightharpoonup }{F}$ sequences 6. The relationship between $\overset {\rightharpoonup }{F}(X)$ and $\operatorname {rank}(X)$ 7. The main theorem: Order types under $<_R$ 8. Epilogue: Two variants of Galvin's game
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record.
There are no comments on this title.