Recursively Enumerable Sets and Degrees - Robert I. Soare

Recursively Enumerable Sets and Degrees

A Study of Computable Functions and Computably Generated Sets

(Autor)

Buch | Softcover
XVIII, 437 Seiten
2014 | 1. Softcover reprint of the original 1st ed. 1987
Springer Berlin (Verlag)
978-3-540-66681-3 (ISBN)
117,69 inkl. MwSt
..."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
Erscheint lt. Verlag 23.8.2014
Reihe/Serie Perspectives in Mathematical Logic
Zusatzinfo XVIII, 437 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 691 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Allgemeines / Lexika
Mathematik / Informatik Mathematik Logik / Mengenlehre
Schlagworte Algorithm analysis and problem complexity • comptutation • Mathematical Logic • recursion theory • theoretical computer science
ISBN-10 3-540-66681-8 / 3540666818
ISBN-13 978-3-540-66681-3 / 9783540666813
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich