Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) (Hardback)
$127.17 - Save $21.83 14% off - RRP $149.00 Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 48 hours | |Short Description for Recursively Enumerable Sets and Degrees Presents an account of the theory of recursively enumerable degrees. This book is suitable for those interested in logic.
Full description- Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Published: 05 April 2006
- Format: Hardback 455 pages
- See: Full bibliographic data
- Categories: Teaching Resources & Education | Mathematical Logic | Science: General Issues | Algorithms & Data Structures | Computer Science
- ISBN 13: 9783540152996 ISBN 10: 3540152997
Other books
Full description for Recursively Enumerable Sets and Degrees
..."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 fur Mathematik, 623.1988
