Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Piergiorgio Odifreddi
Series: Studies in Logic and the Foundations of Mathematics, Volume 125
Publisher: Elsevier
Year: 1992

Language: English
Pages: 669

Content:
Editors
Page ii

Edited By
Page iii

Copyright Page
Page iv

Dedication
Page v

Foreword
Page vii
G.E. Sacks

Preface
Pages ix-x

Preface to the Second Edition
Page xi

Introduction
Pages 1-16

Chapter I Recursiveness and Computability
Pages 17-123

Chapter II Basic Recursion Theory
Pages 125-249

Chapter III Post's Problem and Strong Reducibilities
Pages 251-360

Chapter IV Hierarchies and Weak Reducibilities
Pages 361-445

Chapter V Turing Degrees
Pages 447-553

Chapter VI Many-One and Other Degrees
Pages 555-601

Bibliography
Pages 603-641

Notation Index
Pages 643-647

Index
Pages 649-668