Mitotic recursively enumerable sets

DOI10.2307/2272056zbMath0286.02042OpenAlexW2050457719MaRDI QIDQ4774029

Richard E. Ladner

Publication date: 1973

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

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 and mitoticity of logspace-complete sets for NP and other classes ⋮ Autoreducibility, mitoticity, and immunity ⋮ Introduction to Autoreducibility and Mitoticity ⋮ Space-efficient informational redundancy ⋮ The distribution of the generic recursively enumerable degrees ⋮ On the autoreducibility of functions ⋮ Completely mitotic c.e. degrees and non-jump inversion ⋮ Non-cupping, measure and computably enumerable splittings ⋮ Non-mitotic Sets ⋮ Recursively enumerable sets and degrees ⋮ Non-mitotic sets ⋮ Learning Finite Variants of Single Languages from Informant ⋮ A Completely Mitotic Nonrecursive R.E. Degree ⋮ Splitting theorems and the jump operator ⋮ Splitting theorems in recursion theory ⋮ Some observations on mitotic sets

Cites Work

• Unnamed Item
• Three theorems on the degrees of recursively enumerable sets
• The Priority Method I