LEADER 01779nam  2200505   450 
001 9910794003503321
005 20201010074155.0
010   $a1-4704-6136-6
035   $a(CKB)4100000011309197
035   $a(MiAaPQ)EBC6229930
035   $a(RPAM)21609899
035   $a(PPN)250423286
035   $a(EXLCZ)994100000011309197
100   $a20201010d2020      uy             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aMinimal weak truth table degrees and computably enumerable Turing degrees /$fRodney G. Downey, Keng Meng Ng, Reed Solomon
210  1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d2020.
215   $a1 online resource (104 pages)
225 1 $aMemoirs of the American Mathematical Society ;$vVolume 265, Number 1284
311   $a1-4704-4162-4 
320   $aIncludes bibliographical references.
327   $aInformal construction -- Formal construction -- Limiting results.
410  0$aMemoirs of the American Mathematical Society ;$vVolume 265, Number 1284.
606   $aUnsolvability (Mathematical logic)
606   $aRecursively enumerable sets
606   $aComputable functions
615  0$aUnsolvability (Mathematical logic)
615  0$aRecursively enumerable sets.
615  0$aComputable functions.
676   $a511.3/5
686   $a03D25$a03D28$a03D30$2msc
700   $aDowney$b R. G$g(Rod G.),$0930867
702   $aNg$b Keng Meng
702   $aSolomon$b Reed
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910794003503321
996   $aMinimal weak truth table degrees and computably enumerable Turing degrees$93694408
997   $aUNINA