Fr. 216.00

Degrees of Unsolvability - Local and Global Theory

English · Hardback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

Informationen zum Autor Manuel Lerman works in the Department of Mathematics at the University of Connecticut. Klappentext This volume presents a systematic study of the interaction between local and global degree theory. Zusammenfassung This volume presents a systematic study of the interaction between local and global degree theory. It 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. Inhaltsverzeichnis 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.

Product details

Authors Manuel Lerman, Manuel (University of Connecticut) Lerman
Publisher Cambridge University Press ELT
 
Languages English
Product format Hardback
Released 06.04.2017
 
EAN 9781107168138
ISBN 978-1-107-16813-8
No. of pages 321
Series Perspectives in Logic
Subject Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.