The Mathematics of Logic and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
Sell Back Your Copy
For a $0.67 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
The Mathematics of Logic: A Guide to Completeness Theorems and their Applications
 
 
Start reading The Mathematics of Logic on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

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

Richard W. Kaye (Author)
2.0 out of 5 stars  See all reviews (1 customer review)

Price: $48.00 & this item ships for FREE with Super Saver Shipping. Details
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 5 left in stock--order soon (more on the way).
Want it delivered Monday, February 6? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $30.40  
Hardcover $120.00  
Paperback $48.00  

Book Description

July 30, 2007 052170877X 978-0521708777 1
This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, then proving and discussing the Completeness Theorem for each, the author ensures that the number of new concepts to be absorbed at each stage is manageable, whilst providing lively mathematical applications throughout. Unfamiliar terminology is kept to a minimum, no background in formal set-theory is required, and the book contains proofs of all the required set theoretical results. The reader is taken on a journey starting with König's Lemma, and progressing via order relations, Zorn's Lemma, Boolean algebras, and propositional logic, to completeness and compactness of first-order logic. As applications of the work on first-order logic, two final chapters provide introductions to model theory and nonstandard analysis.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)


Editorial Reviews

Review

"Kaye (pure mathematics, U. of Birmingham) gives undergraduate and first-year graduates key materials for a first course in logic, including a full mathematical account of the Completeness Theorem for first-order logic. As he builds a series of systems increasing in complexity, and proving and discussing the Completeness Theorem for each, Kaye keeps unfamiliar terminology to a minimum and provides proofs of all the required set theoretical results. He covers K<:o>nig's Lemma (including two ways of looking at mathematics), posets and maximal elements (including order), formal systems (including post systems and compatibility as bonuses), deduction in posets (including proving statements about a poset), Boolean algebras, propositional logic (including a system for proof about propositions), valuations (including semantics for propositional logic), filters and ideals (including the algebraic theory of Boolean algebras), first-order logic, completeness and compactness, model theory (including countable models) and nonstandard analysis (including infinitesimal numbers)." --Book News

Book Description

Undergraduate textbook covering the key material for a typical first course in logic, including a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. The author ensures that the number of new concepts at each stage is manageable, whilst providing lively mathematical applications throughout.

Product Details

  • Paperback: 216 pages
  • Publisher: Cambridge University Press; 1 edition (July 30, 2007)
  • Language: English
  • ISBN-10: 052170877X
  • ISBN-13: 978-0521708777
  • Product Dimensions: 8.8 x 5.9 x 0.4 inches
  • Shipping Weight: 11.4 ounces (View shipping rates and policies)
  • Average Customer Review: 2.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #1,828,801 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:    (0)
4 star:    (0)
3 star:    (0)
2 star:
 (1)
1 star:    (0)
 
 
 
 
 
Average Customer Review
2.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

7 of 8 people found the following review helpful:
2.0 out of 5 stars "Show that any finite poset is a lattice.", May 18, 2009
By 
(United States) - See all my reviews
This review is from: The Mathematics of Logic: A Guide to Completeness Theorems and their Applications (Paperback)
First off, this book has a wider and more interesting variety of formal systems than the other logic books I have gone through. What's more, Kaye's formal systems are much easier and more intuitive. Sadly, the text is absolutely riddled with errors. Check the errata on his site and you will see two or three corrections, read the book yourself and you will find that that list is far from complete. Most of them are just minor annoyances, but some of them really cause a lot of confusion. One of the questions was so bad that even my professor could not find a way to salvage it. Also, Kaye seems at times somewhat confused about his target audience. He feels the need to define simple things such as countability, but expects the reader to have decent exposure to both algebra and topology (I know little about either). Chapter eight is pretty much incomprehensible if you're not good with algebra, fortunately that chapter is optional. I also found sections 10.4, 11.3 and 12.3 (all optional) too difficult for me to get through. Overall I would say the book has a lot of potential, but I can't recommend it to anyone in the condition it's in now, especially if you don't have a professor to help walk you through it. Does not cover incompleteness.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
soundness theorem, lengthening rule, shortening rule, compactness theorem, archimedean property, clopen sets, boolean terms, propositional letters, cardinal arithmetic, clopen subsets, proposition letters, boolean ring, finite poset, strict partial order, proper filter
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Zorn's Lemma, Completeness Theorem, König's Lemma, Axiom of Choice, Proof Let, Reductio Ad Absurdum, Given Strings Rule, Assumption Let, Substitution Rule, Proof Suppose, Boolean Prime Ideal Theorem, The Omitting Types Theorem, Given Statements Rule, Schröder-Bernstein Theorem, The Stone Representation Theorem, Tychonov's Theorem, Proof Assume, Proof Consider, Proof Exercise, Contradiction Rule, Uniqueness of Complements
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Search Inside This Book:

Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject