000 02035nam a22004455i 4500
001 978-3-540-37425-1
003 DE-He213
005 20190213151850.0
007 cr nn 008mamaa
008 121227s1977 gw | s |||| 0|eng d
020 _a9783540374251
_9978-3-540-37425-1
024 7 _a10.1007/BFb0087822
_2doi
050 4 _aQA1-939
072 7 _aPB
_2bicssc
072 7 _aMAT000000
_2bisacsh
072 7 _aPB
_2thema
082 0 4 _a510
_223
100 1 _aMoldestad, Johan.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aComputations in Higher Types
_h[electronic resource] /
_cby Johan Moldestad.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1977.
300 _aVIII, 208 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v574
505 0 _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.
650 0 _aMathematics.
650 1 4 _aMathematics, general.
_0http://scigraph.springernature.com/things/product-market-codes/M00009
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662201985
776 0 8 _iPrinted edition:
_z9783540081326
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v574
856 4 0 _uhttps://doi.org/10.1007/BFb0087822
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c12154
_d12154