000			02073nam a2200469 i 4500
001			EBC1787099
003			MiAaPQ
005			20240123070513.0
006			m o d |
007			cr cnu||||||||
008			150820t20152015gw a ob 001 0 eng d
020			_z9783110275551
020			_a9783110275643 _q(electronic bk.)
020			_a9783110381290 _q(electronic bk.)
035			_a(MiAaPQ)EBC1787099
035			_a(Au-PeEL)EBL1787099
035			_a(CaPaEBR)ebr11087975
035			_a(CaONFJC)MIL821110
035			_a(OCoLC)919338525
040			_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ
050		4	_aQA9.6 _b.C46 2015
082	0		_a511.3/5 _223
100	1		_aChong, C.-T. _q(Chi-Tat), _d1949- _eauthor.
245	1	0	_aRecursion theory : _bcomputational aspects of definability / _cChi Tat Chong, Liang Yu.
264		1	_aBerlin, [Germany] ; _aBoston, [Massachusetts] : _bDe Gruyter, _c2015.
264		4	_c2015
300			_a1 online resource (322 pages) : _billustrations.
336			_atext _2rdacontent
337			_acomputer _2rdamedia
338			_aonline resource _2rdacarrier
490	1		_aDe Gruyter Series in Logic and Its Applications, _x1438-1893 ; _vVolume 8
504			_aIncludes bibliographical references and index.
588			_aDescription based on print version record.
590			_aElectronic reproduction. Ann Arbor, MI : ProQuest, 2016. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
650		0	_aRecursion theory.
655		4	_aElectronic books.
700	1		_aYu, Liang, _eauthor.
776	0	8	_iPrint version: _aChong, C.-T. (Chi-Tat), 1949- _tRecursion theory : computational aspects of definability. _dBerlin, [Germany] ; Boston, [Massachusetts] : De Gruyter, c2015 _h306 pages _kDe Gruyter series in logic and its applications ; Volume 8. _z9783110275551 _w2015008883
797	2		_aProQuest (Firm)
830		0	_aDe Gruyter series in logic and its applications ; _vVolume 8.
856	4	0	_uhttps://ebookcentral.proquest.com/lib/bacm-ebooks/detail.action?docID=1787099 _zClick to View
999			_c118204 _d118204