Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication¶
Friedberg, R. M. (1958). Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. Journal of Symbolic Logic, 23(3), 309-316.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Friedberg numbering
- Friedberg's 1958 result established enumeration without duplication for computably enumerable (c.e.) sets; later author papers explicitly attribute the partial-function corollary to that result and establish analogous numberings for specified families of left-c.e. reals.
This sourceThe original publisher record and extract and indexed Theorem 3 title support the historical attribution; the full 1958 theorem body was access-gated, so no internal proof step is attributed to direct inspection.
- Friedberg's 1958 result established enumeration without duplication for computably enumerable (c.e.) sets; later author papers explicitly attribute the partial-function corollary to that result and establish analogous numberings for specified families of left-c.e. reals.
- Maximal set (computability theory)
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a 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:ca3fc78ca425 · see in the full table