A hierarchy of families of recursively enumerable degrees
From MaRDI portal
Publication:3701410
DOI10.2307/2274268zbMATH Open0579.03029OpenAlexW1980641386MaRDI QIDQ3701410FDOQ3701410
Authors: Lawrence Welch 
Publication date: 1984
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274268
Recommendations
- A hierarchy of computably enumerable degrees
- Publication:4934281
- Enumeration Degrees and Enumerability of Familes
- Relative recursive enumerability of generic degrees
- On Pairs of Recursively Enumerable Degrees
- scientific article; zbMATH DE number 3845569
- scientific article; zbMATH DE number 3995654
- scientific article; zbMATH DE number 3857079
- Hierarchy of Computably Enumerable Degrees II
- scientific article; zbMATH DE number 3922635
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
Cited In (15)
- Nonhemimaximal degrees and the high/low hierarchy
- The natural hierarchy and quasi-hierarchy of constructibility degrees
- Computable elements and functions in effectively enumerable topological spaces
- Title not available (Why is that?)
- Index sets of quotient objects of the Post numeration
- Degrees of recursively enumerable topological spaces
- A hierarchy of computably enumerable degrees
- Title not available (Why is that?)
- Hierarchies of finite sets
- Title not available (Why is that?)
- Precomplete numberings
- Automorphism bases for the recursively enumerable degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration Degrees and Enumerability of Familes
This page was built for publication: A hierarchy of families of recursively enumerable degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701410)
