Surreal number
In mathematics, the surreal number system is a totally ordered class containing the real numbers as well as infinite and infinitesimal numbers, respectively larger or smaller in absolute value than any positive real number. The surreals share many properties with the reals, including the usual arithmetic operations (addition, subtraction, multiplication, and division); as such, they form an ordered field.^{[a]} If formulated in Von Neumann–Bernays–Gödel set theory, the surreal numbers are the largest possible ordered field; all other ordered fields, such as the rationals, the reals, the rational functions, the LeviCivita field, the superreal numbers, and the hyperreal numbers, can be realized as subfields of the surreals.^{[1]} It has also been shown (in Von Neumann–Bernays–Gödel set theory) that the maximal class hyperreal field is isomorphic to the maximal class surreal field; in theories without the axiom of global choice, this need not be the case, and in such theories it is not necessarily true that the surreals are the largest ordered field. The surreals also contain all transfinite ordinal numbers; the arithmetic on them is given by the natural operations.
In 1907 Hahn introduced Hahn series as a generalization of formal power series, and Hausdorff introduced certain ordered sets called η_{α}sets for ordinals α and asked if it was possible to find a compatible ordered group or field structure. In 1962 Alling used a modified form of Hahn series to construct such ordered fields associated to certain ordinals α, and taking α to be the class of all ordinals in his construction gives a class that is an ordered field isomorphic to the surreal numbers.^{[2]} Research on the go endgame by John Horton Conway led to another definition and construction of the surreal numbers.^{[3]} Conway's construction was introduced in Donald Knuth's 1974 book Surreal Numbers: How Two ExStudents Turned on to Pure Mathematics and Found Total Happiness. In his book, which takes the form of a dialogue, Knuth coined the term surreal numbers for what Conway had called simply numbers. Conway later adopted Knuth's term, and used surreals for analyzing games in his 1976 book On Numbers and Games.
Contents
 1 Overview
 2 Construction
 3 Arithmetic
 4 Infinity
 5 Gaps and continuity
 6 Transfinite induction
 7 Powers of ω
 8 Exponential function
 9 Surcomplex numbers
 10 Games
 11 Application to combinatorial game theory
 12 Alternative realizations
 13 Relation to hyperreals
 14 See also
 15 Notes
 16 References
 17 Further reading
 18 External links
Overview
In the Conway construction,^{[4]} the surreal numbers are constructed in stages, along with an ordering ≤ such that for any two surreal numbers a and b either a ≤ b or b ≤ a. (Both may hold, in which case a and b are equivalent and denote the same number.) Numbers are formed by pairing subsets of numbers already constructed: given subsets L and R of numbers such that all the members of L are strictly less than all the members of R, then the pair { L  R } represents a number intermediate in value between all the members of L and all the members of R.
Different subsets may end up defining the same number: { L  R } and { L′  R′ } may define the same number even if L ≠ L′ and R ≠ R′. (A similar phenomenon occurs when rational numbers are defined as quotients of integers: 1/2 and 2/4 are different representations of the same rational number.) So strictly speaking, the surreal numbers are equivalence classes of representations of form { L  R } that designate the same number.
In the first stage of construction, there are no previously existing numbers so the only representation must use the empty set: {  }. This representation, where L and R are both empty, is called 0. Subsequent stages yield forms like
 { 0  } = 1
 { 1  } = 2
 { 2  } = 3
and
 {  0 } = −1
 {  −1 } = −2
 {  −2 } = −3
The integers are thus contained within the surreal numbers. (The above identities are definitions, in the sense that the righthand side is a name for the lefthand side. That the names are actually appropriate will be evident when the arithmetic operations on surreal numbers are defined, as in the section below). Similarly, representations such as
 { 0  1 } = 1/2
 { 0  1/2 } = 1/4
 { 1/2  1 } = 3/4
arise, so that the dyadic rationals (rational numbers whose denominators are powers of 2) are contained within the surreal numbers.
After an infinite number of stages, infinite subsets become available, so that any real number a can be represented by { L_{a}  R_{a} }, where L_{a} is the set of all dyadic rationals less than a and R_{a} is the set of all dyadic rationals greater than a (reminiscent of a Dedekind cut). Thus the real numbers are also embedded within the surreals.
There are also representations like
 { 0, 1, 2, 3, …  } = ω
 { 0  1, 1/2, 1/4, 1/8, … } = ε
where ω is a transfinite number greater than all integers and ε is an infinitesimal greater than 0 but less than any positive real number. Moreover, the standard arithmetic operations (addition, subtraction, multiplication, and division) can be extended to these nonreal numbers in a manner that turns the collection of surreal numbers into an ordered field, so that one can talk about 2ω or ω − 1 and so forth.
Construction
Surreal numbers are constructed inductively as equivalence classes of pairs of sets of surreal numbers, restricted by the condition that each element of the first set is smaller than each element of the second set. The construction consists of three interdependent parts: the construction rule, the comparison rule and the equivalence rule.
Forms
A form is a pair of sets of surreal numbers, called its left set and its right set. A form with left set L and right set R is written { L  R }. When L and R are given as lists of elements, the braces around them are omitted.
Either or both of the left and right set of a form may be the empty set. The form { { }  { } } with both left and right set empty is also written {  }.
Numeric forms
Construction Rule
 A form { L  R } is numeric if the intersection of L and R is the empty set and each element of R is greater than every element of L, according to the order relation ≤ given by the comparison rule below.
Equivalence classes of numeric forms
The numeric forms are placed in equivalence classes; each such equivalence class is a surreal number. The elements of the left and right set of a form are drawn from the universe of the surreal numbers (not of forms, but of their equivalence classes).
Equivalence Rule
 Two numeric forms x and y are forms of the same number (lie in the same equivalence class) if and only if both x ≤ y and y ≤ x.
An ordering relationship must be antisymmetric, i.e., it must have the property that x = y (i. e., x ≤ y and y ≤ x are both true) only when x and y are the same object. This is not the case for surreal number forms, but is true by construction for surreal numbers (equivalence classes).
The equivalence class containing {  } is labeled 0; in other words, {  } is a form of the surreal number 0.
Order
The recursive definition of surreal numbers is completed by defining comparison:
Given numeric forms x = { X_{L}  X_{R} } and y = { Y_{L}  Y_{R} }, x ≤ y if and only if:
 there is no x_{L} ∈ X_{L} such that y ≤ x_{L} (every element in the left part of x is smaller than y), and
 there is no y_{R} ∈ Y_{R} such that y_{R} ≤ x (every element in the right part of y is bigger than x).
