Switch to: References

Citations of:

An Introduction to the Theory of Surreal Numbers

Cambridge University Press (1986)

Add citations

You must login to add citations.
  1. A Robust Non-transitive Logic.Alan Weir - 2015 - Topoi 34 (1):1-9.
    Logicians interested in naive theories of truth or set have proposed logical frameworks in which classical operational rules are retained but structural rules are restricted. One increasingly popular way to do this is by restricting transitivity of entailment. This paper discusses a series of logics in this tradition, in which the transitivity restrictions are effected by a determinacy constraint on assumptions occurring in both the major and minor premises of certain rules. Semantics and proof theory for 3-valued, continuum-valued and surreal-valued (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Surreal Decisions.Eddy Keming Chen & Daniel Rubio - 2020 - Philosophy and Phenomenological Research 100 (1):54-74.
    Although expected utility theory has proven a fruitful and elegant theory in the finite realm, attempts to generalize it to infinite values have resulted in many paradoxes. In this paper, we argue that the use of John Conway's surreal numbers shall provide a firm mathematical foundation for transfinite decision theory. To that end, we prove a surreal representation theorem and show that our surreal decision theory respects dominance reasoning even in the case of infinite values. We then bring our theory (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Transseries and Todorov–Vernaeve’s asymptotic fields.Matthias Aschenbrenner & Isaac Goldbring - 2014 - Archive for Mathematical Logic 53 (1-2):65-87.
    We study the relationship between fields of transseries and residue fields of convex subrings of non-standard extensions of the real numbers. This was motivated by a question of Todorov and Vernaeve, answered in this paper.
    Download  
     
    Export citation  
     
    Bookmark  
  • Intermediate arithmetic operations on ordinal numbers.Harry J. Altman - 2017 - Mathematical Logic Quarterly 63 (3-4):228-242.
    There are two well‐known ways of doing arithmetic with ordinal numbers: the “ordinary” addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the “natural” (or “Hessenberg”) addition and multiplication (denoted ⊕ and ⊗), each satisfying its own set of algebraic laws. In 1909, Jacobsthal considered a third, intermediate way of multiplying ordinals (denoted × ), defined by transfinite iteration of natural addition, as well as the notion of exponentiation defined by transfinite iteration of his multiplication, which we denote. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations