Abstract
This paper considers effectivizations of the two standard developments of the surreal number system, viz. via cuts and via sign sequences. Properties of both versions of “computable surreals” are investigated, and it is shown that the two effectivizations in fact yield different sets of surreals. © 1990, Duke University Press. All Rights Reserved.
Cite
CITATION STYLE
APA
Harkleroad, L. (1990). Recursive surreal numbers. Notre Dame Journal of Formal Logic, 31(3), 337–345. https://doi.org/10.1305/ndjfl/1093635498
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free