Freshly Printed - allow 8 days lead
Couldn't load pickup availability
Logic for Mathematicians
This is an introductory textbook which is designed to be useful not only to intending logicians but also to mathematicians in general.
A. G. Hamilton (Author)
9780521368650, Cambridge University Press
Paperback, published 29 September 1988
240 pages
22.9 x 15.4 x 2.4 cm, 0.345 kg
Here is an introductory textbook which is designed to be useful not only to intending logicians but also to mathematicians in general. Based on Dr Hamilton's lectures to third and fourth year undergraduate mathematicians at the University of Stirling it has been written to introduce student or professional mathematicians, whose background need cover no more than a typical first year undergraduate mathematics course, to the techniques and principal results of mathematical logic. In presenting the subject matter without bias towards particular aspects, applications or developments, an attempt has been made to place it in the context of mathematics and to emphasise the relevance of logic to the mathematician. Starting at an elementart level, the text progresses from informal discussion to the precise description and use of formal mathematical and logical systems. The early chapters cover propositional and predicate calculus. The later chapters deal with Gödel's theorem on the incompleteness of arithmetic and with various undecidability and unsolvability results, including a discussion of Turing machines and abstract computability. Each section ends with exercises designed to clarify and consolidate the material in that section. Hints or solutions to many of these are provided at the end of the book. The revision of this very successful textbook includes new sections on Skolemisation and applying well-formed formulas to logic programming. Some corrections have been made and extra exercises added.
Preface
1. Informal statement calculus
2. Formal statement calculus
3. Informal predicate calculus
4. Formal predicate calculus
5. Mathematical systems
6. The Gödel incompleteness theorem
7. Computability, unsolvability, undecidability
Appendix
Hints and solutions to selected exercises
References and further reading
Glossary of symbols
Index.
Subject Areas: Mathematical logic [PBCD]
