Fundamentals of Generalized Recursion Theory
Author: M. Fitting
Publisher: Elsevier
Published: 2011-08-18
Total Pages: 329
ISBN-13: 0080960316
DOWNLOAD EBOOK →Fundamentals of Generalized Recursion Theory
Author: M. Fitting
Publisher: Elsevier
Published: 2011-08-18
Total Pages: 329
ISBN-13: 0080960316
DOWNLOAD EBOOK →Fundamentals of Generalized Recursion Theory
Author: Jens Erik Fenstad
Publisher:
Published: 1974
Total Pages: 456
ISBN-13: 9780720422009
DOWNLOAD EBOOK →Author: Jens E. Fenstad
Publisher: Cambridge University Press
Published: 2017-03-02
Total Pages: 238
ISBN-13: 1107168163
DOWNLOAD EBOOK →This volume presents a unified and coherent account of the many and various parts of general recursion theory.
Author: Chi Tat Chong
Publisher: Walter de Gruyter GmbH & Co KG
Published: 2015-08-17
Total Pages: 409
ISBN-13: 311038129X
DOWNLOAD EBOOK →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.
Author: Lev D. Beklemishev
Publisher: Elsevier
Published: 2000-04-01
Total Pages: 416
ISBN-13: 9780080955025
DOWNLOAD EBOOK →Provability, Computability and Reflection
Author: Lev D. Beklemishev
Publisher: Elsevier
Published: 2000-04-01
Total Pages: 465
ISBN-13: 0080954898
DOWNLOAD EBOOK →Generalized Recursion Theory
Author: Chi Tat Chong
Publisher: Walter de Gruyter GmbH & Co KG
Published: 2015-08-17
Total Pages: 322
ISBN-13: 3110275643
DOWNLOAD EBOOK →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.
Author: Klaus Ambos-Spies
Publisher: Springer
Published: 2006-11-14
Total Pages: 398
ISBN-13: 3540471421
DOWNLOAD EBOOK →These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
Author: Gerald E. Sacks
Publisher: Cambridge University Press
Published: 2017-03-02
Total Pages: 361
ISBN-13: 1107168430
DOWNLOAD EBOOK →This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.