Contributions to Recursion Theory
Title | Contributions to Recursion Theory PDF eBook |
Author | David Seetapun |
Publisher | |
Pages | |
Release | 1991 |
Genre | |
ISBN |
Contributions to Higher Recursion Theory
Title | Contributions to Higher Recursion Theory PDF eBook |
Author | Sherry Elizabeth Marcus |
Publisher | |
Pages | 132 |
Release | 1993 |
Genre | |
ISBN |
Higher Recursion Theory
Title | Higher Recursion Theory PDF eBook |
Author | Gerald E. Sacks |
Publisher | Cambridge University Press |
Pages | 361 |
Release | 2017-03-02 |
Genre | Computers |
ISBN | 1107168430 |
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Contributions to [alpha]- and [beta]-recursion Theory
Title | Contributions to [alpha]- and [beta]-recursion Theory PDF eBook |
Author | Wolfgang Maass |
Publisher | |
Pages | 120 |
Release | 1978 |
Genre | Mathematics |
ISBN |
Contributions to Recursion Theory on Higher Types
Title | Contributions to Recursion Theory on Higher Types PDF eBook |
Author | Leo Anthony Harrington |
Publisher | |
Pages | 192 |
Release | 1973 |
Genre | |
ISBN |
Recursion Theory for Metamathematics
Title | Recursion Theory for Metamathematics PDF eBook |
Author | Raymond M. Smullyan |
Publisher | Oxford University Press |
Pages | 180 |
Release | 1993-01-28 |
Genre | Mathematics |
ISBN | 0195344812 |
This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
Recursion Theory
Title | Recursion Theory PDF eBook |
Author | Chi Tat Chong |
Publisher | Walter de Gruyter GmbH & Co KG |
Pages | 409 |
Release | 2015-08-17 |
Genre | Mathematics |
ISBN | 311038129X |
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.