Recursion Theory: Computational Aspects of Definability: 8 (De Gruyter Series in Logic & its Applications, 8) - Hardcover
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
Críticas:
"This book serves two purposes, and does so very well. In Part I, it provides an exposition of the now-classical theory of definability in first-order arithmetic, in the form of the arithmetic hierarchy, and in second-order arithmetic, in the form of effective descriptive set theory. This part would be a good source on which to base a graduate course on this material. In Parts II-IV, by giving a coherent and systematic treatment spanning many modern examples, it illustrates how these classical ideas have evolved into powerful mathematical tools, which is valuable both to newcomers and to experts." Mathematical Reviews "This is a very well written book by researchers who contributed with significant results to the field, the treatment is mathematical rigourous, with important open problems, and an up-dated list of references. The book is suited for advanced courses and research." Zentralblatt f r Mathematik
Reseña del editor:
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagDe Gruyter
- Erscheinungsdatum2015
- ISBN 10 3110275554
- ISBN 13 9783110275551
- EinbandTapa dura
- Anzahl der Seiten322
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 158,21
Versand:
EUR 32,99
Von Deutschland nach USA
Beste Suchergebnisse beim ZVAB
Foto des Verkäufers
Recursion Theory : Computational Aspects of Definability
Anbieter:
Bewertung
Buchbeschreibung Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness. Artikel-Nr. 9783110275551
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 158,21
Währung umrechnen