Schedule

This is a tentative schedule for CS1502 for Spring 2007.  This is to give you an idea on the coverage and the pace of the course.  Entries with yellow background contain tentative information and is subject to change.  Check back regularly for reading assignments, homework assignments, and lecture notes.  Other important updates that do not fit here are on the "Updates" page.

Class

Date

Reading
assignments

Topics

 Notes Homework HW assign date HW due date

1

H 1/4

 --- introduction, goals, applications, examples s01-intro.ppt --- --- ---
2 T 1/9 1.1-1.5 (LPL) Atomic sentences, Function symbols, Translation s02-atomic-sentences.ppt 1.3, 1.5, 1.6,
1.9,
1.13, 1.14, 1.16		 1/9 1/16
3 H 1/11 2.1-2.2 Arguments, Proofs s03-logic-of-atomic-sentences.ppt
Propositional-logic-map.pdf
Propositional-logic-map-2.pdf		 --- --- ---
4 T 1/16 2.3-2.5 Formal Proofs, Demonstrating Non Consequence.  In class, we'll also learn about Demorgan's laws, translation involving boolean connectives --- 2.1,
2.7, 2.9
2.17, 2.20
2.22, 2.25
3.3
3.10		 1/16 1/23
5 H 1/18 4.1-4.3 Review boolean connectives by yourself (Ch 3: Sec 3.1-3.3,3.5-3.7)
logical truth, possibility, contradiction
logical truth vs model-specific truth
review NNF, CNF, DNF (4.5-4.6) by yourself		 s03-boolean-connectives.ppt
s04-logic-of-boolean-connectives.ppt		 --- --- ---
6 T 1/23 4.1-4.3
 		 Tautologies, tautological view of sentences,
equivalence, consequence		   3.18, 3.21, 3.22, 4.9, 4.17, 4.20, 4.27, 4.29, 4.40 1/23 1/30
7 H 1/25 5.1-5.2, 6.1-6.2 simple proof rules, subproofs, proof by cases s05-proofs.ppt --- --- ---
8 T 1/30 5.3-5.4, 6.3 Proofs involving contradiction
Proofs by contradiction		 s06-contradiction.ppt 6.3, 6.6, 6.8, 6.10, 6.11, 6.12, 6.13, 6.16, 6.18 1/30 2/6
9 H 2/1 5.3-5.4, 6.3
6.4-6.6		 Proof by contradiction
More proofs		 s07-more-proofs.ppt --- --- ---
10 T 2/6 7.1-7.3 Conditionals, biconditionals s08-conditionals.ppt 6.9, 6.14, 6.24, 6.25, 6.26, 6.27, 6.29, 6.38, 7.5, 7.14 2/6 2/13
11 H 2/8 8.1-8.2 Logic of conditionals and Proofs involving conditionals s09-proof-conditionals.ppt --- --- ---
12 T 2/13 17.3,17.4 More proofs
Horn clauses, resolution method.  Note, h with a ^ above it is discussed in section 17.1
University is closed due to weather.  Class cancelled.		 --- 7.2, 7.15, 8.23, 8.26, 8.37 2/13 2/20
13 H 2/15 --- review for exam 1 s10-exam1-review.ppt --- --- ---
14 T 2/20 --- --- Exam 1 --- (This has been moved from another day) ---   --- --- --
15 H 2/22 9.1-9.3 Quantification intro, symbols, variables, wffs s11-quan-intro.ppt --- --- ---
16 T 2/27 9.4
 		 satisfaction, semantics of E, A.
 		 s11-quan-intro-recap.ppt
 		 9.1, 9.2, 9.3
8.24, 8.35,
6.30, 6.31, 6.40 (No Con Rules allowed for 6.40)		 2/27 3/13
(2 wks)
17 H 3/1 9.5-9-7 Aristotelian forms, Translation, function symbols s12-aristotelian.ppt --- --- ---
- T 3/6 --- --- Spring Recess --- --- --- --- ---
- H 3/8 --- --- Spring Recess --- --- --- --- ---
18 T 3/13 10.1-10.2
(10.3-10.4)
10.5		 Tautologies, FO validity, FO consequence
(Study FO Equivalence, DeMorgan's laws on your own)
axiomatic method		 s13-FO-validity.ppt
s13-FO-equivalence.ppt		 9.9, 9.14, 9.16, 9.17,
10.1, 10.12, 10.13		 3/13 3/20
19 H 3/15 11.1-11.2
12.1-12.3, 13.1		 Proofs with quantifiers s15-multiple-quantifiers.ppt --- --- ---
20 T 3/20 11.3-11.4
12.4, 13.2		 Proofs with quantifiers s16-quantifiers-and-proofs.ppt 12.4, 12.7, 13.3, 13.4, 13.5, 13.7, 13.8, 13.12, 13.16 3/20 3/27
21 H 3/22 11.5, 11.6, 13.3 Proofs with quantifiers s17-more-q-proofs.ppt --- --- ---
22 T 3/27 --- review for exam 2 s25-exam2-review.ppt --- --- ---
23 H 3/29 --- --- Exam 2 --- --- --- --- ---
24 T 4/3 1.1 p31-40 (ITC) Intro to automata theory; string and languages, FA: Intro, definition, design s26-FA-intro.ppt hw10-FA1.doc 4/3 4/10
25 H 4/5 1.1 p41-44 designing FA from scratch --- --- --- ---
26 T 4/10 1.1 p40,44-47 computation, regular languages, regular operations, union s27-regular-operations.ppt hw11-FA2.doc 4/10 4/17
27 H 4/12 1.2 p47-54 Nondeterminism, NFA, e-transition, NFA design s28-NFA.ppt --- --- ---
28 T 4/17 1.2 p54-63 Equivalence of NFAs and DFAs s29-NFA-vs-DFA.ppt hw12-FA3.doc 4/17 4/24
29 H 4/19 1.2 p54-63
1.4 p77-83		 Closure properties of regular languages
understanding pumping lemma, using pumping lemma		 s30-pumping-lemma.ppt
s31-using-pumping-lemma.ppt		 --- --- ---
final H 4/26 --- --- Final Exam --- Thu Apr 26.  2:00pm-3:50pm   --- --- ---

Class

Date

Reading

Topics/Info

 Notes Homework HW assign date HW due date