Computability and Logic / Edition 5

Paperback (Print)
Rent
Rent from BN.com
$7.26
(Save 79%)
Est. Return Date: 10/19/2014
Used and New from Other Sellers
Used and New from Other Sellers
from $21.50
Usually ships in 1-2 business days
(Save 38%)
Other sellers (Paperback)
  • All (14) from $21.50   
  • New (10) from $24.98   
  • Used (4) from $21.50   

Overview

The third edition has been corrected and contains thoroughly revised versions of the chapters on Ramsey and probability, with new exercises provided for three other chapters. There are also two new chapters dealing with undecidable sentences.
Read More Show Less

Editorial Reviews

From The Critics
This intermediate logic textbook for philosophy and computer science students introduces Gödel's completeness theorem, several incompleteness theorems, their attendant lemmas and corollaries, the theory of Turing machines, recursive functions, definability, and decidability. The fourth edition adds problems at the end of each chapter. Annotation c. Book News, Inc., Portland, OR (booknews.com)
From the Publisher
"John P. Burgess (Princeton U.) and Richard C. Jeffrey continue here in the tradition set by the late Boolos to present the "principal fundamental theoretical results about logic that would necessarily include the work of G<&#58;o>del. For this edition they have revised and simplified their presentation of the representability of recursive functions, rewritten a section on Robinson arithmetic, and reworked exercises. They continue to present material in a two-semester format, the first on computability theory (enumerability, diagonalization, Turing compatibility, uncomputability, abacus computability, recursive functions, recursive sets and relations, equivalent definitions of computability) and basic metalogic (syntax, semantics, the undecidability of first-order logic, models and their existence, proofs and completeness, arithmetization, representability of recursive functions, indefinability, undecidability, incompleteness and the unprobability of inconsistency). They include a slate of nine further topics, including normal forms, second-order logic and Ramsey's theorem."
Book News, Inc.
Read More Show Less

Product Details

  • ISBN-13: 9780521701464
  • Publisher: Cambridge University Press
  • Publication date: 9/30/2007
  • Edition description: Revised Edition
  • Edition number: 5
  • Pages: 366
  • Sales rank: 795,539
  • Product dimensions: 6.14 (w) x 9.21 (h) x 0.75 (d)

Table of Contents

Preface
1 Enumerability 3
2 Diagonalization 16
3 Turing Computability 23
4 Uncomputability 35
5 Abacus Computability 45
6 Recursive Functions 63
7 Recursive Sets and Relations 73
8 Equivalent Definitions of Computability 88
9 A Precis of First-Order Logic: Syntax 101
10 A Precis of First-Order Logic: Semantics 114
11 The Undecidability of First-Order Logic 126
12 Models 137
13 The Existence of Models 153
14 Proofs and Completeness 166
15 Arithmetization 187
16 Representability of Recursive Functions 199
17 Indefinability, Undecidability, Incompleteness 221
18 The Unprovability of Consistency 233
19 Normal Forms 243
20 The Craig Interpolation Theorem 260
21 Monadic and Dyadic Logic 270
22 Second-Order Logic 279
23 Arithmetical Definability 286
24 Decidability of Arithmetic without Multiplication 295
25 Nonstandard Models 302
26 Ramsey's Theorem 319
27 Modal Logic and Provability 327
Hints for Selected Problems 341
Annotated Bibliography 348
Index 349
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)