Game Arguments in Some Existence Theorems of Friedberg Numberings¶
Imamura, T. (2020). Game Arguments in Some Existence Theorems of Friedberg Numberings.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Friedberg numbering
- A distinct program string or description does not count as a distinct object merely because its code differs.
This sourcePhysical PDF p.1 Introduction gives the historical attribution and later methods; p.2 §2 defines numberings, computable partial evaluation and the injective subtype; p.2 Theorem 1 covers all partial computable unary functions and cites Friedberg's corollary to Theorem 3; pp.2–4 §3 presents the later game proof; p.4 notes Kummer's priority-free method. These are physical PDF pages, not an assertion about later publication pagination.
- A distinct program string or description does not count as a distinct object merely because its code differs.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:5672c2c5789b · see in the full table