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