1. Afshari, B., Barmpalias, G., Cooper, S.B.: Characterising the highness of d.c.e. degrees (in preparation)
2. Barmpalias, G.: Hypersimplicity and Semicomputability in the Weak Truth Table Degrees. Archive for Math. Logic 44(8), 1045–1065 (2005)
3. Barmpalias, G., Lewis, A.: The Hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees, to appear in Notre Dame Journal of Formal Logic
4. Cooper, S.B.: Computability Theory. Chapman & Hall/ CRC Press, Boca Raton (2004)
5. Lachlan, A.H.: On the lattice of recursively enumerable sets. Trans. Am. Math. Soc. 130, 1–37 (1968)