• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Recursion Theory: Computational Aspects of Definability

Recursion Theory: Computational Aspects of Definability

Hardcover

Series: de Gruyter Logic and Its Applications, Book 8

FictionGeneral ComputersGeneral Mathematics

ISBN10: 3110275554
ISBN13: 9783110275551
Publisher: De Gruyter
Published: Jul 30 2015
Pages: 320
Weight: 1.57
Height: 0.75 Width: 6.69 Depth: 9.61
Language: English

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.

Also in

General Computers