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
Computability and Logic 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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual
Member of
Cataloging source
UkCbUP
http://library.link/vocab/creatorName
Boolos, George
Dewey number
511.3/52
Index
index present
LC call number
QA9.59
LC item number
.B66 2007
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
Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability
Control code
CR9780511804076
Edition
Fifth edition.
Extent
1 online resource (xiii, 350 pages)
Form of item
online
Isbn
9780521701464
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
Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability
Control code
CR9780511804076
Edition
Fifth edition.
Extent
1 online resource (xiii, 350 pages)
Form of item
online
Isbn
9780521701464
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 ...