000			01972nam a22003378i 4500
001			CR9781316717073
003			UkCbUP
005			20200124160209.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			160215s2016||||enk o ||1 0|eng|d
020			_a9781316717073 (ebook)
020			_z9781107168169 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050		4	_aQA9.6 _b.F46 2016
082	0	4	_a511/.3 _223
100	1		_aFenstad, Jens E., _eauthor.
245	1	0	_aGeneral recursion theory : _ban axiomatic approach / _cJens E. Fenstad.
264		1	_aCambridge : _bCambridge University Press, _c2016.
300			_a1 online resource (xi, 225 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. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.
650		0	_aRecursion theory.
776	0	8	_iPrint version: _z9781107168169
830		0	_aPerspectives in logic.
856	4	0	_uhttps://doi.org/10.1017/9781316717073
999			_c515651 _d515649