PHILOSOPHY 9: SYMBOLIC LOGIC

The precise schedule of lessons and assignments will be on the syllabus webpage, but the following chart provides an overall view of the movement in the course.  Please note that for Spring 2003 we will be using PLN notation for the first half of the course and conventional notation for the second half.
 

MODULE 1:  Basic Symbolization The properties of effective games Using both postfix and infix symbolization Propositional variables and connectives Predicate variables Logical relationships Using truth tables The 19th century background of symbolic logic Using PLN Variables and signals Alternate connectives Truth-functional relationships Effective symbolization Using X and Y as signals Gates in electronic circuits Additional material on propositional logic Schaum: 44-55 Schaum: 130-142 Schaum: 55-60 Schaum: 60-64 MODULE 2:  Quantification and Direct Derivations Using quantifiers Effective symbolization for monadic expressions Direct inferences Direct derivations Exchanging wff's Practice drills Terms used in predicate logic More about predicate logic Beginning with derivations Inferences and equivalences Something about Prolog and other computing languages Schaum: 130-142 Schaum: 81-87 note differences in what is labeled v elim Schaum: 81-87 Schaum: 81-87, 103 MODULE 3:  Testing for Validity Defining validity Truth table testing Additional quantifier rules Using consistency trees Converting to DNF and CNF Deductive reasoning Using algebraic notation The new name rule Consistency trees with quantifiers Horn formulas Using truth table tests Algebraic notation Schaum: 23-31 Schaum: 60-68 Schaum: 68-77, 150-158 MODULE 4:  Additional Derivation Techniques and Multiple Quantifiers Indirect derivations Hypothetical (conditional) derivations Dyadic expressions Multiple Quantifiers Drills on symbolization Practice drills Indirect derivations Conditional derivations Examples for multiply quantified sentences Drills on derivations Schaum: 87-97 Schaum: 87-97 Special problems in symbolization Schaum: 130-142 MODULE 5:  Additional Predicate Symbolization Prenex expressions Expressing identity The decidability (computability) problem Boolean algebra A three-value logic Schaum: 158-162