Peter G. Hinman

Recursion-Theoretic Hierarchies (eBook, PDF)

• Format: PDF

Produktbeschreibung

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. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 2. März 2017
• Englisch
• ISBN-13: 9781316731666
• Artikelnr.: 48197549

Autorenporträt

Peter G. Hinman works in the Department of Mathematics at the University of Michigan, Ann Arbor.

Inhaltsangabe

Introduction
Part I. Basic Notations of Definability: 1. Groundwork
2. Ordinary recursion theory
3. Hierarchies and definability
Part II. The Analytical and Projective Hierarchies: 4. The first level
5. ¿^1_2 and beyond
Part III. Generalized Recursion Theories: 6. Recursion in a type-2 functional
7. Recursion in a type-3 functional
8. Recursion on ordinals
Epilogue
References
Global notational conventions
Special notations
Index.