Degrees of Unsolvability
Local and Global Theory
Published on 22. March 2017
978-1-316-73163-5 (ISBN)
Description
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the eleventh publication in the Perspectives in Logic series, Manuel Lerman presents a systematic study of the interaction between local and global degree theory. He introduces the reader to the fascinating combinatorial methods of recursion theory while simultaneously showing how to use these methods to prove global theorems about degrees. The intended reader will have already taken a graduate-level course in recursion theory, but this book will also be accessible to those with some background in mathematical logic and a feeling for computability. It will prove a key reference to enable readers to easily locate facts about degrees and it will direct them to further results.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
42 Line drawings, black and white
File size
29,65 MB
ISBN-13
978-1-316-73163-5 (9781316731635)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
04/2017
Cambridge University Press
€154.30
Shipment within 15-20 days
Person
Manuel Lerman works in the Department of Mathematics at the University of Connecticut.
Content
Introduction; Part I. The Structure of the Degrees: 1. Recursive functions; 2. Embeddings and extensions of embeddings in the degrees; 3. The jump operator; 4. High/low hierarchies; Part II. Countable Ideals of Degrees: 5. Minimal degrees; 6. Finite distributive lattices; 7. Finite lattices; 8. Countable usls; Part III. Initial Segments ofD and the Jump Operator: 9. Minimal degrees and high/low hierarchies; 10. Jumps of minimal degrees; 11. Bounding minimal degrees with recursively enumerable degrees; 12. Initial segments of D [0,0']; Appendix A. Coding into structures and theories; Appendix B. lattice tables and representation theorems; References; Notation index; Subject index.
