Synopses & Reviews
Language Proof and Logic is available as a physical book with the software included on CD and as a downloadable package of software plus the book in PDF format. The all-electronic version is available from Openproof at ggweb.stanford.edu.
The textbook/software package covers first-order language in a method appropriate for first and second courses in logic. An on-line grading services instantly grades solutions to hundred of computer exercises. It is designed to be used by philosophy instructors teaching a logic course to undergraduates in philosophy, computer science, mathematics, and linguistics.
Introductory material is presented in a systematic and accessible fashion. Advanced chapters include proofs of soundness and completeness for propositional and predicate logic, as well as an accessible sketch of Godel's first incompleteness theorem. The book is appropriate for a wide range of courses, from first logic courses for undergraduates (philosophy, mathematics, and computer science) to a first graduate logic course.
The software package includes four programs:
Tarski's World 5.0, a new version of the popular program that teaches the basic first-order language and its semantics;
Fitch, a natural deduction proof environment for giving and checking first-order proofs;
Boole, a program that facilitates the construction and checking of truth tables and related notions (tautology, tautological consequence, etc.);
Submit, a program that allows students to submit exercises done with the above programs to the Grade Grinder, the automatic grading service.
Grade reports are returned to the student and, if requested, to the student's instructor, eliminating the need for tedious checking of homework. All programs are available for Windows, Macintosh and Linux systems. Instructors do not need to use the programs themselves in order to be able to take advantage of their pedagogical value. More about the software can be found at lpl.stanford.edu.
The price of a new text/software package includes one Registration ID, which must be used each time work is submitted to the grading service. Once activated, the Registration ID is not transferable.
Table of Contents
Acknowledgements
Introduction
I. Propositional Logic
1. Atomic Sentences
2. The Logic of Atomic Sentences
3. The Boolean Connectives
4. The Logic of Boolean Connectives
5. Methods of Proof for Boolean Logic
6. Formal Proofs and Boolean Logic
7. Conditionals
8. The Logic of Conditionals
II. Quantifiers
9. Introduction to Quantification
10. The Logic of Quantifiers
11. Multiple Quantifiers
12. Methods for Proof of Quantifiers
13. Formal Proofs and Quantifiers
14. More about Quantification
III. Applications and Metatheory
15. First-order Set Theory
16. Mathematical Induction
17. Advanced Topics in Propositional Logic
18. Advanced Topics in FOL
19. Completeness and Incompleteness
Summary of Formal Proof Rules
Glossary
File Index
Exercise Index
General Index