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

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.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.