Completing pseudojump operators

DOI10.1016/j.apal.2003.07.001zbMath1085.03031OpenAlexW2035615587MaRDI QIDQ2570139

Yanyan Li

Publication date: 26 October 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2003.07.001

zbMATH Keywords

computably enumerable degreespseudojump operators

Mathematics Subject Classification ID

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

Related Items (3)

Strong jump-traceability. II: \(K\)-triviality ⋮ STRONG JUMP-TRACEABILITY ⋮ On very high degrees

Cites Work

• Unnamed Item
• A non-inversion theorem for the jump operator
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Contiguity and distributivity in the enumerable Turing degrees

This page was built for publication: Completing pseudojump operators