|
|
|
|
| LEADER |
02560nmm a2200373 u 4500 |
| 001 |
EB000291300 |
| 003 |
EBX01000000000000000087631 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
110501 ||| eng |
| 020 |
|
|
|a 9780080886596
|
| 050 |
|
4 |
|a QA9.6
|
| 100 |
1 |
|
|a Odifreddi, Piergiorgio
|
| 245 |
0 |
0 |
|a Classical recursion theory
|b the theory of functions and sets of natural numbers
|c Piergiorgio Odifreddi
|
| 260 |
|
|
|a Amsterdam
|b Elsevier
|c 1992, 1992
|
| 300 |
|
|
|a xix, 668 pages
|b illustrations
|
| 505 |
0 |
|
|a Front Cover; Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers; Copyright Page; Foreword; Preface; Preface to the Second Edition; Contents; Introduction; Chapter I. Recursiveness and Computability; Chapter II. Basic Recursion Theory; Chapter III. Post's Problem and Strong Reducibilities; Chapter IV. Hierarchies and Weak Reducibilities; Chapter V. Turing Degrees; Chapter VI. Many-One and Other Degrees; Bibliography; Notation Index; Subject Index
|
| 505 |
0 |
|
|a Includes bibliographical references and indexes
|
| 653 |
|
|
|a Recursion theory / http://id.loc.gov/authorities/subjects/sh85112012
|
| 653 |
|
|
|a MATHEMATICS / Logic / bisacsh
|
| 653 |
|
|
|a Recursion theory / fast / (OCoLC)fst01091982
|
| 653 |
|
|
|a Théorie de la récursivité
|
| 653 |
|
|
|a MATHEMATICS / Infinity / bisacsh
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Studies in logic and the foundations of mathematics
|
| 500 |
|
|
|a "First edition 1989"--Title page verso
|
| 776 |
|
|
|z 0444894837
|
| 776 |
|
|
|z 9780080886596
|
| 776 |
|
|
|z 0080886590
|
| 776 |
|
|
|z 9780444894830
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/0049237X/125
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.3/5
|
| 520 |
|
|
|a 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
|