Metarecursively enumerable sets and their metadegrees
From MaRDI portal
Publication:5614653
DOI10.2307/2270325zbMath0213.01702MaRDI QIDQ5614653
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
03D25: Recursively (computably) enumerable sets and degrees
Related Items
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES, Ordinal machines and admissible recursion theory, The basic theory of partial \(\alpha\)-recursive operators, The irregular and non-hyperregular \(\alpha\)-r.e. degrees, On the reducibility of \(\Pi_ 1^ 1\) sets, The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
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