LEADER 02096nam  2200565   450 
001 996466663403316
005 20220908200906.0
010   $a3-540-37425-6
024 7 $a10.1007/BFb0087822
035   $a(CKB)1000000000438228
035   $a(SSID)ssj0000322060
035   $a(PQKBManifestationID)12064915
035   $a(PQKBTitleCode)TC0000322060
035   $a(PQKBWorkID)10281156
035   $a(PQKB)10475895
035   $a(DE-He213)978-3-540-37425-1
035   $a(MiAaPQ)EBC5594655
035   $a(Au-PeEL)EBL5594655
035   $a(OCoLC)1076259059
035   $a(MiAaPQ)EBC6842303
035   $a(Au-PeEL)EBL6842303
035   $a(PPN)155214160
035   $a(EXLCZ)991000000000438228
100   $a20220908d1977      uy             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComputations in higher types /$fJ. Moldestad
205   $a1st ed. 1977.
210  1$aBerlin, Germany :$cSpringer,$d[1977]
210  4$dİ1977
215   $a1 online resource (VIII, 208 p.) 
225 1 $aLecture Notes in Mathematics,$x0075-8434 ;$v574
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-08132-1 
327   $aAbstract -- The computation domain -- Recursion on ? -- Connection with Kleene recursion in higher types -- Recursion in normal lists on ? -- Kleene recursion in normal objects of type n+2, n>0 -- Computation theories on ? -- Abstract Kleene theories -- Normal computation theories on ? -- More about Mahloness -- Calculation of the lengths of some computations -- Gaps -- On platek: ?Foundations of recursion theory? -- A final comment concerning the two types.
410  0$aLecture Notes in Mathematics,$x0075-8434 ;$v574
606   $aRecursive functions
615  0$aRecursive functions.
676   $a511.352
700   $aMoldestad$b Johan$f1946-$048583
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466663403316
996   $aComputations in higher types$980729
997   $aUNISA