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

Contents: Recursive Enumerability and the Jump Operator; On the Degrees Less Than 0'; A Simple Set Which Is Not Effectively Simple; The Recursively Enumerable Degrees Are Dense; Metarecursive Sets (with G Kreisel); Post's Problem, Admissible Ordinals and Regularity; On a Theorem of Lachlan and Marlin; A Minimal Hyperdegree (with R O Gandy); Measure-Theoretic Uniformity in Recursion Theory and Set Theory; Forcing with Perfect Closed Sets; Recursion in Objects of Finite Type; The a-Finite Injury Method (with S G Simpson); Remarks Against Foundational Activity; Countable Admissible Ordinals and Hyperdegrees; The 1-Section of a Type n Object; The k-Section of a Type n Object; Post's Problem, Absoluteness and Recursion in Finite Types; Effective Bounds on Morley Rank; On the Number of Countable Models; Post's Problem in E-Recursion; The Limits of E-Recursive Enumerability; Effective Versus Proper Forcing.

This invaluable book is a collection of 31 important both inideas and results papers published by mathematical logicians inthe 20th Century. The papers have been selected by Professor Gerald ESacks. Some of the authors are Gdel, Kleene, Tarski, A Robinson, Kreisel, Cohen, Morley, Shelah, Hrushovski and Woodin.

The first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning.

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part II includes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory. The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.

The description for this book, Degrees of Unsolvability. (AM-55), Volume 55, will be forthcoming.