2017/12/10 by Paolo Lipparini, Lipparini, Paolo
Computer Science · Mathematics · #Artificial Intelligence in Games #Computability, Logic, AI Algorithms #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.1712.03500
Let surreal numbers be defined by means of sign sequences. We give a proof that if S < T are sets of surreals, then there is some surreal w such that S < w < T. The classical proof is simplified by observing that, for every set S of surreals, there exists a surreal s such that, for every surreal w, we have S