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 Boolos, George S

Add to wish list
  • New
  • Paperback
New

Description

Cambridge University Press, 2007-09-17. 5. paperback. New. 7.00x0.82x9.98. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$43.78
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

  • Title Computability and Logic
  • Author Boolos, George S
  • Binding Paperback
  • Edition 5
  • Condition New
  • 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 # DADAX0521701465
  • 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)
  • Size 7.00x0.82x9.98
  • 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 6

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

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-