Skip to main content
  • Book
  • © 1987

Recursively Enumerable Sets and Degrees

A Study of Computable Functions and Computably Generated Sets


  • Standard reference

Part of the book series: Perspectives in Mathematical Logic (PML)

Buying options

Softcover Book USD 119.99
Price excludes VAT (USA)

About this book

..."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


  • Mathematical logic
  • comptutation
  • recursion theory
  • theoretical computer science
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

Softcover Book USD 119.99
Price excludes VAT (USA)