A comparison y ≤ c between a form y and a surreal number c is performed by choosing a form z from the equivalence class c and evaluating y ≤ z; and likewise for c ≤ x and for comparison b ≤ c between two surreal numbers.
Induction
This group of definitions is recursive, and requires some form of mathematical induction to define the universe of objects (forms and numbers) that occur in them. The only surreal numbers reachable via finite induction are the dyadic fractions; a wider universe is reachable given some form of transfinite induction.
Induction Rule
 There is a generation S_{0} = { 0 }, in which 0 consists of the single form {  }.
 Given any ordinal number n, the generation S_{n} is the set of all surreal numbers that are generated by the construction rule from subsets of .
The base case is actually a special case of the induction rule, with 0 taken as a label for the "least ordinal". Since there exists no S_{i} with i < 0, the expression is the empty set; the only subset of the empty set is the empty set, and therefore S_{0} consists of a single surreal form {  } lying in a single equivalence class 0.
For every finite ordinal number n, S_{n} is wellordered by the ordering induced by the comparison rule on the surreal numbers.
The first iteration of the induction rule produces the three numeric forms {  0 } < {  } < { 0  } (the form { 0  0 } is nonnumeric because 0≤0). The equivalence class containing { 0  } is labeled 1 and the equivalence class containing {  0 } is labeled −1. These three labels have a special significance in the axioms that define a ring; they are the additive identity (0), the multiplicative identity (1), and the additive inverse of 1 (−1). The arithmetic operations defined below are consistent with these labels.
For every i < n, since every valid form in S_{i} is also a valid form in S_{n}, all of the numbers in S_{i} also appear in S_{n} (as supersets of their representation in S_{i}). (The set union expression appears in our construction rule, rather than the simpler form S_{n1}, so that the definition also makes sense when n is a limit ordinal.) Numbers in S_{n} that are a superset of some number in S_{i} are said to have been inherited from generation i. The smallest value of α for which a given surreal number appears in S_{α} is called its birthday. For example, the birthday of 0 is 0, and the birthday of −1 is 1.
A second iteration of the construction rule yields the following ordering of equivalence classes:
 {  −1 } = {  −1, 0 } = {  −1, 1 } = {  −1, 0, 1 }
 < {  0 } = {  0, 1 }
 < { −1  0 } = { −1  0, 1 }
 < {  } = { −1  } = {  1 } = { −1  1 }
 < { 0  1 } = { −1, 0  1 }
 < { 0  } = { −1, 0  }
 < { 1  } = { 0, 1  } = { −1, 1  } = { −1, 0, 1  }
Comparison of these equivalence classes is consistent, irrespective of the choice of form. Three observations follow:
 S_{2} contains four new surreal numbers. Two contain extremal forms: {  −1, 0, 1 } contains all numbers from previous generations in its right set, and { −1, 0, 1  } contains all numbers from previous generations in its left set. The others have a form that partitions all numbers from previous generations into two nonempty sets.
 Every surreal number x that existed in the previous "generation" exists also in this generation, and includes at least one new form: a partition of all numbers other than x from previous generations into a left set (all numbers less than x) and a right set (all numbers greater than x).
 The equivalence class of a number depends only on the maximal element of its left set and the minimal element of the right set.
The informal interpretations of { 1  } and {  −1 } are "the number just after 1" and "the number just before −1" respectively; their equivalence classes are labeled 2 and −2. The informal interpretations of { 0  1 } and { −1  0 } are "the number halfway between 0 and 1" and "the number halfway between −1 and 0" respectively; their equivalence classes are labeled ^{1}/_{2} and −^{1}/_{2}. These labels will also be justified by the rules for surreal addition and multiplication below.
The equivalence classes at each stage n of induction may be characterized by their ncomplete forms (each containing as many elements as possible of previous generations in its left and right sets). Either this complete form contains every number from previous generations in its left or right set, in which case this is the first generation in which this number occurs; or it contains all numbers from previous generations but one, in which case it is a new form of this one number. We retain the labels from the previous generation for these "old" numbers, and write the ordering above using the old and new labels:
 −2 < −1 < −^{1}/_{2} < 0 < ^{1}/_{2} < 1 < 2.
The third observation extends to all surreal numbers with finite left and right sets. (For infinite left or right sets, this is valid in an altered form, since infinite sets might not contain a maximal or minimal element.) The number { 1, 2  5, 8 } is therefore equivalent to { 2  5 }; one can establish that these are forms of 3 by using the birthday property, which is a consequence of the rules above.
Birthday property
 A form x = { L  R } occurring in generation n represents a number inherited from an earlier generation i < n if and only if there is some number in S_{i} that is greater than all elements of L and less than all elements of the R. (In other words, if L and R are already separated by a number created at an earlier stage, then x does not represent a new number but one already constructed.) If x represents a number from any generation earlier than n, there is a least such generation i, and exactly one number c with this least i as its birthday lies between L and R. x is a form of this c, i. e., it lies in the equivalence class in S_{n} that is a superset of the representation of c in generation i.
Arithmetic
The addition, negation (additive inverse), and multiplication of surreal number forms x = { X_{L}  X_{R} } and y = { Y_{L}  Y_{R} } are defined by three recursive formulas.
Negation
Negation of a given number x = { X_{L}  X_{R} } is defined by
 ,
where the negation of a set S of numbers is given by the set of the negated elements of S:
 .
This formula involves the negation of the surreal numbers appearing in the left and right sets of x, which is to be understood as the result of choosing a form of the number, evaluating the negation of this form, and taking the equivalence class of the resulting form. This only makes sense if the result is the same, irrespective of the choice of form of the operand. This can be proven inductively using the fact that the numbers occurring in X_{L} and X_{R} are drawn from generations earlier than that in which the form x first occurs, and observing the special case:
 0 =  {  } = {  } = 0.
Addition
The definition of addition is also a recursive formula:
 ,
where
 .
This formula involves sums of one of the original operands and a surreal number drawn from the left or right set of the other. These are to be understood as the result of choosing a form of the numeric operand, performing the sum of the two forms, and taking the equivalence class of the resulting form. This only makes sense if the result is the same, irrespective of the choice of form of the numeric operand. This can also be proven inductively with the special cases:
 0 + 0 = {  } + {  } = {  } = 0
 x + 0 = x + {  } = { X_{L} + 0  X_{R} + 0 } = { X_{L}  X_{R} } = x
 0 + y = {  } + y = { 0 + Y_{L}  0 + Y_{R} } = { Y_{L}  Y_{R} } = y
