Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) - Hardcover

R. I. Soare

Hardcover

ISBN 10: 0387152997 ISBN 13: 9780387152998

Publisher: Springer, 2004

Synopsis

The first part consists of an introduction to the theory of computation and recursive function theory, including definitions of computable functions, Turing machines, partial recursive functions, recursively enumerable sets, the Kleene recursion theorem etc. The second part is a comprehensive study of recursively enumerable sets and their degrees.

About this title

From the Back Cover

..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. .... The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists." Acta Scientiarum Mathematicarum, Ungarn 1988 ..."The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be." Zentralblatt für Mathematik, 623.1988

Edition details

• Publisher: Springer
• Publication date: 2004
• ISBN 10: 0387152997
• ISBN 13: 9780387152998
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 437