LEADER 02489nam 2200565 450 001 9910480580303321 005 20180731044136.0 010 $a1-4704-0644-6 035 $a(CKB)3360000000464346 035 $a(EBL)3113464 035 $a(SSID)ssj0000973339 035 $a(PQKBManifestationID)11527850 035 $a(PQKBTitleCode)TC0000973339 035 $a(PQKBWorkID)10959569 035 $a(PQKB)11527574 035 $a(MiAaPQ)EBC3113464 035 $a(PPN)195410459 035 $a(EXLCZ)993360000000464346 100 $a20750625h19751975 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aMinimal degrees of unsolvability and the full approximation construction /$fRichard L. Epstein 210 1$aProvidence :$cAmerican Mathematical Society,$d[1975] 210 4$dİ1975 215 $a1 online resource (147 p.) 225 1 $aMemoirs of the American Mathematical Society ;$vvolume 3, issue 1, number 162 (September 1975) 300 $aOriginally presented as the author's thesis, University of California, Berkeley. 311 $a0-8218-1862-7 320 $aIncludes bibliographical references and index. 327 $a""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."" 410 0$aMemoirs of the American Mathematical Society ;$vnumber 162. 606 $aUnsolvability (Mathematical logic) 606 $aRecursive functions 606 $aConstructive mathematics 608 $aElectronic books. 615 0$aUnsolvability (Mathematical logic) 615 0$aRecursive functions. 615 0$aConstructive mathematics. 676 $a511/.3 700 $aEpstein$b Richard L.$f1947-$046609 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910480580303321 996 $aMinimal degrees of unsolvability and the full approximation construction$91911876 997 $aUNINA