Iterated relative recursive enumerability

DOI10.1007/BF01278463zbMATH Open0810.03035OpenAlexW2153470928MaRDI QIDQ1344547FDOQ1344547

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Array nonrecursiveness and relative recursive enumerability
• Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
• Isolation in the CEA hierarchy
• Relative enumerability in the difference hierarchy
• Extending properly n - REA sets1

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)