000			02236nam a22003617a 4500
001			sulb-eb0015588
003			BD-SySUS
005			20160405134438.0
008			110818s2013||||enk o ||1 0|eng|d
020			_a9781139149105 (ebook)
020			_z9781107022843 (hardback)
020			_z9781107606753 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.65 _b.S65 2013
082	0	0	_a511.3 _223
100	1		_aSmith, Peter, _eauthor.
245	1	3	_aAn Introduction to Gödel's Theorems / _cPeter Smith.
250			_a2nd ed.
264		1	_aCambridge : _bCambridge University Press, _c2013.
300			_a1 online resource (406 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	0		_aCambridge Introductions to Philosophy
500			_aTitle from publisher's bibliographic system (viewed on 04 Apr 2016).
520			_aIn 1931, the young Kurt Gödel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing (and most misunderstood) in logic. Gödel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results (including some not easily available elsewhere). The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book - extensively rewritten for its second edition - will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.
650		0	_aGödel, Kurt
650		0	_aLogic, Symbolic and mathematical
776	0	8	_iPrint version: _z9781107022843
830		0	_aCambridge Introductions to Philosophy.
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9781139149105
942			_2Dewey Decimal Classification _ceBooks
999			_c37432 _d37432