Computability and Logic

ISBN-10: 0521701465

ISBN-13: 9780521701464

Edition: 5th 2007 (Revised)

Authors: George S. Boolos, John P. Burgess, Richard C. Jeffrey

List price: $35.99 Buy it from $26.74
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
New Starting from $26.74
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99
Add to cart
Study Briefs
Introduction to Logic Online content $4.95 $1.99
Add to cart
Study Briefs
Business Math Formulas Online content $4.95 $1.99
Customers also bought

Book details

List price: $35.99
Edition: 5th
Copyright year: 2007
Publisher: Cambridge University Press
Publication date: 9/17/2007
Binding: Paperback
Pages: 366
Size: 7.00" wide x 10.00" long x 0.75" tall
Weight: 1.320
Language: English

George Boolos was Professor of Philosophy, Massachusetts Institute of Technology.

Computability Theory
Turing computability
Abacus computability
Recursive functions
Recursive sets and relations
Equivalent definitions of computability
Basic Metalogic
A precis of first-order logic: syntax
A precis of first-order logic: semantics
The undecidability of first-order logic
The existence of models
Proofs and completeness
Representability of recursive functions
Indefinability, undecidability, incompleteness
The unprovability of consistency
Further Topics
Normal forms
The Craig interpolation theorem
Monadic and dyadic logic
Second-order logic
Arithmetical definability
Decidability of arithmetic without multiplication
Non-standard models
Ramsey's theorem
Modal logic and provability
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.