Coverart for item
The Resource Computability and logic, George S. Boolos, John P. Burgess, Richard C. Jeffrey

Computability and logic, George S. Boolos, John P. Burgess, Richard C. Jeffrey

Label
Computability and logic
Title
Computability and logic
Statement of responsibility
George S. Boolos, John P. Burgess, Richard C. Jeffrey
Title variation
Computability & Logic
Creator
Contributor
Author
Subject
Language
eng
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
Member of
Cataloging source
UkCbUP
http://library.link/vocab/creatorName
Boolos, George
Dewey number
511.3
Index
index present
LC call number
QA9.59
LC item number
.B66 2002
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
1948-
http://library.link/vocab/relatedWorkOrContributorName
  • Burgess, John P.
  • Jeffrey, Richard C.
http://library.link/vocab/subjectName
  • Computable functions
  • Recursive functions
  • Logic, Symbolic and mathematical
Label
Computability and logic, George S. Boolos, John P. Burgess, Richard C. Jeffrey
Instantiates
Publication
Note
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 5.
  • Abacus Computability
  • 6.
  • Recursive Functions
  • 7.
  • Recursive Sets and Relations
  • 8.
  • Equivalent Definitions of Computability
  • 9.
  • A Precis of First-Order Logic: Syntax
  • 1.
  • 10.
  • A Precis of First-Order Logic: Semantics
  • 11.
  • The Undecidability of First-Order Logic
  • 12.
  • Models
  • 13.
  • The Existence of Models
  • 14.
  • Proofs and Completeness
  • Enumerability
  • 15.
  • Arithmetization
  • 16.
  • Representability of Recursive Functions
  • 17.
  • Indefinability, Undecidability, Incompleteness
  • 18.
  • The Unprovability of Consistency
  • 19.
  • Normal Forms
  • 2.
  • 20.
  • The Craig Interpolation Theorem
  • 21.
  • Monadic and Dyadic Logic
  • 22.
  • Second-Order Logic
  • Diagonalization
  • 3.
  • Turing Computability
  • 4.
  • Uncomputability
Control code
CR9781139164931
Edition
Fourth edition.
Extent
1 online resource (xi, 356 pages)
Form of item
online
Isbn
9780521007580
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
digital, PDF file(s).
Specific material designation
remote
Label
Computability and logic, George S. Boolos, John P. Burgess, Richard C. Jeffrey
Publication
Note
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 5.
  • Abacus Computability
  • 6.
  • Recursive Functions
  • 7.
  • Recursive Sets and Relations
  • 8.
  • Equivalent Definitions of Computability
  • 9.
  • A Precis of First-Order Logic: Syntax
  • 1.
  • 10.
  • A Precis of First-Order Logic: Semantics
  • 11.
  • The Undecidability of First-Order Logic
  • 12.
  • Models
  • 13.
  • The Existence of Models
  • 14.
  • Proofs and Completeness
  • Enumerability
  • 15.
  • Arithmetization
  • 16.
  • Representability of Recursive Functions
  • 17.
  • Indefinability, Undecidability, Incompleteness
  • 18.
  • The Unprovability of Consistency
  • 19.
  • Normal Forms
  • 2.
  • 20.
  • The Craig Interpolation Theorem
  • 21.
  • Monadic and Dyadic Logic
  • 22.
  • Second-Order Logic
  • Diagonalization
  • 3.
  • Turing Computability
  • 4.
  • Uncomputability
Control code
CR9781139164931
Edition
Fourth edition.
Extent
1 online resource (xi, 356 pages)
Form of item
online
Isbn
9780521007580
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
digital, PDF file(s).
Specific material designation
remote

Library Locations

Processing Feedback ...