Grantham, Stephen B. <br/><br/>
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 .
<br/><br/>Intro -- Table of Contents -- 1. Introduction and Preliminaries -- 2. Galvin's Original Game, the Restricted Game, and the Relations &lt -- [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&lt -- [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 &lt -- [sub(R)] -- 8. Epilogue: Two Variants of Galvin's Game. 
<br/><br/><label>ISBN: </label>9781470407292 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Transfinite numbers.<br/>Trees (Graph theory).<br/>Ordered sets.<br/>Game theory.
<br/><br/><label>Index Terms--Genre/Form: </label><br/>Electronic books.
<br/><br/><label>LC Class. No.: </label>QA248 -- .G736 1985eb 
<br/><br/><label>Dewey Class. No.: </label>512/.7