01495nam 2200445 450 99654683420331620230704004333.09783031269042(electronic bk.)9783031269035(MiAaPQ)EBC7253098(Au-PeEL)EBL7253098(OCoLC)1381711965(PPN)270617094(EXLCZ)992677317440004120230704d2023 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierAlgorithms for constructing computably enumerable sets /Kenneth J. SupowitCham, Switzerland :Springer,[2023]©20231 online resource (191 pages)Computer Science Foundations and Applied Logic SeriesPrint version: Supowit, Kenneth J. Algorithms for Constructing Computably Enumerable Sets Cham : Springer International Publishing AG,c2023 9783031269035 Includes bibliographical references.Computer Science Foundations and Applied Logic SeriesAlgorithmsSet theoryAlgorithms.Set theory.004.0151Supowit Kenneth J.1359561MiAaPQMiAaPQMiAaPQ996546834203316Algorithms for Constructing Computably Enumerable Sets3374026UNISA