01779nam 2200505 450 991081291720332120201010074155.01-4704-6136-6(CKB)4100000011309197(MiAaPQ)EBC6229930(RPAM)21609899(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.Informal construction -- Formal construction -- Limiting results.Memoirs of the American Mathematical Society ;Volume 265, Number 1284.Unsolvability (Mathematical logic)Recursively enumerable setsComputable functionsUnsolvability (Mathematical logic)Recursively enumerable sets.Computable functions.511.3/503D2503D2803D30mscDowney R. G(Rod G.),930867Ng Keng MengSolomon ReedMiAaPQMiAaPQMiAaPQBOOK9910812917203321Minimal weak truth table degrees and computably enumerable Turing degrees4109914UNINA