A Friendly Introduction to Mathematical Logic

A Friendly Introduction to Mathematical Logic

3.91 (12 ratings by Goodreads)

List price: US$53.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


For a one-quarter/one-semester, junior/senior-level course in Mathematical Logic.

With the idea that mathematical logic is absolutely central to mathematics, this tightly focused, elementary text discusses concepts that are used by mathematicians in every branch of the subject-a subject with increasing applications and intrinsic interest. It features an inviting writing style and a mathematical approach with precise statements of theorems and correct proofs. Students are introduced to the main results of mathematical logic-results that are central to the understanding of mathematics as a whole.
show more

Product details

  • Hardback | 218 pages
  • 158.5 x 236.7 x 21.6mm | 572.3g
  • Pearson
  • United States
  • English
  • 0130107050
  • 9780130107053

Table of contents

1. Structures and Languages.

Naively. Languages. Terms and Formulas. Induction. Sentences. Structures. Truth in a Structure. Substitutions and Substitutability. Logical Implication. Summing Up, Looking Ahead.

2. Deductions.

Naively. Deductions. The Logical Axioms. Rules of Inference. Soundness. Two Technical Lemmas. Properties of our Deductive System. Non-Logical Axioms. Summing Up, Looking Ahead.

3. Completeness and Compactness.

Naively. Completeness. Compactness. Substructures and the Loewenheim-Skolem Theorems. Summing Up, Looking Ahead.

4. Incompleteness-Groundwork.

Introduction. Language, Structure, Axioms of N. Recursive Sets and Recursive Functions. Recursive Sets and Computer Programs. Coding-Naively. Coding Is Recursive. Goedel Numbering. Goedel Numbers and N. NUM and SUB Are Recursive. Definitions by Recursion Are Recursive. The Collection of Axioms Is Recursive. Coding Deductions. Summing Up, Looking Ahead. Tables of D-Definitions.

5. The Incompleteness Theorems.

Introduction. The Self-Reference Lemma. The First Incompleteness Theorem. Extensions and Refinements of Incompleteness. Another Proof of Incompleteness. Peano Arithmetic and the Second Incompleteness Theorem. George Boolos on the Second Incompleteness Theorem. Summing Up, Looking Ahead.

Appendix: Set Theory.

show more

Rating details

12 ratings
3.91 out of 5 stars
5 42% (5)
4 17% (2)
3 33% (4)
2 8% (1)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X