01659nam 2200481 450 991048082810332120201010074155.01-4704-6136-6(CKB)4100000011309197(MiAaPQ)EBC6229930(PPN)250423286(EXLCZ)99410000001130919720201010d2020 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierMinimal weak truth table degrees and computably enumerable Turing degrees /Rodney G. Downey, Keng Meng Ng, Reed SolomonProvidence, Rhode Island :American Mathematical Society,2020.1 online resource (104 pages)Memoirs of the American Mathematical Society ;Volume 265, Number 12841-4704-4162-4 Includes bibliographical references.Memoirs of the American Mathematical Society ;Volume 265, Number 1284.Unsolvability (Mathematical logic)Recursively enumerable setsComputable functionsElectronic books.Unsolvability (Mathematical logic)Recursively enumerable sets.Computable functions.511.3/5Downey R. G(Rod G.),930867Ng Keng MengSolomon ReedMiAaPQMiAaPQMiAaPQBOOK9910480828103321Minimal weak truth table degrees and computably enumerable Turing degrees2210231UNINA