Jonathan Bain
Technology, Culture and Society
NYU-Tandon
PL-UY 2004 Symbolic Logic
[Home]
Prof:  Jonathan Bain Spring 2016
Office:  LC124             
T/Th 12:30pm-2:20pm
Off. hr:  W 1-2pm  phone:  997-3688
I.  Description
This is an introduction to the methods and applications of 1st-order symbolic logic, including both propositional logic (PL) and relational predicate (or "quantifier") logic (QL).  The course covers methods of testing arguments for deductive validity and deductive invalidity, as well as methods for identifying tautologies, contradictions, and logical equivalences.  In addition, the tree method will be used to demonstrate soundness and completeness of PL and QL.
II.  Required Text
 Smith, P. (2003) An Introduction to Formal Logic, Cambridge University Press.
III. Course Requirements
1. There will be a homework assignment given each week.  The assignment for any given week will be due at the beginning of class on the Thursday of the following week (with exceptions noted on the schedule below).  Late assignments will not be accepted.  Your final assignment grade will be calculated from the highest 10 of your 13 individual assignment grades.
2. There will be two exams and a final.  The final will be minimally cumulative (i.e., it will emphasize the units not cov-ered by the preceding exams, but may include a few questions from previous material).  Makeup exams can only be given in very extenuating circumstances (medical emergencies) and require an appropriate formal written excuse.
IV.  Grade Distribution
Homework: 20%      
Exams: 25% each
Final:  30%
V.  Reminders on University Policies
1. Incompletes.  It is university and TCS departmental policy that incompletes can be given only in very extenuating circumstances (medical emergencies, etc.).  In particular, an incomplete cannot be given because of a heavy course load, job commitments, or because you've simply fallen behind in the course.  For this reason, you should attend every lecture and make sure you're aware of assignment deadlines and exam dates.  If for whatever reason you find yourself falling behind during the semester, do not hesitate to see the instructor as soon as possible.
2.
 		University Honor System.  All students should be aware of the university policy on cheating and plagiarism.  Cheating on an exam, or plagiarizing on an essay assignment, are sufficient reasons for receiving an F in the course
3.
 		Moses Statement.  If you are student with a disability who is requesting accommodations, please contact New York University’s Moses Center for Students with Disabilities at 212-998-4980 or mosescsd@nyu.edu.  You must be registered with CSD to receive accommoda-tions. Information about the Moses Center can be found at www.nyu.edu/csd. The Moses Center is located at 726 Broadway, 2nd floor.
VI.  Class Schedule
The following schedule may be subject to revision over the course of the session.
1 Tues 1/26.  Course intro.
Chap 7.
 		Thurs 1/28.  The language PL.
Chaps 8 & 9.  hw#1 out
2
 		2/2.  Truth functional connectives.
Chap 11.
2/4.  Tautological entailment.
Chaps 12 & 13.  hw#1 due; hw#2 out
3
 		2/9.  The language PLC.
Chaps 14 & 15.
 		2/11.  PL trees.
Chaps 16 & 17.  hw#2 due; hw#3 out
4
 		2/16.  PLC trees.
Chaps 18 & 19.
 		2/17.  PLC trees, cont.
hw#3 due; hw#4 out
5
 		2/22.  Trees and proofs.
Chap 20. 		2/25.  The language QL.
Chaps 21 & 22).  hw#4 due; hw#5 out
6
 		3/1.  QL translations.
Chap 23 & 24.
 		3/3.  QL trees.
Chap 25.  hw#5 due; hw#6 out
7
 		3/8.
EXAM #1
3/10.  QL syntax.
Chap 26.  hw#6 due; hw#7 out
8
 		3/15.
NO CLASS (Spring Break)
3/17.
NO CLASS (Spring Break)
9
 		3/22.  QL semantics.
Chaps 27 & 28.
 		3/24.  QL semantics, cont.
hw#7 due; hw#8 out
10
 		3/29.  More QL trees.
Chaps 29 & 30. 		3/31.  QL trees, cont.
hw#8 due; hw#9 out
11
 		4/5.  Extensionality and Identity.
Chaps 31 & 32.  		4/7.  Extentionality and Identity, cont.
hw#9 due; hw#10 out
12
 		4/12.
EXAM #2
4/14.  The language QL=.
Chap 33.  hw#10 due; hw#11 out
13
 		4/19.  Descriptions and Existence.
Chap 34.
 		4/21.  QL= trees.
Chap 35.  hw#11 due; hw#12 out
14
 		4/26.  QL= trees, cont. 4/28.  Functions.
Chap 36.  hw#12 due; hw#13 out
15
 		5/3.  Godel's Theorems, Part 1.
 		5/5.  Godel's Theorems, Part 2.
16
 		FINAL:  Date to be announced by Registrar