Mitotic recursively enumerable sets

DOI10.2307/2272056zbMATH Open0286.02042OpenAlexW2050457719MaRDI QIDQ4774029FDOQ4774029

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Three theorems on the degrees of recursively enumerable sets
• The Priority Method I

Cited In (21)

• Classification of degree classes associated with r.e. subspaces
• The distribution of the generic recursively enumerable degrees
• Introduction to autoreducibility and mitoticity
• Completely mitotic r. e. degrees
• Some observations on mitotic sets
• Splitting theorems in recursion theory
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
• Completely mitotic c.e. degrees and non-jump inversion
• Splitting theorems and the jump operator
• Autoreducibility, mitoticity, and immunity
• Learning finite variants of single languages from informant
• Deficiency Sets and Bounded Information Reducibilities
• Non-mitotic sets
• Non-mitotic Sets
• On the autoreducibility of functions
• Recursively enumerable sets and degrees
• Non-cupping, measure and computably enumerable splittings
• A Completely Mitotic Nonrecursive R.E. Degree
• Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
• Space-efficient informational redundancy
• Structural interactions of the recursively enumerable T- and W-degrees

This page was built for publication: Mitotic recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4774029)