(The latter two cases are themselves proven inductively.)
Multiplication
The recursive formula for multiplication contains arithmetic expressions involving the operands and their left and right sets, such as the expression that appears in the left set of the product of x and y. This is to be understood as the set of surreal numbers resulting from choosing one number from each set that appears in the expression and evaluating the expression on these numbers. (In each individual evaluation of the expression, only one number is chosen from each set, and is substituted in each place where that set appears in the expression.)
This depends, in turn, on the ability to (a) multiply pairs of surreal numbers drawn from the left and right sets of x and y to get a surreal number, and negate the result; (b) multiply the surreal number form x or y and a surreal number drawn from the left or right set of the other operand to get a surreal number; and (c) add the resulting surreal numbers. This again involves special cases, this time containing 0 = {  }, the multiplicative identity 1 = { 0  }, and its additive inverse 1 = {  0 }.
Division
The definition of division is done in terms of the reciprocal and multiplication:
where
^{[4]}^{:21}
for positive . Only positive are permitted in the formula, with any nonpositive terms being ignored (and are always positive). This formula involves not only recursion in terms of being able to divide by numbers from the left and right sets of , but also recursion in that the members of the left and right sets of itself. is always a member of the left set of , and that can be used to find more terms in a recursive fashion. For example, if , then we know a left term of will be . This in turn means is a right term. This means is a left term. This means will be a right term. Continuing, this gives .
For negative , is given by . If , then is undefined.
Consistency
It can be shown that the definitions of negation, addition and multiplication are consistent, in the sense that:
 addition and negation are defined recursively in terms of "simpler" addition and negation steps, so that operations on numbers with birthday n will eventually be expressed entirely in terms of operations on numbers with birthdays less than n;
 multiplication is defined recursively in terms of additions, negations, and "simpler" multiplication steps, so that the product of numbers with birthday n will eventually be expressed entirely in terms of sums and differences of products of numbers with birthdays less than n;
 as long as the operands are welldefined surreal number forms (each element of the left set is less than each element of the right set), the results are again welldefined surreal number forms;
 the operations can be extended to numbers (equivalence classes of forms): the result of negating x or adding or multiplying x and y will represent the same number regardless of the choice of form of x and y; and
 these operations obey the associativity, commutativity, additive inverse, and distributivity axioms in the definition of a field, with additive identity 0 = {  } and multiplicative identity 1 = { 0  }.
With these rules one can now verify that the numbers found in the first few generations were properly labeled. The construction rule is repeated to obtain more generations of surreals:
 S_{0} = { 0 }
 S_{1} = { −1 < 0 < 1 }
 S_{2} = { −2 < −1 < −^{1}/_{2} < 0 < ^{1}/_{2} < 1 < 2}
 S_{3} = { −3 < −2 < −^{3}/_{2} < −1 < −^{3}/_{4} < −^{1}/_{2} < −^{1}/_{4} < 0 < ^{1}/_{4} < ^{1}/_{2} < ^{3}/_{4} < 1 < ^{3}/_{2} < 2 < 3 }
 S_{4} = { −4 < −3 < ... < −^{1}/_{8} < 0 < ^{1}/_{8} < ^{1}/_{4} < ^{3}/_{8} < ^{1}/_{2} < ^{5}/_{8} < ^{3}/_{4} < ^{7}/_{8} < 1 < ^{5}/_{4} < ^{3}/_{2} < ^{7}/_{4} < 2 < ^{5}/_{2} < 3 < 4 }
Arithmetic closure
For each natural number (finite ordinal) n, all numbers generated in S_{n} are dyadic fractions, i.e., can be written as an irreducible fraction where a and b are integers and 0 ≤ b < n.
The set of all surreal numbers that are generated in some S_{n} for finite n may be denoted as S_{*} = . One may form the three classes S_{0} = { 0 }, S_{+} = , and S_{−} = , of which S_{*} is the union. No individual S_{n} is closed under addition and multiplication (except S_{0}), but S_{*} is; it is the subring of the rationals consisting of all dyadic fractions.
There are infinite ordinal numbers β for which the set of surreal numbers with birthday less than β is closed under the different arithmetic operations.^{[5]} For any ordinal α, the set of surreal numbers with birthday less than β = ω^{α} (using powers of ω) is closed under addition and forms a group; for birthday less than ω^{ωα} it is closed under multiplication and forms a ring;^{[b]} and for birthday less than an (ordinal) epsilon number ε_{α} it is closed under multiplicative inverse and forms a field. The latter sets are also closed under the exponential function as defined by Kruskal and Gonshor.^{[5]}^{[6]}^{(ch. 10)}^{[5]}
However, it is always possible to construct a surreal number that is greater than any member of a set (by including the set on the left side of the constructor) and thus the collection of surreal numbers is a proper class. With their ordering and algebraic operations they constitute an ordered field, with the caveat that they do not form a set. In fact, it is a very special ordered field: the biggest one. Every other ordered field can be embedded in the surreals. The class of all surreal numbers is denoted by the symbol .
Infinity
Let there be an ordinal ω greater than the natural numbers, and define S_{ω} as the set of all surreal numbers generated by the construction rule from subsets of S_{*}. (This is the same inductive step as before, since the ordinal number ω is the smallest ordinal that is larger than all natural numbers; however, the set union appearing in the inductive step is now an infinite union of finite sets, and so this step can only be performed in a set theory that allows such a union.) A unique infinitely large positive number occurs in S_{ω}:
S_{ω} also contains objects that can be identified as the rational numbers. For example, the ωcomplete form of the fraction ^{1}/_{3} is given by:
 .
The product of this form of ^{1}/_{3} with any form of 3 is a form whose left set contains only numbers less than 1 and whose right set contains only numbers greater than 1; the birthday property implies that this product is a form of 1.
Not only do all the rest of the rational numbers appear in S_{ω}; the remaining finite real numbers do too. For example,
 .
The only infinities in S_{ω} are ω and ω; but there are other nonreal numbers in S_{ω} among the reals. Consider the smallest positive number in S_{ω}:
 .
This number is larger than zero but less than all positive dyadic fractions. It is therefore an infinitesimal number, often labeled ε. The ωcomplete form of ε (resp. ε) is the same as the ωcomplete form of 0, except that 0 is included in the left (resp. right) set. The only "pure" infinitesimals in S_{ω} are ε and its additive inverse ε; adding them to any dyadic fraction y produces the numbers y±ε, which also lie in S_{ω}.
One can determine the relationship between ω and ε by multiplying particular forms of them to obtain:
 ω · ε = { ε · S_{+}  ω · S_{+} + S_{*} + ε · S_{*} }.
This expression is only welldefined in a set theory which permits transfinite induction up to . In such a system, one can demonstrate that all the elements of the left set of ω · ε are positive infinitesimals and all the elements of the right set are positive infinities, and therefore ω · ε is the oldest positive finite number, i. e., 1. Consequently,
 ^{1}/_{ε} = ω.
