• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

Paperback

Series: Perspectives in Mathematical Logic

FictionGeneral EducationGeneral Science

ISBN10: 3540666818
ISBN13: 9783540666813
Publisher: Springer Nature
Published: Aug 23 2014
Pages: 437
Weight: 1.41
Height: 0.93 Width: 6.14 Depth: 9.21
Language: English
...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

Also in

General Science