16 Pages

A Uniformity of Degree Structures

WithAndré Nies

We isolate a fact which holds for various degree structures arising from recursion theory and complexity theory and makes it possible to prove the undecidability of their theories in a more uniform way than in the original proofs, namely by interpreting the lattice of Σ k 0 -sets for some k.

Dedicated to Kena Prosper