Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8 - Hardcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Chi Tat Chong, National University of Singapore; Liang Yu, Nanjing University, Jiangsu, China.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Recursion Theory: Computational Aspects of Definability...
Stock Image
Recursion Theory
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9783110275551
Buy New
£ 140.04
Shipping:
£ 5.02
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783110275551_new
Buy New
£ 134.64
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Recursion Theory
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9783110275551
Seller Image
Recursion Theory
Published by
De Gruyter, De Gruyter Jul 2015, 2015
ISBN 10: 3110275554
ISBN 13: 9783110275551
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783110275551
Seller Image
Recursion Theory
Print on DemandSeller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: 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. Seller Inventory # 59980346
Seller Image
Recursion Theory | Computational Aspects of Definability
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 104462364
Seller Image
Recursion Theory
Published by
De Gruyter, De Gruyter Akademie Forschung Jul 2015, 2015
ISBN 10: 3110275554
ISBN 13: 9783110275551
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783110275551
Seller Image
Recursion Theory : Computational Aspects of Definability
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783110275551
Stock Image
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic and Its Applications, 8)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020052032
Seller Image
Recursion Theory
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardback. Condition: 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. Seller Inventory # LU-9783110275551