List price: $71.00
30 day, 100% satisfaction guarantee!
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic. At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics. Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved. Optional sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch. Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches. Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in Logic, Mathematics, Philosophy, and Computer Science.
List price: $71.00
Copyright year: 2007
Publisher: Oxford University Press, Incorporated
Publication date: 7/12/2007
Size: 6.50" wide x 9.50" long x 0.50" tall
|Informal natural deduction|
|First interlude: Wason's Selection Task|
|Second interlude: The Linda Problem|
|The natural deduction rules|
|Solutions to some exercises|