Pith. sign in

REVIEW 1 cited by

Recursive definitions on surreal numbers

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0612234 v1 pith:SUYP4R2H submitted 2006-12-09 math.LO math.RA

Antongiulio Fornasiero This is my paper · ORCID
classification math.LOmath.RA
keywords someclassdefinedelementfunctionfunctionsnumbersrecursively
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Conway's Numbers and Games, the Von Neumann Universe, and Pure Set Theory

    math.LO 2025-01 conditional novelty 3.0 of 10

    Surreal numbers can be presented as sets of ordinals with a maximal 'birthday' element, giving a set-theoretic foundation equivalent to Gonshor's sign expansions and Conway's games.

Pith tools