The search for natural definability in the Turing degrees

DOI10.3233/COM-170068zbMath1435.03070OpenAlexW2593451414MaRDI QIDQ4683152

Andrew E. M. Lewis-Pye

Publication date: 20 September 2018

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-170068

zbMATH Keywords

definabilitycomputabilitydegreesTuringjump classes

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (1)

Computably enumerable Turing degrees and the meet property

This page was built for publication: The search for natural definability in the Turing degrees