Skip to main content Accessibility help
×
  • Cited by 8
    • Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      January 2010
      July 2007
      ISBN:
      9780511619243
      9780521882194
      9780521708777
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.418kg, 206 Pages
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.304kg, 216 Pages
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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.

    Reviews

    "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

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.