{"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":19,"n_cols":5,"rows_kept":19,"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],[9,2,9,3],[13,2,13,3],[14,2,14,3],[18,2,18,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910480580303321"]
[null,null,"Autore",null,"Epstein Richard L. <1947->"]
[null,null,"Titolo",null,"Minimal degrees of unsolvability and the full approximation construction / / Richard L. Epstein"]
[null,null,"Pubbl/distr/stampa",null,"Providence : , : American Mathematical Society, , [1975]"]
[{"$nulls":4},"©1975"]
[null,null,"ISBN",null,"1-4704-0644-6"]
[null,null,"Descrizione fisica",null,"1 online resource (147 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society ; ; volume 3, issue 1, number 162 (September 1975)"]
[null,null,"Disciplina",null,"511/.3"]
[null,null,"Soggetti",null,"Unsolvability (Mathematical logic)"]
[{"$nulls":4},"Recursive functions"]
[{"$nulls":4},"Constructive mathematics"]
[{"$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","Originally presented as the author's thesis, University of California, Berkeley."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"\"\"TABLE OF CONTENTS\"\"; \"\"ACKNOWLEDGEMENTS\"\"; \"\"INTRODUCTION\"\"; \"\"CHAPTER I: A MINIMAL DEGREE\"\"; \"\"Functionals and Trees\"\"; \"\"Splitting Trees and Computation Lemmas\"\"; \"\"A Minimal Degree\"\"; \"\"CHAPTER II: A MINIMAL DEGREE m < 0'\"\"; \"\"Motivation\"\"; \"\"Boundary Strings and Dummy Extensions\"\"; \"\"Construction of m < 0'\"\"; \"\"Proof\"\"; \"\"T*[sub(e)]\"\"; \"\"CHAPTER III: A MINIMAL DEGREE such that m' = 0'\"\"; \"\"Motivation\"\"; \"\"Construction of m = 0'\"\"; \"\"Proof\"\"; \"\"CHAPTER IV: MINIMAL DEGREES AND THE JUMP OPERATOR\"\"; \"\"Motivation\"\"; \"\"Further Topics and Remarks\"\"; \"\"CHAPTER V: A MINIMAL DEGREE m < a r.e.\"\""]