000 01848nam a22004575i 4500
001 978-3-540-39121-0
003 DE-He213
005 20190213151501.0
007 cr nn 008mamaa
008 121227s1984 gw | s |||| 0|eng d
020 _a9783540391210
_9978-3-540-39121-0
024 7 _a10.1007/BFb0099164
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBC
_2thema
072 7 _aPBCD
_2thema
082 0 4 _a511.3
_223
100 1 _aChong, Chi-Tat.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aTechniques of Admissible Recursion Theory
_h[electronic resource] /
_cby Chi-Tat Chong.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1984.
300 _aXII, 220 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 ;
_v1106
505 0 _aThe jump operator and 1-generic sets -- The ?-finite injury method -- Maximal sets -- Major subsets -- Hyperhypersimple sets -- Minimal pairs -- The density theorem -- Trees -- Set-theoretic methods.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aMathematical Logic and Foundations.
_0http://scigraph.springernature.com/things/product-market-codes/M24005
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662191125
776 0 8 _iPrinted edition:
_z9783540139027
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v1106
856 4 0 _uhttps://doi.org/10.1007/BFb0099164
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c10832
_d10832