Recursively enumerable sets which are uniform for finite extensions

DOI10.2307/2270262zbMath0227.02023OpenAlexW2028182013MaRDI QIDQ5633985

Donald A. Alton

Publication date: 1971

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

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Computational complexity, speedable and levelable sets

Cites Work

• Unnamed Item
• Three theorems on the degrees of recursively enumerable sets
• On degrees of unsolvability
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Degrees of Unsolvability. (AM-55)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• A Dichotomy of the Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems