Archive for Mathematical Logic Logic

A diamond embedding in the computably enumerable quasi degrees

Kai Jun Khoo, Keng Meng Ng
Springer Nature · 2026-10-29 · DOI 10.1007/s00153-026-01037-z

Abstract

Abstract We investigate the relationship between $$\le _{Q}$$ ≤ Q and $$\le _{T}$$ ≤ T on the computably enumerable sets by asking what kind of lattices can be embedded in the computably enumerable Q degrees, with elements of the lattice in the same Turing degree. We will use a pinball machine to show that the diamond lattice can be embedded in the computably enumerable Q degrees, with all elements of the lattice in the same Turing degree.

Read at publisher →