Logical SystemsPeter Suber, Philosophy Department, Earlham College

This is the

course home-pagefor Philosophy 340 (also Mathematics 340, Computer Science 340),Logical Systems.

- Fall Semester, 2002-03.
- Tue 12:00-1:00, Wed 2:30-4:00, Fri 2:30-4:00
- Carpenter 322.
- Course description.

Hand-outs

- Syllabus
- Electronic discussion (email list name =
logsys)- Review "Symbolic Logic"
- Glossary
- Exercises
- Map of some logical systems
- Formal system assignment
- The shadow problem
- Sample formal system S
- How to read proofs
- Hunter-Hofstadter map
- Formal systems and machines: an isomorphism
- Map of some sets of expressions
- A crash course in the mathematics of infinite sets
- The quirk problem
- Bibliography of non-standard logics
- Principles of non-contradiction and excluded middle
- Turing machines I
- Mathematical induction
- Mid-term review
- Satisfaction
- Three levels of truth
- Löwenheim-Skolem theorem
- Gödel's proof
- Turing machines II
- Recursive function theory
- Predicate logic review
- Answers to selected exercises
- Generic Suberian course hand-out
- Giving presentations and leading discussions
- How to use Philosopher's Index

Links

Peter Suber,
Department of Philosophy,
Earlham College, Richmond, Indiana, 47374, U.S.A.

*peters@earlham.edu*. Copyright © 1999-2002, Peter Suber.