Abstract: The three quantifier theory of , the recursively enumerable degrees under Turing reducibility, was proven undecidable by Lempp, Nies and Slaman (1998). The two quantifier theory includes the lattice embedding problem and its decidability is a long-standing open question. A negative solution to this problem seems out of reach of the standard methods of interpretation of theories because the language is relational. We prove the undecidability of a fragment of the theory of that lies between the two and three quantifier theories with but includes function symbols.

Theorem.The two quantifier theory of , the r.e. degrees with Turing reducibility, supremum and infimum (taken to be any total function extending the infimum relation on ) is undecidable.

The same result holds for various lattices of ideals of which are natural extensions of preserving join and infimum when it exits.