Iterated relative recursive enumerability

DOI10.1007/BF01278463MaRDI QIDQ1344547zbMATH OpenOpenAlexFDO

Authors Peter G. Hinman, Peter A. Cholak

Publication date 20 April 1995

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01278463

zbMATH Keywords

recursively enumerable setrecursively enumerable degree\(m\)-REA degreeiterated hops

Mathematics Subject Classification ID

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

Recommendations

• Extending properly n - REA sets1
• On the r. e. predecessors of d. r. e. degrees
• Relative enumerability in the difference hierarchy
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• On relative enumerability of Turing degrees

Cites work

• scientific article; zbMATH DE number 3809539 (Why is no real title available?)
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Cited in

(6)

• Extending properly n - REA sets1
• Isolation in the CEA hierarchy
• scientific article; zbMATH DE number 4148069 (Why is no real title available?)
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Array nonrecursiveness and relative recursive enumerability
• Relative enumerability in the difference hierarchy

This page was built for publication: Iterated relative recursive enumerability

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