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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9783110275551
Quantità: 15 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 23475739-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783110275551_new
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Hardcover. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 eff. Codice articolo 59980346
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 23475739-n
Quantità: Più di 20 disponibili
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Codice articolo f940d50062c1d25914fe8d45490ee073
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 23475739
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. digital original edition. 306 pages. 9.13x6.57x1.11 inches. In Stock. Codice articolo __3110275554
Quantità: 2 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 322 pp. Englisch. Codice articolo 9783110275551
Quantità: 2 disponibili
Da: preigu, Osnabrück, Germania
Buch. Condizione: Neu. Recursion Theory | Computational Aspects of Definability | Liang Yu (u. a.) | Buch | ISSN | XIV | Englisch | 2015 | De Gruyter | EAN 9783110275551 | Verantwortliche Person für die EU: Walter de Gruyter GmbH, De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu Print on Demand. Codice articolo 104462364
Quantità: 5 disponibili