{"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[13,2,13,3],[14,2,14,3],[18,2,18,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910788741703321"]
[null,null,"Autore",null,"Greenberg Noam <1974->"]
[null,null,"Titolo",null,"The role of true finiteness in the admissible recursively enumerable degrees / / Noam Greenberg"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [2006]"]
[{"$nulls":4},"©2006"]
[null,null,"ISBN",null,"1-4704-0458-3"]
[null,null,"Descrizione fisica",null,"1 online resource (114 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society, , 0065-9266 ; ; number 854"]
[null,null,"Disciplina",null,"510 s"]
[{"$nulls":4},"511.3/5"]
[null,null,"Soggetti",null,"Recursion theory"]
[{"$nulls":4},"Recursively enumerable sets"]
[{"$nulls":4},"Finite, The"]
[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","\"Volume 181, number 854 (third of 5 numbers).\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"Contents\"\"; \"\"Chapter 1. Introduction\"\"; \"\"1. The Results\"\"; \"\"Chapter 2. Coding Into the R.E. Degrees\"\"; \"\"1. The Coding\"\"; \"\"2. A Template for the Constructions\"\"; \"\"3. Various Constructions\"\"; \"\"Chapter 3. Coding Effective Successor Models\"\"; \"\"1. Construction\"\"; \"\"2. Verifications\"\"; \"\"Chapter 4. A Negative Result Concerning Effective Successor Models\"\"; \"\"1. Preparation: Some Complexity Calculations\"\"; \"\"2. More on Effective Models\"\"; \"\"3. Examples of Î± and U\"\"; \"\"Chapter 5. A Nonembedding Result\"\"; \"\"Chapter 6. Embedding the 1-3-1 Lattice\"\"; \"\"1. Preparation\"\"; \"\"2. The Embedding\"\""]
[{"$nulls":4},"\"\"Appendix A. Basics\"\"\"\"Appendix B. The Jump\"\"; \"\"Appendix C. The Projectum\"\"; \"\"Appendix D. The Admissible Collapse\"\"; \"\"Appendix E. Prompt Permission\"\"; \"\"Bibliography\"\""]