Symbolic Logic 45.330, 91.330, and 92.330

      Fall 2001 Semester


Section:      201.
Time:         MWF 11:30 AM - 12:20 PM.
Room:         OS 102
PC Labs:      OS 101-103
              OS 307 and 310
Instructor:   Professor Raymond D. Gumb
Office:       Engineering 412
Telephone:    (978) 934-3619
E-mail:       gumb@cs.uml.edu (Please do NOT send e-mail to rgumb!)
Hours:        MWF 10:30 - 11:30 AM

This course is cross-listed as:
  45.330, Philosophy of Symbolic Logic (Undergraduate Philosophy).
  91.330, Symbolic Logic (Undergraduate Computer Science).
  92.330, Symbolic Logic (Undergraduate Mathematics).

1. Required Text.
   Jon Barwise and John Etchemendy, Language, Proof, and Logic,
       Seven Bridges Press and CSLI, 1999.
The text comes with software and access to the Grade Grinder.
You must buy this textbook new, as you will not be able to
carry out the assignments if you purchase a used copy.

2. Precis.
   This course is an introduction to symbolic logic.  It has no prerequisite
other than the maturity undergraduates typically attain by the junior or
senior year. Symbolic logic provides a solid foundation in formal reasoning
for students preparing for graduate study in philosophy, mathematics,
linguistics, cognitive science, computer science, and artificial intelligence.
Students will learn the art of deductive reasoning using the formal system
known as natural deduction. (Natural deduction is a human-oriented --- as
contrasted with a machine-oriented --- formal proof system.)  We will study
semantic concepts such as truth and validity and their role in justifying
natural deduction. We will also learn about alternative means of carrying out
and evaluating deductive arguments.

3. Logic Software.
    The text comes with LPL software that can be run on Macintosh computers
or PCs equipped with Microsoft Windows 95, 98, or NT 4.0.  There are four
systems packaged in the LPL software:  Fitch, Tarski's World, Boole, and
SubmitFitch incorporates a natural deduction system in the style of Frederic
Fitch.  Tarski's World is a simplified "blocks world" as studied in artificial
intelligence, and provides facilities for spacial reasoning.   Boole embodies
the classical method of truth-tables. Submit enables you to submit homework
assignments for grading.  Note that on most homework assignments you will be
able to use Submit to check your answers before submitting your final, best
effort for grading.  You will need to buy a diskette so that you can save
your assignments on your diskette (to be placed in the A: drive).

4. Grading.
   Homework Assignments     45%
   Quiz 1                   15%
   Quiz 2                   15%
   Final Exam               25%

5. Schedule.

MEET DATE        TOPIC
---- ----------- ----------------------------------------------

   1 Sep 5 (W)    Introduction. Historical background. The role of logic in natural
                  language and mathematical discourses. Using the LPL software.
   2     7 (F)    Propositional Logic.  Atomic Sentences.  (Chapter 1).

   3    10 (M)    (hw1)
   4    12 (W)    The Logic of Atomic Sentences (Chapter 2).
   5    14 (F)

   6    17 (M)    (hw2)
   7    19 (W)    The Boolean Connectives (Chapter 3).
   8    21 (F)

   9    24 (M)    (hw3)
  10    26 (W)    The Logic of Boolean Connectives (Chapter 4).
  11    28 (F)

    12 Oct 1 (M)    (hw4)
  13     3 (W)    Methods of Proof for Boolean Logic (Chapter 5).
  14     5 (F)

         8 (M)    Columbus Day (University Closed)
  15    10 (W)    Quiz 1.
  16    12 (F)    Formal Proofs and Boolean Logic (Chapter 6).

  17    15 (M)    (hw5)
  18    17 (W)
  19    19 (F)

  20    22 (M)    Conditionals (Chapter 7). (hw6)
  21    24 (W)
  22    26 (F)

  23    29 (M)    The Logic of Conditionals (Chapter 8).  (hw7)
  24    31 (W)
  25 Nov 2 (F)    Introduction to Quantifiers (Chapter 9 and
                  pp. 495-506).

  26     5 (M)    (hw8)
  27     7 (W)
  28     9 (F)

        12 (M)    Veterans' Day (University Closed)
  29    14 (W)    Quiz 2. (hw9)
  30    16 (F)    The Logic of Quantifiers (Chapter 10).

  31    19 (M)    (hw10)
  32    21 (W)
        23 (F)    Thanksgiving Recess

  33    26 (M)
  34    28 (W)    Multiple Quantifiers (Chapter 11)(hw11)
  35    30 (F)

  36 Dec 3 (M)
  37     5 (W)    (hw12)
  38     7 (F)    Formal Proofs and Quantifiers (Chapter 13)

  39    10 (M)
  40    12 (W)    (Last day of class)
        14 (F)    Final Exam.