Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125) (Volume 125)

Piergiorgio Odifreddi

ISBN 10: 0444894837 / ISBN 13: 9780444894830

Edité par North Holland, 1992

A propos de cet article

N° de réf. du vendeur ABLIING23Feb2215580212795

Détails bibliographiques

• Titre: Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers, Vol. 1 (Studies in Logic and the Foundations of Mathematics, Vol. 125) (Volume 125)
• Éditeur: North Holland
• Date de parution: 1992
• Langue: anglais
• ISBN à 10 chiffres: 0444894837
• ISBN à 13 chiffres: 9780444894830
• Reliure: Couverture souple
• État de l'article: New

A propos de ce titre

Synopsis

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 Goumldel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

Présentation de l'éditeur

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.