000 03037nam a22004098i 4500
001 CR9781139164931
003 UkCbUP
005 20200124160301.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 111007s2002||||enk o ||1 0|eng|d
020 _a9781139164931 (ebook)
020 _z9780521809757 (hardback)
020 _z9780521007580 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA9.59
_b.B66 2002
082 0 0 _a511.3
_221
100 1 _aBoolos, George,
_eauthor.
245 1 0 _aComputability and logic /
_cGeorge S. Boolos, John P. Burgess, Richard C. Jeffrey.
246 3 _aComputability & Logic
250 _aFourth edition.
264 1 _aCambridge :
_bCambridge University Press,
_c2002.
300 _a1 online resource (xi, 356 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 0 _g1.
_tEnumerability --
_g2.
_tDiagonalization --
_g3.
_tTuring Computability --
_g4.
_tUncomputability --
_g5.
_tAbacus Computability --
_g6.
_tRecursive Functions --
_g7.
_tRecursive Sets and Relations --
_g8.
_tEquivalent Definitions of Computability --
_g9.
_tA Precis of First-Order Logic: Syntax --
_g10.
_tA Precis of First-Order Logic: Semantics --
_g11.
_tThe Undecidability of First-Order Logic --
_g12.
_tModels --
_g13.
_tThe Existence of Models --
_g14.
_tProofs and Completeness --
_g15.
_tArithmetization --
_g16.
_tRepresentability of Recursive Functions --
_g17.
_tIndefinability, Undecidability, Incompleteness --
_g18.
_tThe Unprovability of Consistency --
_g19.
_tNormal Forms --
_g20.
_tThe Craig Interpolation Theorem --
_g21.
_tMonadic and Dyadic Logic --
_g22.
_tSecond-Order Logic.
520 _aThis fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.
650 0 _aComputable functions.
650 0 _aRecursive functions.
650 0 _aLogic, Symbolic and mathematical.
700 1 _aBurgess, John P.,
_d1948-
_eauthor.
700 1 _aJeffrey, Richard C.,
_eauthor.
776 0 8 _iPrint version:
_z9780521809757
856 4 0 _uhttps://doi.org/10.1017/CBO9781139164931
999 _c520353
_d520351