LEADER 01495nam  2200445   450 
001 996546834203316
005 20230704004333.0
010   $a9783031269042$b(electronic bk.)
010   $z9783031269035
035   $a(MiAaPQ)EBC7253098
035   $a(Au-PeEL)EBL7253098
035   $a(OCoLC)1381711965
035   $a(PPN)270617094
035   $a(EXLCZ)9926773174400041
100   $a20230704d2023      uy             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aAlgorithms for constructing computably enumerable sets /$fKenneth J. Supowit
210  1$aCham, Switzerland :$cSpringer,$d[2023]
210  4$dİ2023
215   $a1 online resource (191 pages)
225 1 $aComputer Science Foundations and Applied Logic Series
311 08$aPrint version: Supowit, Kenneth J. Algorithms for Constructing Computably Enumerable Sets Cham : Springer International Publishing AG,c2023 9783031269035 
320   $aIncludes bibliographical references.
410  0$aComputer Science Foundations and Applied Logic Series
606   $aAlgorithms
606   $aSet theory
615  0$aAlgorithms.
615  0$aSet theory.
676   $a004.0151
700   $aSupowit$b Kenneth J.$01359561
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
912   $a996546834203316
996   $aAlgorithms for Constructing Computably Enumerable Sets$93374026
997   $aUNISA