000767530 000__ 01738cam\a2200397\i\4500
000767530 001__ 767530
000767530 005__ 20210515122309.0
000767530 006__ m\\\\\o\\d\\\\\\\\
000767530 007__ cr\cn\nnnunnun
000767530 008__ 150820t20152015gw\a\\\\ob\\\\001\0\eng\d
000767530 020__ $$z9783110275551
000767530 020__ $$a9783110275643$$q(electronic book)
000767530 020__ $$z9783110381290 (epub)
000767530 035__ $$a(MiAaPQ)ebr11087975
000767530 040__ $$aMiAaPQ$$beng$$erda$$epn$$cMiAaPQ$$dMiAaPQ
000767530 050_4 $$aQA9.6$$b.C46 2015eb
000767530 08204 $$a511.3/5$$223
000767530 1001_ $$aChong, C.-T.$$q(Chi-Tat),$$d1949-$$eauthor.
000767530 24510 $$aRecursion theory :$$bcomputational aspects of definability /$$cChi Tat Chong, Liang Yu.
000767530 264_1 $$aBerlin, [Germany] ;$$aBoston, [Massachusetts] :$$bDe Gruyter,$$c2015.
000767530 264_4 $$c©2015
000767530 300__ $$a1 online resource (322 pages) :$$billustrations.
000767530 336__ $$atext$$2rdacontent
000767530 337__ $$acomputer$$2rdamedia
000767530 338__ $$aonline resource$$2rdacarrier
000767530 4901_ $$aDe Gruyter Series in Logic and Its Applications,$$x1438-1893 ;$$vVolume 8
000767530 504__ $$aIncludes bibliographical references and index.
000767530 506__ $$aAccess limited to authorized users.
000767530 588__ $$aDescription based on print version record.
000767530 650_0 $$aRecursion theory.
000767530 7001_ $$aYu, Liang,$$eauthor.
000767530 77608 $$iPrint version:$$aChong, C.-T. (Chi-Tat), 1949-$$tRecursion theory : computational aspects of definability.$$dBerlin, [Germany] ; Boston, [Massachusetts] : De Gruyter, c2015 $$z9783110275551 $$w(DLC) 2015008883
000767530 830_0 $$aDe Gruyter series in logic and its applications ;$$vVolume 8.
000767530 852__ $$bebk
000767530 85640 $$3ProQuest Ebook Central Academic Complete$$uhttps://univsouthin.idm.oclc.org/login?url=http://site.ebrary.com/lib/usiricelib/Doc?id=11087975$$zOnline Access
000767530 909CO $$ooai:library.usi.edu:767530$$pGLOBAL_SET
000767530 980__ $$aEBOOK
000767530 980__ $$aBIB
000767530 982__ $$aEbook
000767530 983__ $$aOnline