BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Computability and Logic

Computability and Logic

Computability and Logic
Stock photo: cover may vary

Computability and Logic Paperback - 2007

by George S. Boolos; John P. Burgess; Richard C. Jeffrey

Add to wish list
  • Used
Used - Acceptable

Description

Used - Acceptable. Readable, but has significant damage / tears. Has a remainder mark. Used - Acceptable
Ask the seller a question Add to wish list
A$28.57
A$4.30 Delivery within USA
Standard delivery: 2 to 8 days
More delivery options
Ships from Marlton Books LLC (New York, United States)

Details

  • Title Computability and Logic
  • Author George S. Boolos; John P. Burgess; Richard C. Jeffrey
  • Binding Paperback
  • Edition Reprint
  • Condition Used - Acceptable
  • Pages 366
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press, Cambridge
  • Publication date 2007-09-17
  • Illustrated Yes
  • Features Annotated, Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # M-20007214
  • ISBN 9780521701464 / 0521701465
  • Weight 1.44 lbs (0.65 kg)
  • Dimensions 9.95 x 7.09 x 0.75 in (25.27 x 18.01 x 1.91 cm)
  • Category Mathematics
  • Library of Congress subjects Logic, Symbolic and mathematical, Computable functions
  • Library of Congress Catalogue Number 2007014225
  • Dewey Decimal Code 511.352
  • Quantity available 2

About Marlton Books LLC New York, United States

Biblio member since 2025

Marlton Books- simply the finest offers in bookselling.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Marlton Books LLC

Reader reviews for Computability and Logic

From the publisher

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.
tracking-