Recursion Theory: Computational Aspects of Definability: 8 - Rilegato
Libro 8 di 10: De Gruyter Series in Logic and Its Applications
Sinossi
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.
Informazioni sull?autore
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.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Recursion Theory: Computational Aspects of Definability:...
Immagini fornite dal venditore
Recursion Theory
Editore:
De Gruyter, De Gruyter Jul 2015, 2015
ISBN 10: 3110275554
ISBN 13: 9783110275551
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
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
Compra nuovo
EUR 144,95
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Recursion Theory
Print on DemandDa: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L1-9783110275551
Compra nuovo
EUR 169,10
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Recursion Theory
Print on DemandDa: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L1-9783110275551
Compra nuovo
EUR 164,66
Spese di spedizione:
EUR 5,73
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783110275551_new
Compra nuovo
EUR 158,32
Spese di spedizione:
EUR 13,68
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Recursion Theory
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
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
Compra nuovo
EUR 128,06
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Recursion Theory | Computational Aspects of Definability
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Recursion Theory | Computational Aspects of Definability | Liang Yu (u. a.) | Buch | 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
Compra nuovo
EUR 133,50
Spese di spedizione:
EUR 70,00
Da: Germania a: U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Recursion Theory
Editore:
De Gruyter, De Gruyter Akademie Forschung Jul 2015, 2015
ISBN 10: 3110275554
ISBN 13: 9783110275551
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 322 pp. Englisch. Codice articolo 9783110275551
Compra nuovo
EUR 144,95
Spese di spedizione:
EUR 60,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Recursion Theory : Computational Aspects of Definability
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783110275551
Compra nuovo
EUR 144,95
Spese di spedizione:
EUR 63,64
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020052032
Compra nuovo
EUR 245,11
Spese di spedizione:
EUR 3,44
In U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Recursion Theory
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. 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. Codice articolo LU-9783110275551
Compra nuovo
EUR 287,47
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: Più di 20 disponibili