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.

Type

Unclassified

Intellectual base

Unclassified

Year

1958

DOI

10.2307/2964290

Link

https://doi.org/10.2307/2964290

Cited by

1 citation across 1 artifact.

Domain-specific

• Maximal set (computability theory)
  • Maximal c.e. sets are maximal elements of the quotient lattice modulo finite difference below the whole natural numbers and have immune complements under related formulations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ca3fc78ca425 · see in the full table