Recursive definitions on surreal numbers
| dc.creator | Fornasiero, Antongiulio | |
| dc.date | 2006-12-09 | |
| dc.date.accessioned | 2026-07-07T07:34:47Z | |
| dc.date.available | 2026-07-07T07:34:47Z | |
| dc.description | Let No be Conway's class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some "tameness" and uniformity condition, f must satisfy some interesting properties; in particular, the supremum of the class of element greater or equal to a fixed d in No is actually an element of No. For similar reasons, the concatenation function x:y cannot be defined recursively in a uniform way over polynomial functions. | |
| dc.identifier | https://arxiv.org/abs/math/0612234 | |
| dc.identifier | http://arxiv.org/abs/math/0612234 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119889 | |
| dc.subject | Logic | |
| dc.subject | Rings and Algebras | |
| dc.subject | 03C64, 03C65, 03H05, 12J15, 20F60 | |
| dc.title | Recursive definitions on surreal numbers | |
| dc.type | text |