Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact email@example.com providing details of the course you are teaching.
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.Read more
- Lively mathematical examples and some unusual formal systems stimulate the reader from the very beginning
- Suitable as an introduction to logic for students without any background in formal set theory
- Supported by companion web-pages containing further material and exercises
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: July 2007
- format: Paperback
- isbn: 9780521708777
- length: 216 pages
- dimensions: 225 x 153 x 10 mm
- weight: 0.304kg
- contains: 4 b/w illus. 141 exercises
- availability: Available
Table of Contents
How to read this book
1. König's lemma
2. Posets and maximal elements
3. Formal systems
4. Deductions in posets
5. Boolean algebras
6. Propositional logic
8. Filters and ideals
9. First-order logic
10. Completeness and compactness
11. Model theory
12. Nonstandard analysis
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Sorry, this resource is locked