Computability and logic:

This 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 b...

Full description

Saved in:
Bibliographic Details
Main Authors: Boolos, George 1940-1996 (Author), Burgess, John P. 1948- (Author), Jeffrey, Richard C. 1926-2002 (Author)
Format: Electronic eBook
Language:English
Published: Cambridge Cambridge University Press 2002
Edition:Fourth edition
Subjects:
Online Access:BSB01
FHN01
UBG01
UBM01
Volltext
Summary:This 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
Item Description:Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Physical Description:1 online resource (xi, 356 pages)
ISBN:9781139164931
DOI:10.1017/CBO9781139164931

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text