Recursion Theory: Computational Aspects Of Definability

Please refer to the section BELOW (and NOT ABOVE) this line for the product details
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Title:Recursion Theory: Computational Aspects Of Chi Tat (Author), Yu, Liang (Author)Description:This Monograph Presents Recursion Theory From A Generalized Point Of View Centered On The Computational Aspects Of Definability A Major Theme Is The Study Of The Structures Of Degrees Arising From Two Key Notions Of Reducibility, The Turing Degrees And The Hyperdegrees, Using Techniques And Ideas From Recursion Theory, Hyperarithmetic Theory, And Descriptive Set Theory The Emphasis Is On The Interplay Between Recursion Theory And Set Theory, Anchored On The Notion Of Definability The Monograph Covers A Number Of Fundamental Results In Hyperarithmetic Theory As Well As Some Recent Results On The Structure Theory Of Turing And Hyperdegrees It Also Features A Chapter On The Applications Of These Investigations To Higher Randomness Binding:Hardcover, HardcoverPublisher:de GruyterPublication Date:2015-07-30Dimensions:0.75\'\' H x 9.61\'\' L x 6.69\'\' WNumber of Pages:320Language:English