000			01934nam a22003378i 4500
001			CR9781316717110
003			UkCbUP
005			20200124160209.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			160216s2016||||enk o ||1 0|eng|d
020			_a9781316717110 (ebook)
020			_z9781107168244 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050		4	_aQA9.62 _b.H56 2016
082	0	4	_a511/.3 _223
100	1		_aHinman, Peter G., _eauthor.
245	1	0	_aRecursion-theoretic hierarchies / _cPeter G. Hinman.
264		1	_aCambridge : _bCambridge University Press, _c2016.
300			_a1 online resource (xii, 480 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aPerspectives in logic
500			_aTitle from publisher's bibliographic system (viewed on 18 Apr 2017).
520			_aSince their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.
650		0	_aRecursion theory _xHierarchies.
776	0	8	_iPrint version: _z9781107168244
830		0	_aPerspectives in logic.
856	4	0	_uhttps://doi.org/10.1017/9781316717110
999			_c515656 _d515654