Mathematical Logic

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 andcan'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 provingthe 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. Throughoutthe 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 linguisticapproaches. 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.

“The text is clearly laid out and written in an easy-to-read free-flowing style.”

Mathematical Logic is crisply written and is a pleasure to read...Chiswell and Hodges' book is at the very top of the reading list. Michael Berg, MAA Online Times Higher Education Supplement

Ian Chiswell acheived a Ph.D. at the University of Michigan in 1973 on the Bass-Serre theory of groups acting on trees. After three years as a temporary lecturer at the University of Birmingham he moved back to Queen Mary, University of London in 1976. His teaching experience dates back to 1968 when he was a teaching fellow at the University of Michigan. He spent the academic year 1972-73 in Germany at the Ruhr-Universitaet Bochum. He has published a monographon lamda-trees, which are generalisations of ordinary trees. His work has connections with mathematical logic, mainly via non-standard free groups. Wilfrid Hodges achieved his DPhil at Oxford in 1970for a thesis in model theory (mathematical logic). He has taught mathematics at London University for nearly forty years, first at Bedford College and then at Queen Mary, and also taught for visiting years in Los Angeles and Boulder (USA). Besides this book, he has four other textbooks of logic in print, at levels ranging from popular to research. He has served as president of the British Logic Colloquium and the European Association for Logic, Language and Information, and asvice-president of the London Mathematical Society.

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.

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.