Customer Service - Phone: +852 2989-9147 or Email: sales@shopinhk.com
Search:
Login: Password:  OR 
Hong Kong Online Shopping :: Bookstore :: Science :: General :: 0521701465 :: Computability and Logic

  Categories

  Manufacturers

  Special

  Help
We accept Visa, Master Card, transfer to our HSBC account and payment by cheque.

   

Computability and Logic :: 0521701465

Computability and Logic
Click to enlarge Click To View Detailed Image(s)
Product ID: 420209

Publication Date: 2007-09-17
Author(s):George S. Boolos
Edition: 5
Binding: Paperback
Number of Pages: 364
Publisher: Cambridge University Press
ISBN: 0521701465
ISBN13: 9780521701464

Details
 
SKU 0521701465
Weight 0.57 Kgs
Price: HK$288.00

  0%

Related Products
Stock Details and Delivery
 
WarehouseStockEstimated Delivery Date
Hong KongNo item(s) available
US Warehouse 11 item(s) available2nd December 2008 (Tue)
US Warehouse 22 item(s) available5th December 2008 (Fri)
On OrderNo item(s) on order
 
Options
 
Quantity

        


When will you get your order:
  • Products in our Hong Kong warehouse are delivered within 2 business days. Click here to list items in stock, or consider sending a gift certficate if you're looking for last minute gifts.
  • Items in stock in our US warehouses will be delivered around the displayed dates.

Customers Also Bought

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

An Introduction to Gödel's Theorems (Cambridge Introductions to Philosophy)

Set Theory and Its Philosophy: A Critical Introduction

Description

Product Description
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.

Editorial Descriptions are usually submitted by the manufacturers, publishers and authors. Contact u s if you are one of them, and wish to change the above description.

Reviews

   

Customer feedback

Product rating


Voting

Rate It!


Customer Reviews


There have been no reviews for this product.

Send to Friend

   

Send to friend

Your name: *
Your e-mail: *
Recipient's email: *

Send to friend
 

  Your cart

  Gift Registry

  In Association With




  Offers & Ads



Users Browsing - 92 unregistered customer(s)
Copyright © 2004-2008 GeoClicks - Unit 715, Tower B, Southmark, 11 Yip Hing Street, Wong Chuk Hang, Hong Kong