Metarecursively enumerable sets and their metadegrees

DOI10.2307/2270325zbMath0213.01702OpenAlexW2092093189MaRDI QIDQ5614653

G. C. Jun. Driscoll

Publication date: 1968

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

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

Mathematics Subject Classification ID

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

Related Items (6)

The basic theory of partial \(\alpha\)-recursive operators ⋮ The irregular and non-hyperregular \(\alpha\)-r.e. degrees ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ On the reducibility of \(\Pi_ 1^ 1\) sets ⋮ THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES ⋮ Ordinal machines and admissible recursion theory

Cites Work

• Three theorems on the degrees of recursively enumerable sets
• The recursively enumerable degrees are dense
• A maximal set which is not complete
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Metarecursively enumerable sets and admissible ordinals

This page was built for publication: Metarecursively enumerable sets and their metadegrees