Some authors systematically use ω^{−1} in place of the symbol ε.
Contents of S_{ω}
Given any x = { L  R } in S_{ω}, exactly one of the following is true:
 L and R are both empty, in which case x = 0;
 R is empty and some integer n≥0 is greater than every element of L, in which case x equals the smallest such integer n;
 R is empty and no integer n is greater than every element of L, in which case x equals +ω;
 L is empty and some integer n≤0 is less than every element of R, in which case x equals the largest such integer n;
 L is empty and no integer n is less than every element of R, in which case x equals ω;

L and R are both nonempty, and:
 some dyadic fraction y is "strictly between" L and R (greater than all elements of L and less than all elements of R), in which case x equals the oldest such dyadic fraction y;
 no dyadic fraction y lies strictly between L and R, but some dyadic fraction is greater than or equal to all elements of L and less than all elements of R, in which case x equals y+ε;
 no dyadic fraction y lies strictly between L and R, but some dyadic fraction is greater than all elements of L and less than or equal to all elements of R, in which case x equals yε;
 every dyadic fraction is either greater than some element of R or less than some element of L, in which case x is some real number that has no representation as a dyadic fraction.
S_{ω} is not an algebraic field, because it is not closed under arithmetic operations; consider ω+1, whose form does not lie in any number in S_{ω}. The maximal subset of S_{ω} that is closed under (finite series of) arithmetic operations is the field of real numbers, obtained by leaving out the infinities ±ω, the infinitesimals ±ε, and the infinitesimal neighbors y±ε of each nonzero dyadic fraction y.
This construction of the real numbers differs from the Dedekind cuts of standard analysis in that it starts from dyadic fractions rather than general rationals and naturally identifies each dyadic fraction in S_{ω} with its forms in previous generations. (The ωcomplete forms of real elements of S_{ω} are in onetoone correspondence with the reals obtained by Dedekind cuts, under the proviso that Dedekind reals corresponding to rational numbers are represented by the form in which the cut point is omitted from both left and right sets.) The rationals are not an identifiable stage in the surreal construction; they are merely the subset Q of S_{ω} containing all elements x such that x b = a for some a and some nonzero b, both drawn from S_{*}. By demonstrating that Q is closed under individual repetitions of the surreal arithmetic operations, one can show that it is a field; and by showing that every element of Q is reachable from S_{*} by a finite series (no longer than two, actually) of arithmetic operations including multiplicative inversion, one can show that Q is strictly smaller than the subset of S_{ω} identified with the reals.
The set S_{ω} has the same cardinality as the real numbers R. This can be demonstrated by exhibiting surjective mappings from S_{ω} to the closed unit interval I of R and vice versa. Mapping S_{ω} onto I is routine; map numbers less than or equal to ε (including ω) to 0, numbers greater than or equal to 1ε (including ω) to 1, and numbers between ε and 1ε to their equivalent in I (mapping the infinitesimal neighbors y±ε of each dyadic fraction y, along with y itself, to y). To map I onto S_{ω}, map the (open) central third (1/3, 2/3) of I onto {  } = 0; the central third (7/9, 8/9) of the upper third to { 0  } = 1; and so forth. This maps a nonempty open interval of I onto each element of S_{*}, monotonically. The residue of I consists of the Cantor set 2^{ω}, each point of which is uniquely identified by a partition of the centralthird intervals into left and right sets, corresponding precisely to a form { L  R } in S_{ω}. This places the Cantor set in onetoone correspondence with the set of surreal numbers with birthday ω.
Gaps and continuity
In contrast to the real numbers, a (proper) subset of the surreal numbers does not have a least upper (or lower) bound unless it has a maximal (minimal) element. Conway defines^{[4]} a gap as {L  R}, L < R, L ∪ R = 𝐍𝐨; this is not a number because at least one of the sides is a proper class. Gaps can also be thought of as the equivalent of Dedekind sections, and the Dedekind completion 𝐍𝐨^{𝕯} of the surreal numbers with the natural ordering is a (proper classsized) linear continuum.^{[7]}
For instance there is no least positive infinite surreal, but the gap ∞ = {x: ∃ n ∈ ℕ: x < n  x: ∀ n ∈ ℕ: x > n} is greater than all real numbers and less than all positive infinite surreals, and is thus the least upper bound of the reals in 𝐍𝐨^{𝕯}. Similarly the gap 𝐎𝐧 = { 𝐍𝐨  } is larger than all surreal numbers. (𝐎𝐧 is also the name of the class of ordinal numbers, and since 𝐎𝐧 is cofinal in 𝐍𝐨 and thus 𝐎𝐧 = { 𝐎𝐧  } as well, this extends the equivalence of an ordinal α with the set of ordinals smaller than α).
With a bit of settheoretic care^{[7]} 𝐍𝐨 can be equipped with a topology where the open sets are unions of open intervals (indexed by proper sets) and continuous functions can be defined. An equivalent of Cauchy sequences can be defined as well although they have to be indexed by the class of ordinals; these will always converge, but the limit may be either a number or a gap.
Transfinite induction
Continuing to perform transfinite induction beyond S_{ω} produces more ordinal numbers α, each represented as the largest surreal number having birthday α. (This is essentially a definition of the ordinal numbers resulting from transfinite induction.) The first such ordinal is ω+1 = { ω  }. There is another positive infinite number in generation ω+1:
 ω−1 = { 1, 2, 3, 4, ...  ω }.
It is important to observe that the surreal number ω−1 is not an ordinal; the ordinal ω is not the successor of any ordinal. This is a surreal number with birthday ω+1, which is labeled ω−1 on the basis that it coincides with the sum of ω = { 1, 2, 3, 4, ...  } and −1 = {  0 }. Similarly, there are two new infinitesimal numbers in generation ω+1:
 2ε = ε + ε = { ε  1+ε, ^{1}/_{2}+ε, ^{1}/_{4}+ε, ^{1}/_{8}+ε, ... } and
 ε/2 = ε · ^{1}/_{2} = { 0  ε }.
At a later stage of transfinite induction, there is a number larger than ω+k for all natural numbers k:
 2ω = ω + ω = { ω+1, ω+2, ω+3, ω+4, ...  }
This number may be labeled ω + ω both because its birthday is ω + ω (the first ordinal number not reachable from ω by the successor operation) and because it coincides with the surreal sum of ω and ω; it may also be labeled 2ω because it coincides with the product of ω = { 1, 2, 3, 4, ...  } and 2 = { 1  }. It is the second limit ordinal; reaching it from ω via the construction step requires a transfinite induction on . This involves an infinite union of infinite sets, which is a "stronger" set theoretic operation than the previous transfinite induction required.
Note that the conventional addition and multiplication of ordinals does not always coincide with these operations on their surreal representations. The sum of ordinals 1 + ω equals ω, but the surreal sum is commutative and produces 1 + ω = ω + 1 > ω. The addition and multiplication of the surreal numbers associated with ordinals coincides with the natural sum and natural product of ordinals.
Just as 2ω is bigger than ω + n for any natural number n, there is a surreal number ω/2 that is infinite but smaller than ω − n for any natural number n. That is, ω/2 is defined by
 ω/2 = { S_{*}  ω − S_{*} }
