Advertisement

Basis Theorems

  • Robert I. Soare
Chapter
Part of the Theory and Applications of Computability book series (THEOAPPLCOM)

Abstract

The main theme of this chapter is this: Given a nonempty \(\Pi_{1}^0\) class \(\mathcal{C}\) What are the Turing degrees of members \(f\in \mathcal{C}\)?

Keywords

Computable Function Extendible Node Basis Theorem Computable Tree Turing Degree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Robert I. Soare
    • 1
  1. 1.Department of MathematicsThe University of ChicagoChicagoUSA

Personalised recommendations