Recursion-Theoretic Hierarchies

Recursion-Theoretic Hierarchies PDF

Author: Peter G. Hinman

Publisher: Cambridge University Press

Published: 2017-03-02

Total Pages: 493

ISBN-13: 1107168244

DOWNLOAD EBOOK →

The theory set out in this book results from the meeting of descriptive set theory and recursion theory.

Recursion-Theoretic Hierarchies

Recursion-Theoretic Hierarchies PDF

Author: P. G. Hinman

Publisher: Springer

Published: 1978-05-01

Total Pages: 482

ISBN-13: 9783540079040

DOWNLOAD EBOOK →

At a recent meeting of logicians, one speaker complained - mainly, but perhaps not wholly, in jest - that logic is tightly controlled by a small group of people (the cabal) who exercise careful control over the release of new ideas to the general public (especially students) and indeed suppress some material com pletely. The situation is surely not so grim as this, but any potential reader of this book must have felt at some time that there is at least a minor conspiracy to keep new ideas inaccessible until the "insiders" have worked them over thoroughly. In particular he might well feel this way about the whole subject of Generalized Recursion Theory, which developed in the second half of the 1960s. The basic definitions and results on recursion involving functionals of higher type appeared in the monumental but extremely difficult paper Kleene [1959] and [1963]. Gandy [1967] gave another presentation ab initio, but the planned part II of this paper, as well as several other major advances in the subject, never appeared in print. For the theory of recursion on ordinals, the situation was even worse. Much of the basic material had appeared only in the abstracts Kripke [1964, 1964a], and although certain parts of the theory had been worked out in papers such as Kreisel-Sacks [1965] and Sacks [1967], there was no reasonably complete account of the basic facts of the subject in print.

Recursion Theory

Recursion Theory PDF

Author: Joseph R. Shoenfield

Publisher: CRC Press

Published: 2018-04-27

Total Pages: 85

ISBN-13: 1351419412

DOWNLOAD EBOOK →

This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.

Higher Recursion Theory

Higher Recursion Theory PDF

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.

Classical Recursion Theory

Classical Recursion Theory PDF

Author: P. Odifreddi

Publisher: Elsevier

Published: 1992-02-04

Total Pages: 667

ISBN-13: 9780080886596

DOWNLOAD EBOOK →

1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

Computable Structures and the Hyperarithmetical Hierarchy

Computable Structures and the Hyperarithmetical Hierarchy PDF

Author: C.J. Ash

Publisher: Elsevier

Published: 2000-06-16

Total Pages: 363

ISBN-13: 0080529526

DOWNLOAD EBOOK →

This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).

Recursion Theory

Recursion Theory PDF

Author: Chi Tat Chong

Publisher: Walter de Gruyter GmbH & Co KG

Published: 2015-08-17

Total Pages: 320

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.