The search for natural definability in the Turing degrees

Andrew Lewis-Pye · Computability · 2017

We give an introduction to the Turing degrees, aimed principally at those who have some experience with computability theory, but not necessarily with techniques specific to the study of the local degrees. The focus is on establishing which definable

Read the paper · More papers on PaperTik