where on the right hand side the notation x − Y is used to mean { x − y : y in Y }. It can be identified as the product of ω and the form { 0  1 } of ^{1}/_{2}. The birthday of ^{ω}/_{2} is the limit ordinal ω2.
Powers of ω
To classify the "orders" of infinite and infinitesimal surreal numbers, also known as archimedean classes, Conway associated to each surreal number x the surreal number
 ω^{x} = { 0, r ω^{xL}  s ω^{xR} },
where r and s range over the positive real numbers. If x < y then ω^{y} is "infinitely greater" than ω^{x}, in that it is greater than r ω^{x} for all real numbers r. Powers of ω also satisfy the conditions
 ω^{x} ω^{y} = ω^{x+y},
 ω^{−x} = 1/ω^{x},
so they behave the way one would expect powers to behave.
Each power of ω also has the redeeming feature of being the simplest surreal number in its archimedean class; conversely, every archimedean class within the surreal numbers contains a unique simplest member. Thus, for every positive surreal number x there will always exist some positive real number r and some surreal number y so that x − r ω^{y} is "infinitely smaller" than x. The exponent y is the "base ω logarithm" of x, defined on the positive surreals; it can be demonstrated that log_{ω} maps the positive surreals onto the surreals and that log_{ω}(xy) = log_{ω}(x) + log_{ω}(y).
This gets extended by transfinite induction so that every surreal number x has a "normal form" analogous to the Cantor normal form for ordinal numbers. Every surreal number may be uniquely written as
 x = r_{0} ω^{y0} + r_{1} ω^{y1} + …,
where every r_{α} is a nonzero real number and the y_{α}s form a strictly decreasing sequence of surreal numbers. This "sum", however, may have infinitely many terms, and in general has the length of an arbitrary ordinal number. (Zero corresponds of course to the case of an empty sequence, and is the only surreal number with no leading exponent.)
Looked at in this manner, the surreal numbers resemble a power series field, except that the decreasing sequences of exponents must be bounded in length by an ordinal and are not allowed to be as long as the class of ordinals. This is the basis for the formulation of the surreal numbers as a Hahn series.
Exponential function
Based on unpublished work by Kruskal, a construction (by transfinite induction) that extends the real exponential function exp(x) (with base e) to the surreals was carried through by Gonshor.^{[6]}^{(ch. 10)}
Other exponentials
The powers of ω function is also an exponential function, but does not have the properties desired for an extension of the function on the reals. It will however be needed in the development of the basee exponential, and it is this function that is meant whenever the notation ω^{x} is used in the following.
When y is a dyadic fraction, the power function x ∈ No, x ↦ x^{y} may be composed from multiplication, multiplicative inverse and square root, all of which can be defined inductively. Its values are completely determined by the basic relation x^{y+z} = x^{y}·x^{z}, and where defined it necessarily agrees with any other exponentiation that can exist.
Basic induction
The induction steps for the surreal exponential are based on the series expansion for the real exponential, exp x = ∑_{n≥0} x^{n}/n!, more specifically those partial sums that can be shown by basic algebra to be positive but less than all later ones. For x positive these are denoted [x]_{n} and include all partial sums; for x negative but finite, [x]_{2n+1} denotes the odd steps in the series starting from the first one with a positive real part (which always exists). For x negative infinite the oddnumbered partial sums are strictly decreasing and the [x]_{2n+1} notation denotes the empty set, but it turns out that the corresponding elements are not needed in the induction.
The relations that hold for real x < y are then exp x · [y–x]_{n} < exp y and exp y · [x–y]_{2n+1} < exp x, and this can be extended to the surreals with the definition exp z = { 0, exp z_{L} · [z–z_{L}]_{n} , exp z_{R} · [z–z_{R}]_{2n+1}  exp z_{R} / [z_{R}–z]_{n} , exp z_{L} / [z_{L}–z]_{2n+1} }. This is welldefined for all surreal arguments (the value exists and does not depend on the choice of z_{L} and z_{R}).
Results
Using this definition, the following holds:^{[c]}
 exp is a strictly increasing positive function, x < y ⇒ 0 < exp x < exp y
 exp satisfies exp(x+y) = exp x · exp y
 exp is a surjection (onto No_{+}) and has a welldefined inverse, log = exp^{–1}
 exp coincides with the usual exponential function on the reals (and thus exp 0 = 1, exp 1 = e)
 For x infinitesimal, the value of the formal power series ∑_{n≥0} x^{n}/n! is well defined and coincides with the inductive definition
 When x is given in Conway normal form, the set of exponents in the result is wellordered and the coefficients are finite sums, directly giving the normal form of the result (which has a leading 1)
 Similarly, for x infinitesimally close to 1, log x is given by power series expansion of x–1
 For positive infinite x, exp x is infinite as well
 If x has the form ω^{α} (α > 0), exp x has the form ω^{ωβ} where β is a strictly increasing function of α. In fact there is an inductively defined bijection g: No_{+} → No: α ↦ β whose inverse can also be defined inductively
 If x is "pure infinite" with normal form x = ∑_{α<β}r_{α}ω^{aα} where all a_{α} > 0, then exp x = ω^{∑α<βrαωg(aα)}
 Similarly, for x = ω^{∑α<βrαωbα}, the inverse is given by log x = ∑_{α<β}r_{α}ω^{g–1(bα)}
 Any surreal number can be written as the sum of a pure infinite, a real and an infinitesimal part, and the exponential is the product of the partial results given above
 The normal form can be written out by multiplying the infinite part (a single power of ω) and the real exponential into the power series resulting from the infinitesimal
 Conversely, dividing out the leading term of the normal form will bring any surreal number into the form (ω^{∑γ<δtγωbγ})·r·(1 + ∑_{α<β}s_{α}ω^{aα}), for a_{α} < 0, where each factor has a form for which a way of calculating the logarithm has been given above; the sum is then the general logarithm
 While there is no general inductive definition of log (unlike for exp), the partial results are given in terms of such definitions. In this way, the logarithm can be calculated explicitly, without reference to the fact that it's the inverse of the exponential.
 The exponential function is much greater than any finite power
 For any positive infinite x and any finite n, exp(x)/x^{n} is infinite
 For any integer n and surreal x > n^{2}, exp(x) > x^{n}. This stronger constraint is one of the Ressayre axioms for the real exponential field^{[5]}
 exp satisfies all the Ressayre axioms for the real exponential field^{[5]}
 The surreals with exponential is an elementary extension of the real exponential field
 For ε_{β} an ordinal epsilon number, the set of surreal numbers with birthday less than ε_{β} constitute a field that is closed under exponentials, and is likewise an elementary extension of the real exponential field
