{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":20,"n_cols":5,"rows_kept":20,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3],[13,2,13,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910460574303321"]
[null,null,"Autore",null,"Chong C.-T (Chi-Tat), <1949->"]
[null,null,"Titolo",null,"Recursion theory : computational aspects of definability / / Chi Tat Chong, Liang Yu"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, [Germany] ; ; Boston, [Massachusetts] : , : De Gruyter, , 2015"]
[{"$nulls":4},"©2015"]
[null,null,"ISBN",null,"3-11-038129-X"]
[{"$nulls":4},"3-11-027564-3"]
[null,null,"Descrizione fisica",null,"1 online resource (322 p.)"]
[null,null,"Collana",null,"De Gruyter Series in Logic and Its Applications, , 1438-1893 ; ; Volume 8"]
[null,null,"Disciplina",null,"511.3/5"]
[null,null,"Soggetti",null,"Recursion theory"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Front matter -- Preface -- Contents -- Part I: Fundamental theory -- 1 An introduction to higher recursion theory -- 2 Hyperarithmetic theory -- 3 Admissibility and constructibility -- 4 The theory of Π1 1-sets -- 5 Recursion-theoretic forcing -- 6 Set theory -- Part II: The story of Turing degrees -- 7 Classification of jump operators -- 8 The construction of Π1 1-sets -- 9 Independence results in recursion theory -- Part III: Hyperarithmetic degrees and perfect set property -- 10 Rigidity and bi-interpretability of hyperdegrees -- 11 Basis theorems -- Part IV: Higher randomness theory -- 12 Review of classical algorithmic randomness -- 13 More on hyperarithmetic theory -- 14 The theory of higher randomness -- A Open problems -- B An interview with Gerald E. Sacks -- C Notations and symbols -- Bibliography -- Index -- Backmatter"]
[null,null,null,"Sommario/riassunto","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 "]
[{"$nulls":4},"theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness."]