A Completely Mitotic Nonrecursive R.E. Degree

DOI10.2307/1996424zbMath0309.02045OpenAlexW4252462250MaRDI QIDQ4067084

Richard E. Ladner

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/1996424

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

Structural interactions of the recursively enumerable T- and W-degrees ⋮ Completely mitotic r. e. degrees ⋮ Classification of degree classes associated with r.e. subspaces ⋮ Deficiency Sets and Bounded Information Reducibilities ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Autoreducibility, mitoticity, and immunity ⋮ Space-efficient informational redundancy ⋮ Irreducible, singular, and contiguous degrees ⋮ Completely mitotic c.e. degrees and non-jump inversion ⋮ Non-cupping, measure and computably enumerable splittings ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ Learning Finite Variants of Single Languages from Informant ⋮ Some observations on mitotic sets

Cites Work

• Three theorems on the degrees of recursively enumerable sets
• Deficiency Sets and Bounded Information Reducibilities
• Mitotic recursively enumerable sets
• On the Degrees of Index Sets. II
• Degrees in Which the Recursive Sets are Uniformly Recursive

This page was built for publication: A Completely Mitotic Nonrecursive R.E. Degree