Definability in the Turing degrees
From MaRDI portal
Publication:1075320
zbMath0592.03030MaRDI QIDQ1075320
Theodore A. Slaman, W. Hugh Woodin
Publication date: 1986
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (23)
THE TURING DEGREES BELOW GENERICS AND RANDOMS ⋮ Coding in the partial order of enumerable sets ⋮ The theory of the \(\alpha \) degrees is undecidable ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ The theory of ceers computes true arithmetic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The enumeration degrees: Local and global structural interactions ⋮ An oracle builder's toolkit ⋮ Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms ⋮ The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability ⋮ The relationship between local and global structure in the enumeration degrees ⋮ The \(\omega\)-Turing degrees ⋮ Computing sets from all infinite subsets ⋮ Generic degrees are complemented ⋮ The First Order Theories of the Medvedev and Muchnik Lattices ⋮ Defining totality in the enumeration degrees ⋮ Embedding and coding below a 1-generic degree ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ On the theory of the PTIME degrees of the recursive sets ⋮ A non-splitting theorem for d.r.e. sets ⋮ Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$
This page was built for publication: Definability in the Turing degrees
