Computability and Logic

ISBN-10: 0521389232

ISBN-13: 9780521389235

Edition: 3rd 1989 (Revised)

Authors: George S. Boolos, Richard C. Jeffrey

List price: $30.00
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


A text for a second course in logic for graduate and advanced undergraduate students. This third edition has been corrected and contains thoroughly revised versions of the chapters on Ramsey and provability, with new exercises provided for three other chapters. There are also two new chapters dealing with undecidable sentences and on the non-existence of non-standard recursive models of Z.
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
Business Ethics Online content $4.95 $1.99
Add to cart
Study Briefs
Business Law Online content $4.95 $1.99
Customers also bought

Book details

List price: $30.00
Edition: 3rd
Copyright year: 1989
Publisher: Cambridge University Press
Publication date: 9/29/1989
Binding: Paperback
Pages: 320
Size: 6.25" wide x 9.00" long x 0.75" tall
Weight: 0.946
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.