Recursively Enumerable Sets and Degrees
A Study of Computable Functions and Computably Generated Sets
Published on 23. August 2014
Book
Paperback/Softback
XVIII, 437 pages
978-3-540-66681-3 (ISBN)
Description
..."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
More details
Series
Edition
Softcover reprint of the original 1st ed. 1987
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XVIII, 437 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 25 mm
Weight
692 gr
ISBN-13
978-3-540-66681-3 (9783540666813)
DOI
10.1007/978-3-662-02460-7
Schweitzer Classification
Other editions
Additional editions
Robert I. Soare
Recursively Enumerable Sets and Degrees
A Study of Computable Functions and Computably Generated Sets
Book
11/1999
Springer
€85.59
Article exhausted; check different version
Person
Robert Soare is the Paul Snowden Russell Distinguished Service Professor Emeritus of Mathematics and Computer Science at the University of Chicago. He was the founding chairman of the Department of Computer Science in 1983. He has supervised the dissertations of nineteen Ph.D. students using the content of this book. He wrote the primary reference on computability theory for students and researchers: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Springer, 1987). He is the author of numerous papers on computability theory and mathematical logic. His 1974 Annals of Mathematics paper on automorphisms of computably enumerable sets was selected in the 2003 book by Gerald Sacks as one of the most important in mathematical logic in the twentieth century. He has been an invited speaker at the International Congress of Mathematicians, and a plenary speaker at the International Congress of Logic, Methodology, and Philosophy of Science, the Association of Symbolic Logic Centennial in 2000, the British Mathematical Colloquium in 2012, the Royal Society Meeting on the Incomputable in 2012, and Computability in Europe (CiE) in 2007 and 2012. He was the winner of the 2011 University of Chicago Award for Excellence in Graduate Teaching and is a Fellow of the American Mathematical Society.