Recursively enumerable sets which are uniform for finite extensions

DOI10.2307/2270262MaRDI QIDQ5633985zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Dichotomy of the Recursively Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of Unsolvability. (AM-55)
• On degrees of unsolvability
• Recursively enumerable sets of positive integers and their decision problems
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Three theorems on the degrees of recursively enumerable sets

Cited in

(1)

• Computational complexity, speedable and levelable sets

This page was built for publication: Recursively enumerable sets which are uniform for finite extensions

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