Examples
The surreal exponential is essentially given by its behaviour on positive powers of ω, i.e., the function g(a), combined with wellknown behaviour on finite numbers. Only examples of the former will be given. In addition, g(a) = a holds for a large part of its range, for instance for any finite number with positive real part and any infinite number that is less than some iterated power of ω (ω^{ω··ω} for some number of levels).
 exp ω = ω^{ω}
 exp ω^{1/ω} = ω and log ω = ω^{1/ω}
 exp (ω · log ω) = exp (ω · ω^{1/ω}) = ω^{ω(1 + 1/ω)}
 This shows that the "power of ω" function is not compatible with exp, since compatibility would demand a value of ω^{ω} here
 exp ε_{0} = ω^{ωε0 + 1}
 log ε_{0} = ε_{0} / ω
Exponentiation
A general exponentiation can be defined as x^{y} = exp(y · log x), giving an interpretation to expressions like 2^{ω} = exp(ω · log 2) = ω^{log 2 · ω}. Again it is essential to distinguish this definition from the "powers of ω" function, especially if ω may occur as the base.
Surcomplex numbers
A surcomplex number is a number of the form a+bi, where a and b are surreal numbers.^{[8]}^{[9]} The surcomplex numbers form an algebraically closed field (except for being a proper class), isomorphic to the algebraic closure of the field generated by extending the rational numbers by a proper class of algebraically independent transcendental elements. Up to field isomorphism, this fact characterizes the field of surcomplex numbers within any fixed set theory.^{[4]}^{:Th.27}
Games
The definition of surreal numbers contained one restriction: each element of L must be strictly less than each element of R. If this restriction is dropped we can generate a more general class known as games. All games are constructed according to this rule:

Construction Rule
If L and R are two sets of games then { L  R } is a game.
Addition, negation, and comparison are all defined the same way for both surreal numbers and games.
Every surreal number is a game, but not all games are surreal numbers, e.g. the game { 0  0 } is not a surreal number. The class of games is more general than the surreals, and has a simpler definition, but lacks some of the nicer properties of surreal numbers. The class of surreal numbers forms a field, but the class of games does not. The surreals have a total order: given any two surreals, they are either equal, or one is greater than the other. The games have only a partial order: there exist pairs of games that are neither equal, greater than, nor less than each other. Each surreal number is either positive, negative, or zero. Each game is either positive, negative, zero, or fuzzy (incomparable with zero, such as {1−1}).
A move in a game involves the player whose move it is choosing a game from those available in L (for the left player) or R (for the right player) and then passing this chosen game to the other player. A player who cannot move because the choice is from the empty set has lost. A positive game represents a win for the left player, a negative game for the right player, a zero game for the second player to move, and a fuzzy game for the first player to move.
If x, y, and z are surreals, and x=y, then x z=y z. However, if x, y, and z are games, and x=y, then it is not always true that x z=y z. Note that "=" here means equality, not identity.
Application to combinatorial game theory
The surreal numbers were originally motivated by studies of the game Go,^{[3]} and there are numerous connections between popular games and the surreals. In this section, we will use a capitalized Game for the mathematical object {LR}, and the lowercase game for recreational games like Chess or Go.
We consider games with these properties:
 Two players (named Left and Right)
 Deterministic (the game at each step will completely depend on the choices the players make, rather than a random factor)
 No hidden information (such as cards or tiles that a player hides)
 Players alternate taking turns (the game may or may not allow multiple moves in a turn)
 Every game must end in a finite number of moves
 As soon as there are no legal moves left for a player, the game ends, and that player loses
For most games, the initial board position gives no great advantage to either player. As the game progresses and one player starts to win, board positions will occur in which that player has a clear advantage. For analyzing games, it is useful to associate a Game with every board position. The value of a given position will be the Game {LR}, where L is the set of values of all the positions that can be reached in a single move by Left. Similarly, R is the set of values of all the positions that can be reached in a single move by Right.
The zero Game (called 0) is the Game where L and R are both empty, so the player to move next (L or R) immediately loses. The sum of two Games G = { L1  R1 } and H = { L2  R2 } is defined as the Game G + H = { L1 + H, G + L2  R1 + H, G + R2 } where the player to move chooses which of the Games to play in at each stage, and the loser is still the player who ends up with no legal move. One can imagine two chess boards between two players, with players making moves alternatively, but with complete freedom as to which board to play on. If G is the Game {L  R}, G is the game {R  L}, i.e. with the role of the two players reversed. It is easy to show G  G = 0 for all Games G (where G  H is defined as G + (H)).
This simple way to associate Games with games yields a very interesting result. Suppose two perfect players play a game starting with a given position whose associated Game is x. We can classify all Games into four classes as follows:
 If x > 0 then Left will win, regardless of who plays first.
 If x < 0 then Right will win, regardless of who plays first.
 If x = 0 then the player who goes second will win.
 If x  0 then the player who goes first will win.
More generally, we can define G > H as G  H > 0, and similarly for <, = and .
The notation G  H means that G and H are incomparable. G  H is equivalent to G−H  0, i.e. that G > H, G < H and G = H are all false. Incomparable games are sometimes said to be confused with each other, because one or the other may be preferred by a player depending on what is added to it. A game confused with zero is said to be fuzzy, as opposed to positive, negative, or zero. An example of a fuzzy game is star (*).
Sometimes when a game nears the end, it will decompose into several smaller games that do not interact, except in that each player's turn allows moving in only one of them. For example, in Go, the board will slowly fill up with pieces until there are just a few small islands of empty space where a player can move. Each island is like a separate game of Go, played on a very small board. It would be useful if each subgame could be analyzed separately, and then the results combined to give an analysis of the entire game. This doesn't appear to be easy to do. For example, you might have two subgames where whoever moves first wins, but when they are combined into one big game, it's no longer the first player who wins. Fortunately, there is a way to do this analysis. Just use the following remarkable theorem:
 If a big game decomposes into two smaller games, and the small games have associated Games of x and y, then the big game will have an associated Game of x+y.
