Cambridge University Press (2007)
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
|Keywords||Logic, Symbolic and mathematical|
|Categories||categorize this paper)|
|Buy the book||$43.25 used (68% off) $50.00 new (63% off) $74.16 direct from Amazon (46% off) Amazon page|
|Call number||QA9.K32 2007|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof.P. B. Andrews - 2002 - Kluwer Academic Publishers.
Logic and Probability.Kenny Easwaran - 2010 - Journal of the Indian Council of Philosophical Research 27 (2):229-253.
Added to index2009-01-28
Total downloads9 ( #466,268 of 2,177,988 )
Recent downloads (6 months)1 ( #317,698 of 2,177,988 )
How can I increase my downloads?