Enderton (2001) A Mathematical Introduction to Logic with Solutions

Below are links to answers and solutions for exercises in the Enderton (2001) A Mathematical Introduction to Logic.

• Chapter 1

  • Section 1.0: Informal Remarks on Formal Languages
  • Section 1.1: The Language of Sentential Logic
  • Section 1.2: Truth Assignments
  • Section 1.3: A Parsing Algorithm
  • Section 1.4: Induction and Recursion
  • Section 1.5: Sentential Connectives
  • Section 1.6: Switching Circuits
  • Section 1.7: Compactness and Effectiveness

• Chapter 2

  • Section 2.0: Preliminary Remarks
  • Section 2.1: First-Order Languages
  • Section 2.2: Truth and Models
  • Section 2.3: A Parsing Algorithm
  • Section 2.4: A Deductive Calculus
  • Section 2.5: Soundness and Completeness Theorems
  • Section 2.6: Models of Theories
  • Section 2.7: Interpretations Between Theories
  • Section 2.8: Nonstandard Analysis

• Chapter 3

  • Section 3.0: Number Theory
  • Section 3.1: Natural Numbers with Successor
  • Section 3.2: Other Reducts of Number Theory
  • Section 3.3: A Subtheory of Number Theory

Enjoy!