A game composed of smaller games is called the disjunctive sum of those smaller games, and the theorem states that the method of addition we defined is equivalent to taking the disjunctive sum of the addends.
Historically, Conway developed the theory of surreal numbers in the reverse order of how it has been presented here. He was analyzing Go endgames, and realized that it would be useful to have some way to combine the analyses of noninteracting subgames into an analysis of their disjunctive sum. From this he invented the concept of a Game and the addition operator for it. From there he moved on to developing a definition of negation and comparison. Then he noticed that a certain class of Games had interesting properties; this class became the surreal numbers. Finally, he developed the multiplication operator, and proved that the surreals are actually a field, and that it includes both the reals and ordinals.
Alternative realizations
The name surreal number was first used by Conway in 1972, but there are several alternative constructions developed both before and after that.
Sign expansion
Definitions
In what is now called the signexpansion or signsequence of a surreal number, a surreal number is a function whose domain is an ordinal and whose codomain is { −1, +1 }.^{[6]}^{(ch. 2)} This is equivalent to Conway's LR sequences.^{[4]}
Define the binary predicate "simpler than" on numbers by x is simpler than y if x is a proper subset of y, i.e. if dom(x) < dom(y) and x(α) = y(α) for all α < dom(x).
For surreal numbers define the binary relation < to be lexicographic order (with the convention that "undefined values" are greater than −1 and less than 1). So x < y if one of the following holds:
 x is simpler than y and y(dom(x)) = + 1;
 y is simpler than x and x(dom(y)) = − 1;
 there exists a number z such that z is simpler than x, z is simpler than y, x(dom(z)) = − 1 and y(dom(z)) = + 1.
Equivalently, let δ(x,y) = min({ dom(x), dom(y)} ∪ { α : α < dom(x) ∧ α < dom(y) ∧ x(α) ≠ y(α) }), so that x = y if and only if δ(x,y) = dom(x) = dom(y). Then, for numbers x and y, x < y if and only if one of the following holds:
 δ(x,y) = dom(x) ∧ δ(x,y) < dom(y) ∧ y(δ(x,y)) = + 1;
 δ(x,y) < dom(x) ∧ δ(x,y) = dom(y) ∧ x(δ(x,y)) = − 1;
 δ(x,y) < dom(x) ∧ δ(x,y) < dom(y) ∧ x(δ(x,y)) = − 1 ∧ y(δ(x,y)) = + 1.
For numbers x and y, x ≤ y if and only if x < y ∨ x = y, and x > y if and only if y < x. Also x ≥ y if and only if y ≤ x.
The relation < is transitive, and for all numbers x and y, exactly one of x < y, x = y, x > y, holds (law of trichotomy). This means that < is a linear order (except that < is a proper class).
For sets of numbers, L and R such that ∀x ∈ L ∀y ∈ R (x < y), there exists a unique number z such that
 ∀x ∈ L (x < z) ∧ ∀y ∈ R (z < y),
 For any number w such that ∀x ∈ L (x < w) ∧ ∀y ∈ R (w < y), w = z or z is simpler than w.
Furthermore, z is constructible from L and R by transfinite induction. z is the simplest number between L and R. Let the unique number z be denoted by σ(L,R).
For a number x, define its left set L(x) and right set R(x) by
 L(x) = { x_{α} : α < dom(x) ∧ x(α) = + 1 };
 R(x) = { x_{α} : α < dom(x) ∧ x(α) = − 1 },
then σ(L(x),R(x)) = x.
One advantage of this alternative realization is that equality is identity, not an inductively defined relation. Unlike Conway's realization of the surreal numbers, however, the signexpansion requires a prior construction of the ordinals, while in Conway's realization, the ordinals are constructed as particular cases of surreals.
However, similar definitions can be made that eliminate the need for prior construction of the ordinals. For instance, we could let the surreals be the (recursivelydefined) class of functions whose domain is a subset of the surreals satisfying the transitivity rule ∀g ∈ dom f (∀h ∈ dom g (h ∈ dom f )) and whose range is { −, + }. "Simpler than" is very simply defined now—x is simpler than y if x ∈ dom y. The total ordering is defined by considering x and y as sets of ordered pairs (as a function is normally defined): Either x = y, or else the surreal number z = x ∩ y is in the domain of x or the domain of y (or both, but in this case the signs must disagree). We then have x < y if x(z) = − or y(z) = + (or both). Converting these functions into sign sequences is a straightforward task; arrange the elements of dom f in order of simplicity (i.e., inclusion), and then write down the signs that f assigns to each of these elements in order. The ordinals then occur naturally as those surreal numbers whose range is { + }.
Addition and multiplication
The sum x + y of two numbers, x and y, is defined by induction on dom(x) and dom(y) by x + y = σ(L,R), where
 L = { u + y : u ∈ L(x) } ∪{ x + v : v ∈ L(y) },
 R = { u + y : u ∈ R(x) } ∪{ x + v : v ∈ R(y) }.
The additive identity is given by the number 0 = { }, i.e. the number 0 is the unique function whose domain is the ordinal 0, and the additive inverse of the number x is the number − x, given by dom(− x) = dom(x), and, for α < dom(x), (− x)(α) = − 1 if x(α) = + 1, and (− x)(α) = + 1 if x(α) = − 1.
It follows that a number x is positive if and only if 0 < dom(x) and x(0) = + 1, and x is negative if and only if 0 < dom(x) and x(0) = − 1.
The product xy of two numbers, x and y, is defined by induction on dom(x) and dom(y) by xy = σ(L,R), where
 L = { uy + xv − uv : u ∈ L(x), v ∈ L(y) } ∪ { uy + xv − uv : u ∈ R(x), v ∈ R(y) },
 R = { uy + xv − uv : u ∈ L(x), v ∈ R(y) } ∪ { uy + xv − uv : u ∈ R(x), v ∈ L(y) }.
