{"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":18,"n_cols":5,"rows_kept":18,"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],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910829189303321"]
[null,null,"Autore",null,"Epstein Richard L. <1947->"]
[null,null,"Titolo",null,"Initial segments of degrees below 0' / / Richard L. Epstein"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [1981]"]
[{"$nulls":4},"©1981"]
[null,null,"ISBN",null,"1-4704-0648-9"]
[null,null,"Descrizione fisica",null,"1 online resource (111 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society, , 0065-9266 ; ; volume 30, number 241 (March 1981)"]
[null,null,"Disciplina",null,"510 s"]
[{"$nulls":4},"511.3"]
[null,null,"Soggetti",null,"Recursion theory"]
[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 30 ... (second of 3 numbers).\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"\"\"TABLE OF CONTENTS\"\"; \"\"ABSTRACT\"\"; \"\"INTRODUCTION\"\"; \"\"CHAPTER 1: â??* D(<0')\"\"; \"\"Motivation\"\"; \"\"Construction\"\"; \"\"Order of Proof\"\"; \"\"Limit Lemmas\"\"; \"\"T*[sub(e)]\"\"; \"\"The S-O nature of T*[sub(e)]\"\"; \"\"Constructive Computation Lemma (on the odds)\"\"; \"\"Corollaries\"\"; \"\"CHAPTER 2: Ï?+1 â??* D(<0')\"\"; \"\"A. Introduction\"\"; \"\"B. â??* D(<0')\"\"; \"\"C. Ï?+1 â??* D(<0')\"\"; \"\"D. Corollaries\"\"; \"\"CHAPTER 3: THE JOIN TECHNIQUE BELOW HIGH R.E. DEGREES\"\"; \"\"Introduction\"\"; \"\"A. The join for an r.e. degree below a high r.e. degree\"\"; \"\"B. Complements for r.e. degrees below a high r.e. degree\"\""]
[{"$nulls":4},"\"\"CHAPTER 4: JOINS AND Ï?+1 â??* D(<0')\"\"\"\"A. Simple joins\"\"; \"\"B. Corollary: functions â??[sub(T)] 0(sup(2)]) and joins\"\"; \"\"APPENDIX A: ARITHMETIC â?¡ D(<0')\"\"; \"\"APPENDIX B: CORRECTIONS TO DEGREES OF UNSOLVABILITY AND TO MINIMAL DEGREES\"\"; \"\"NOTES\"\"; \"\"BIBLIOGRAPHY\"\"; \"\"INDEX\"\""]