Joining up to the generalized high degrees

DOI10.1090/S0002-9939-10-10299-8zbMath1202.03050OpenAlexW2079975172MaRDI QIDQ3581116

Andrew E. M. Lewis, Philip Ellison

Publication date: 16 August 2010

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-10-10299-8

zbMATH Keywords

generalized high degreeTuring degree

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Related Items (2)

2-minimality, jump classes and a note on natural definability ⋮ INITIAL SEGMENTS OF THE ENUMERATION DEGREES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions of embeddings below computably enumerable degrees
• A minimal degree less than 0’
• Minimal degrees and the jump operator
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Double jumps of minimal degrees
• Minimal complements for degrees below 0′
• Generalized high degrees have the complementation property
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
• The minimal complementation property above 0′

This page was built for publication: Joining up to the generalized high degrees