ORPP logo

Galvin's Racing Pawns Game and a Well-Ordering of Trees.

Grantham, Stephen B.

Galvin's Racing Pawns Game and a Well-Ordering of Trees. - 1st ed. - 1 online resource (73 pages) - Memoirs of the American Mathematical Society ; v.53 . - Memoirs of the American Mathematical Society .

Intro -- Table of Contents -- 1. Introduction and Preliminaries -- 2. Galvin's Original Game, the Restricted Game, and the Relations < -- [sub(R)] and ≡[sub(R)] -- 3. The Explicit Strategy for Finite Trees and the Definitions of E and F -- 4. The Explicit Strategy for Infinite Trees and the Characterization of< -- [sub(R)] and ≡[sub(R)] in Terms of E and F -- 5. The Structure of the E and F Sequences -- 6. The Relationship Between F(x) and Rank(x) -- 7. The Main Theorem: Order Types Under < -- [sub(R)] -- 8. Epilogue: Two Variants of Galvin's Game.

9781470407292


Transfinite numbers.
Trees (Graph theory).
Ordered sets.
Game theory.


Electronic books.

QA248 -- .G736 1985eb

512/.7

© 2024 Resource Centre. All rights reserved.