Automorphisms of the lattice of recursively enumerable sets. I. Maximal sets

Soare, R. I. (1974). Automorphisms of the lattice of recursively enumerable sets. I. Maximal sets.

Type

Unclassified

Intellectual base

Unclassified

Year

1974

DOI

10.2307/1970842

Link

https://doi.org/10.2307/1970842

Cited by

1 citation across 1 artifact.

Domain-specific

• Maximal set (computability theory)
  • … directly demonstrates that the natural-number universe, computable enumeration, coinfinite complement, finite-variant relation and quantified condition on every c.e. superset are explicit. to An applied instance preserves the same invariant under changed scale, notation, jurisdiction, dataset, or implementation..

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:5ac88ea0abef · see in the full table