LEADER 00821cam0-22002891i-450-
001 990005002430403321
005 19990530
035   $a000500243
035   $aFED01000500243
035   $a(Aleph)000500243FED01
035   $a000500243
100   $a19990530d1951----km-y0itay50------ba
101 0 $alat
105   $aa-------001zy
200 1 $aChiromanzia$dChiromantia perfecta$fGaleotto Marzio da Narni$ga cura di Mario Frezza
210   $aNapoli$cPironti$d1951
215   $aLXVII, 135 p.$cill.$d20 cm
225 1 $aCollezione umanistica$v7
700  1$aGaleotto,$bMarzio$f<1427-1497>$0200729
702  1$aFrezza,$bMario
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990005002430403321
952   $aP.3 A1(1238)$fFLFBC
959   $aFLFBC
996   $aChiromanzia$9530114
997   $aUNINA

LEADER 02600nam  2200589   450 
001 9910788741703321
005 20170822144308.0
010   $a1-4704-0458-3
035   $a(CKB)3360000000465038
035   $a(EBL)3114184
035   $a(SSID)ssj0000889197
035   $a(PQKBManifestationID)11549049
035   $a(PQKBTitleCode)TC0000889197
035   $a(PQKBWorkID)10876199
035   $a(PQKB)11737566
035   $a(MiAaPQ)EBC3114184
035   $a(RPAM)14226134
035   $a(PPN)195417429
035   $a(EXLCZ)993360000000465038
100   $a20060111h20062006  uy|            0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 14$aThe role of true finiteness in the admissible recursively enumerable degrees /$fNoam Greenberg
210  1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2006]
210  4$d©2006
215   $a1 online resource (114 p.)
225 1 $aMemoirs of the American Mathematical Society,$x0065-9266 ;$vnumber 854
300   $a"Volume 181, number 854 (third of 5 numbers)."
311   $a0-8218-3885-7 
320   $aIncludes bibliographical references.
327   $a""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""
327   $a""Appendix A. Basics""""Appendix B. The Jump""; ""Appendix C. The Projectum""; ""Appendix D. The Admissible Collapse""; ""Appendix E. Prompt Permission""; ""Bibliography""
410  0$aMemoirs of the American Mathematical Society ;$vno. 854.
606   $aRecursion theory
606   $aRecursively enumerable sets
606   $aFinite, The
615  0$aRecursion theory.
615  0$aRecursively enumerable sets.
615  0$aFinite, The.
676   $a510 s
676   $a511.3/5
700   $aGreenberg$b Noam$f1974-$01567037
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910788741703321
996   $aThe role of true finiteness in the admissible recursively enumerable degrees$93838118
997   $aUNINA