Logical Systems Peter Suber, Philosophy Department, Earlham College

This is the course home-page for 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"
  • Basic terms of logic
  • Terms and symbols of propositional logic
  • Terms and symbols of predicate logic
  • Translation tips
  • Other "Symbolic Logic" hand-outs
• 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

• Course-related links
• Other philosophy links
• Philosophy study aids
• My other courses
• My office hours
• Contacting me
• Search Hippias, the Limited-Area Search Engine for Philosophy