#### How to Order

For AMS eBook frontlist subscriptions or backfile collection purchases:

2. Complete and sign the license agreement.

3. Email, fax, or send via postal mail to:

Customer Services
American Mathematical Society
201 Charles Street Providence, RI 02904-2294  USA
Phone: 1-800-321-4AMS (4267)
Fax: 1-401-455-4046
Email: cust-serv@ams.org

Visit the AMS Bookstore for individual volume purchases.

# memo_has_moved_text();Galvin’s “racing pawns” game and a well-ordering of trees

S. B. Grantham

Publication: Memoirs of the American Mathematical Society
Publication Year 1985: Volume 53, Number 316
ISBNs: 978-0-8218-2317-0 (print); 978-1-4704-0729-2 (online)
DOI: http://dx.doi.org/10.1090/memo/0316
MathSciNet review: 776346
MSC (1991): Primary 04A20; Secondary 03E05, 05C05, 06A10, 90D05

View full volume PDF

View other years and numbers:

• 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$