The multiplicative identity is given by the number 1 = { (0,+ 1) }, i.e. the number 1 has domain equal to the ordinal 1, and 1(0) = + 1.
Correspondence with Conway
The map from Conway's realization to sign expansions is given by f({ L  R }) = σ(M,S), where M = { f(x) : x ∈ L } and S = { f(x) : x ∈ R }.
The inverse map from the alternative realization to Conway's realization is given by g(x) = { L  R }, where L = { g(y) : y ∈ L(x) } and R = { g(y) : y ∈ R(x) }.
Axiomatic approach
In another approach to the surreals, given by Alling,^{[9]} explicit construction is bypassed altogether. Instead, a set of axioms is given that any particular approach to the surreals must satisfy. Much like the axiomatic approach to the reals, these axioms guarantee uniqueness up to isomorphism.
A triple is a surreal number system if and only if the following hold:
 < is a total order over No
 b is a function from No onto the class of all ordinals (b is called the "birthday function" on No).
 Let A and B be subclasses of No such that for all x ∈ A and y ∈ B, x < y (using Alling's terminology, 〈 A,B 〉 is a "Conway cut" of No). Then there exists a unique z ∈ No such that b(z) is minimal and for all x ∈ A and all y ∈ B, x < z < y. (This axiom is often referred to as "Conway's Simplicity Theorem".)
 Furthermore, if an ordinal α is greater than b(x) for all x ∈ A, B, then b(z) ≤ α. (Alling calls a system that satisfies this axiom a "full surreal number system".)
Both Conway's original construction and the signexpansion construction of surreals satisfy these axioms.
Given these axioms, Alling^{[9]} derives Conway's original definition of ≤ and develops surreal arithmetic.
Simplicity hierarchy
A construction of the surreal numbers as a maximal binary pseudotree with simplicity (ancestor) and ordering relations is due to Philip Ehrlich,^{[10]} The difference from the usual definition of a tree is that the set of ancestors of a vertex is wellordered, but may not have a maximal element (immediate predecessor); in other words the order type of that set is a general ordinal number, not just a natural number. This construction fulfills Alling's axioms as well and can easily be mapped to the signsequence representation.
Hahn series
Alling^{[9]}^{(th. 6.55, p. 246)} also proves that the field of surreal numbers is isomorphic (as an ordered field) to the field of Hahn series with real coefficients on the value group of surreal numbers themselves (the series representation corresponding to the normal form of a surreal number, as defined above). This provides a connection between surreal numbers and more conventional mathematical approaches to ordered field theory.
This isomorphism makes the surreal numbers into a valued field where the valuation is the additive inverse of the exponent of the leading term in the Conway normal form, e.g., ν(ω) = 1. The valuation ring then consists of the finite surreal numbers (numbers with a real and/or an infinitesimal part). The reason for the sign inversion is that the exponents in the Conway normal form constitute a reverse wellordered set, whereas Hahn series are formulated in terms of (nonreversed) wellordered subsets of the value group.
Relation to hyperreals
Philip Ehrlich has constructed an isomorphism between Conway's maximal surreal number field and the maximal hyperreals in von Neumann–Bernays–Gödel set theory.^{[10]}
See also
Notes
 ^ In the original formulation using von Neumann–Bernays–Gödel set theory, the surreals form a proper class, rather than a set, so the term field is not precisely correct; where this distinction is important, some authors use Field or FIELD to refer to a proper class that has the arithmetic properties of a field. One can obtain a true field by limiting the construction to a Grothendieck universe, yielding a set with the cardinality of some strongly inaccessible cardinal, or by using a form of set theory in which constructions by transfinite recursion stop at some countable ordinal such as epsilon nought.
 ^ The set of dyadic fractions constitutes the simplest nontrivial group and ring of this kind; it consists of the surreal numbers with birthday less than ω = ω^{1} = ω^{ω0}.
 ^ Even the most triviallooking of these equalities may involve transfinite induction and constitute a separate theorem.
References

^ Bajnok, Béla (2013). An Invitation to Abstract Mathematics.
Theorem 24.29. The surreal number system is the largest ordered field
 ^ Alling, Norman L. (1962), "On the existence of realclosed fields that are η_{α}sets of power ℵ_{α}.", Trans. Amer. Math. Soc., 103: 341–352, doi:10.1090/S0002994719620146089X, MR 0146089
 ^ ^{a} ^{b} O'Connor, J.J.; Robertson, E.F., Conway Biography, retrieved 20080124
 ^ ^{a} ^{b} ^{c} ^{d} ^{e} Conway, John H. (20001211) [1976]. On Numbers and Games (2 ed.). CRC Press. ISBN 9781568811277.
 ^ ^{a} ^{b} ^{c} ^{d} ^{e} van den Dries, Lou; Ehrlich, Philip (January 2001). "Fields of surreal numbers and exponentiation" (PDF). Fundamenta Mathematicae. Warszawa: Institute of Mathematics of the Polish Academy of Sciences. 167 (2): 173–188. doi:10.4064/fm16723. ISSN 00162736.
 ^ ^{a} ^{b} ^{c} Gonshor, Harry (1986). An Introduction to the Theory of Surreal Numbers. London Mathematical Society Lecture Note Series. 110. Cambridge University Press. doi:10.1017/CBO9780511629143. ISBN 9780521312059.
 ^ ^{a} ^{b} RubinsteinSalzedo, Simon; Swaminathan, Ashvin (20150519). "Analysis on Surreal Numbers". arXiv:1307.7392v3 [math.CA].
 ^ Surreal vectors and the game of Cutblock, James Propp, August 22, 1994.
 ^ ^{a} ^{b} ^{c} ^{d} Alling, Norman L. (1987). Foundations of Analysis over Surreal Number Fields. Mathematics Studies 141. NorthHolland. ISBN 0444702261.
 ^ ^{a} ^{b} Philip Ehrlich (2012). "The absolute arithmetic continuum and the unification of all numbers great and small" (PDF). The Bulletin of Symbolic Logic. 18 (1): 1–45. doi:10.2178/bsl/1327328438. Retrieved 20170608.
Further reading
 Donald Knuth's original exposition: Surreal Numbers: How Two ExStudents Turned on to Pure Mathematics and Found Total Happiness, 1974, ISBN 0201038129. More information can be found at the book's official homepage.
 An update of the classic 1976 book defining the surreal numbers, and exploring their connections to games: John Conway, On Numbers And Games, 2nd ed., 2001, ISBN 1568811276.
 An update of the first part of the 1981 book that presented surreal numbers and the analysis of games to a broader audience: Berlekamp, Conway, and Guy, Winning Ways for Your Mathematical Plays, vol. 1, 2nd ed., 2001, ISBN 1568811306.
 Martin Gardner, Penrose Tiles to Trapdoor Ciphers, W. H. Freeman & Co., 1989, ISBN 0716719878, Chapter 4. A nontechnical overview; reprint of the 1976 Scientific American article.
 Polly Shulman, "Infinity Plus One, and Other Surreal Numbers", Discover, December 1995.
 A detailed treatment of surreal numbers: Norman L. Alling, Foundations of Analysis over Surreal Number Fields, 1987, ISBN 0444702261.
 A treatment of surreals based on the signexpansion realization: Harry Gonshor, An Introduction to the Theory of Surreal Numbers, 1986, ISBN 0521312051.
 A detailed philosophical development of the concept of surreal numbers as a most general concept of number: Alain Badiou, Number and Numbers, New York: Polity Press, 2008, ISBN 0745638791 (paperback), ISBN 0745638783 (hardcover).
 The Univalent Foundations Program (2013). Homotopy Type Theory: Univalent Foundations of Mathematics. Princeton, NJ: Institute for Advanced Study. MR 3204653. The surreal numbers are studied in the context of homotopy type theory in section 11.6.
External links
 Hackenstrings, and the 0.999... ?= 1 FAQ, by A. N. Walker, an archive of the disappeared original
 A gentle yet thorough introduction by Claus Tøndering
 "Surreal number". PlanetMath.
 Good Math, Bad Math: Surreal Numbers, a series of articles about surreal numbers and their variations