Computability and Logic

Cambridge, England: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey (1974)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2016-02-04

Downloads
36 (#457,551)

6 months
17 (#161,262)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John Burgess
Princeton University

Citations of this work

Making AI Meaningful Again.Jobst Landgrebe & Barry Smith - 2021 - Synthese 198 (March):2061-2081.
Truth, disjunction, and induction.Ali Enayat & Fedor Pakhomov - 2019 - Archive for Mathematical Logic 58 (5-6):753-766.
Software Intensive Science.John Symons & Jack Horner - 2014 - Philosophy and Technology 27 (3):461-477.

View all 57 citations / Add more citations

References found in this work

No references found.

Add more references