Logic for Computer Scientists/Preface< Logic for Computer Scientists
This logic course is intended for computer scientists and it assumes practically no previous knowledge except some basic mathematical notions like relations and orderings. The material presented here can, of course, be printed and used as an ordinary textbook. However, it should be pointed out; that this is not the intention of the author; the aim was to create an electronic, interactive script where logics can be experienced by interaction and experimentation. The reader who is interested in more traditional forms of a textbook is referred to the following sources:
- Uwe Schöning: Logik für Informatiker. BI-Wissenschaftsverlag, Mannheim, 1987. The chapter on propositional logics is based on the treatment in this book. Some definitions and proofs are given in the same way Schöning does.
- Chin-Liang Chang; Richard Char-Tung Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973. The chapter on predicate logics is based on this standard textbook on mechanical theorem proving.
- Melvin Fitting: First-Order Logic and Automated Theorem Proving. Springer-Verlag, Berlin, Heidelberg, New York, 1990. This is a modern computer science oriented treatment of analytic tableaux, which inspired the sections on tableaux of this course.
Further bibliographic information will be given at the end of each section.
Up to Logic for Computer Scientists