Degrees of unsolvability : local and global theory / Manuel Lerman.
Material type: TextSeries: Perspectives in logicPublication details: Cambridge : Cambridge University Press, 2016.Description: xiii, 307 pages : illustrations ; 24 cmISBN:- 9781107168138
- 511.3 23 L616
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 511.3 L616 (Browse shelf(Opens below)) | Available | 138046 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
511.3 L533 Resolution calculus | 511.3 L616 Degrees of unsolvability : local and global theory | 511.3 L616 Logic year,1979- 80 | 511.3 L616 Degrees of unsolvability : | 511.3 L674 Unsolvable classes of quantificational formulas | 511.3 L693 Integration of fuzzy logic and chaos theory | 511.3 L693 Introduction to Kolmogorov complexity and its applications |
Includes bibliographical references and indexes.
I. Recursive functions --
II. Embeddings and extensions of embeddings in the degrees --
III. The jump operator --
IV. High/Low Hierarchies --
V. Minimal degrees --
VI. Finite distributive lattices --
VII. Finite lattices --
VIII. Countable usis --
IX. Minimal degrees and high/low hierarchies --
X. Jumps of minimal degrees --
XI. Bounding minimal degrees with recursively enumerable degrees --
XII. Initial segments of D [0,0} --
Appendices.
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.
There are no comments on this title.