02602nam 2200589 450 991048051650332120170822144308.01-4704-0458-3(CKB)3360000000465038(EBL)3114184(SSID)ssj0000889197(PQKBManifestationID)11549049(PQKBTitleCode)TC0000889197(PQKBWorkID)10876199(PQKB)11737566(MiAaPQ)EBC3114184(PPN)195417429(EXLCZ)99336000000046503820060111h20062006 uy| 0engur|n|---|||||txtccrThe role of true finiteness in the admissible recursively enumerable degrees /Noam GreenbergProvidence, Rhode Island :American Mathematical Society,[2006]©20061 online resource (114 p.)Memoirs of the American Mathematical Society,0065-9266 ;number 854"Volume 181, number 854 (third of 5 numbers)."0-8218-3885-7 Includes bibliographical references.""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 α and U""; ""Chapter 5. A Nonembedding Result""; ""Chapter 6. Embedding the 1-3-1 Lattice""; ""1. Preparation""; ""2. The Embedding""""Appendix A. Basics""""Appendix B. The Jump""; ""Appendix C. The Projectum""; ""Appendix D. The Admissible Collapse""; ""Appendix E. Prompt Permission""; ""Bibliography""Memoirs of the American Mathematical Society ;no. 854.Recursion theoryRecursively enumerable setsFinite, TheElectronic books.Recursion theory.Recursively enumerable sets.Finite, The.510 s511.3/5Greenberg Noam1974-890449MiAaPQMiAaPQMiAaPQBOOK9910480516503321The role of true finiteness in the admissible recursively enumerable degrees1989083UNINA