No label defined (Q3973039)

[For the entire collection see Zbl 0721.00028.] This lecture provided a brief introduction to number theory, treating numbers as a special case of (combinatorial) games. It begins by describing two classical methods of constructing numbers (Dedekind's cuts and Cantor's infinite ordinals), then showing how to generalize both methods simultaneously by imposing a simple ordering condition on games. It proceeds to demonstrate the methods by which it can be shown that the (proper) class of numbers is an ordered field. The style is terse, and it is essential to work the examples (the transfinite ones are a bit difficult to do in one's head) to understand the text. For an introduction in similar style to game theory, see \textit{R. K. Guy's} contribution to this volume [ibid., 1-21 (1991; Zbl 0739.90079)].