Philosophy 303 is an introduction to modern formal logic that is meant to
be accessible to undergraduate students at all levels. It is taught by Associate
Professor Jamie Tappenden of the Department of Philosophy.
The GSI is Jason Konek, email@example.com . An additional grader is Michael Docherty, firstname.lastname@example.org .
The class meets from 10:10-11:30 AM TTh in room 1300 Chem
Office Hours (Held
in 2228 Angell Hall):
Tuesday 1:00 - 2:00, Thursday 1:00 - 2:00, or by appointment. Office hours for Konek and Docherty will be posted.
Send e-mail to email@example.com
Grades will be assigned using this formula: 30% final, 20% midterm, 50% homework.
The class will be “curved” so final grades may be higher than raw grades (raw grades will not be lowered, though)
The one exception to the formula is: if someone does markedly better in the second half of the course (i.e. shows significant
improvement over the term) then the later grades will be weighted a little more heavily, depending on the degree of improvement, etc.
Thursday February 19 -- Midterm Exam
February 21 – March 2 --- Winter Break
Tuesday April 21 --- Final Class
Required Text: Logic, Algorithms and Formal Languages (chapters 1 – 11)
This book is part of a work in progress. The manuscript is available at this url:
(I will provide the password in class.)
Problem sets will be due at the end of nearly every week, at 3:00 Friday. (Except the week of the midterm, and the final week of classes.)
I have posted a sets of “worked examples” for problem sets 1, 2 and 4 to give you an idea of what is expected.
Solutions to the problem sets will be posted right after they are due. LATE PROBLEMSETS WILL NOT BE ACCEPTED.
The grades will be calculated in terms of your best ten problem sets (discarding the lowest) so if there is some emergency or conflict, you can miss a problem set without a zero counting toward your grade. If you need to miss more than one, you’ll need a good reason, of the “documented illness or family emergency” variety.
· Assignment #1 Due Friday Jan. 16 -- Answers
· Worked examples for problemset 1
· Assignment #2 Due Friday Jan. 23 -- Answers
· Worked examples for problemset 2
· Notes on Induction and Recursion
· Assignment #3 Due Friday Jan 30 -- Answers
· Assignment #4 Due Friday Feb 6 -- Answers
· Worked examples for problemset 4
· Notes on FSA’s for Unions of languages
· Assignment #5 Due Friday Feb 13 -- Answers
· Notes for the Week of Friday Feb. 13: Finite and Infinite counting; The Pumping Lemma
· Readings you are responsible for on the Midterm
· Practice Midterm
· Practice Midterm Solutions
· Midterm Thursday Feb. 19
· Winter Break
· Readings for the second half of the course
· List of the rules for derivations in chapter V
· Assignment #6 Due Friday March 6 -- Answers
· Worked examples for problemset 6 and 7
· Assignment #7 Due Friday March 13 -- Answers
· Assignment #8 Due Friday March 20 -- Answers
· Worked examples for problemset 8 and 9
· Assignment #9 Due Friday March 27 -- Answers
· Assignment #10 Due Friday April 3 -- Answers
· Worked examples for problemset 10
· Assignment #11 Due Friday April 10 -- Answers
· Practice Final
· Solutions to Practice Final
Last updated Jan 7 2009.