𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Mathematics of Logic. A guide to completeness theorems and their applications

✍ Scribed by Richard W. Kaye


Book ID
127397043
Publisher
Cambridge University Press
Year
2007
Tongue
English
Weight
959 KB
Edition
1
Category
Library
ISBN
051134273X

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Mathematics of Logic: A Guide to Complet
✍ Kaye L. πŸ“‚ Library πŸ“… 2007 πŸ› Cambridge University Press 🌐 English βš– 3 MB

This textbook covers the key material for a typical first course in logic for undergraduates or first-year graduate students, 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 interestin

Computer and intractability: a guide to
✍ Michael R. Garey, David S. Johnson πŸ“‚ Library πŸ“… 1979 πŸ› W.H.Freeman & Co Ltd 🌐 English βš– 3 MB

This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people. This man illustrates an important quality of a class of problems, namely, the NP-complete problems: i