Manuel Lerman works in the Department of Mathematics at the University of Connecticut.

Select Guide Rating

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

Manuel Lerman works in the Department of Mathematics at the University of Connecticut.

Select Guide Rating

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

Manuel Lerman works in the Department of Mathematics at the University of Connecticut.

Select Guide Rating

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