I will have office hours from 8-12 Monday December 13th. I have uploaded a practice final to the schedule page. ( It has five questions, but the actual test will only have four.) The final test for the 9-10:15 class is Tuesday December 14th 8-10. The final test for the 12-1:15 class is Tuesday December 14th 12:45-2:45.
Class begins with clicker quiz, then test on predicate calculus. I've uploaded the solution to the problem we did not finish in the 9 o'clock class, but we did barely finish in the 12 o'clock class (test12prepsolvedproblem). It is worth spending some time with.
Solution to test 11 and test12prepB has been uploaded to the schedule page. Quiz on predicate calculus involving QE rules on Tuesday. Then work proofs from testprep12a and 12b.
Test 11 is due at the beginning of the period. (Tests turned in afterwards are downgraded 1 pt. per hour late. As before, messy work won't be graded and even slightly messy work will be downgraded.) We will have a quiz at the beginning of the period on proper use of quantifier rules, including QE. Afterwards we will work through test12prepA, which has been uploaded to the schedule. (Note: I incorrectly told the 9AM class that we would have a test at the end of the period. We will have our 12th test on the last day of class 12/9)
I have uploaded the solution to test 10 and uploaded a takehome test 11, which is due at the beginning of class on Thursday 12/2. This test involves identity. For more practice on identity translations and trees, work through the solved problems on p.159-162.
On Tuesday 11/30 the 9:00 AM class will begin with a quiz on identity, which we began but did not finish on 11/23. The content of lecture for both classes will be the predicate calculus sections 7.2 and 7.3. There will be no quiz or test for the 12:00 class.
Please note that the syllabus guarantees 14 quizzes and 12 tests. These will be satisfied within the regular semester. However, a 13th test will be offered on the final exam date as well.
I've uploaded test 10 to the schedule page. It is due Tuesday at the beginning of class. Be sure to do it neatly. Sloppy penmanship or tests with scratchouts aren't acceptable with take home work and they won't be graded. On Tuesday we will cover section 6.6 and have a quiz at the end of the period.
I have uploaded a worksheet (test10prep) to the schedule page. We'll begin Thursday with a quiz on the proper use of refutation tree rules for predicate logic, then we will review the worksheet problems. Solution to test 9 has been uploaded.
Campus closed 11/11 for Veterans day. I have uploaded Test 9 to the schedule page. Turn it in at the beginning of class on 11/16. Review the refutation tree rules for propositional logic. We will begin class with a quiz on truth tree rules for propositional logic used on predicate logic formulas. We will begin refutation trees for predicate logic.
I have added a few more translation problems to test8prep. Tuesday we work on those, and then begin refutation trees for predicate logic. Read section 6.5. We will be skipping section 6.4.
Read through 6.3 and do the solved problems on p. 141. I've uploaded a predicate logic translation worksheet (test8prep) to the schedule page which you should do. We'll review that during most of the period and then finish with a clicker test on translations and wffs in predicate logic.
10/28 & 11/2
I have added some new medium difficulty problems to test7prep and uploaded the solution to test 7. I will not be in class on Thursday, but you should definitely come! For the 9 o'clock class Eddy Seward will be there to help people who need it. Liku Madoshi has also volunteered to help. If you are a 12 o'clock student and would like to come to the earlier class, do so. It is in DH 208. Eddy can't come to the 12 o'clock class, but there are several student who are well able to help those of you who are having trouble. This will be your last real in class opportunity to solidify your understanding of the proof procedures of propositional logic, which you will continue to use in the next chapters.
For Tuesday we move on to predicate logic. 6.1- 6.2. Work all solved problems. We will have a clicker quiz on the proper use of quantifiers, variables, predicates, and names at the end of the class.
We'll work some more problems from the test7prep worksheet then take a test. I am going to be out of town on Thursday 10/28 and class will be optional. I am looking in to having someone come in to help people who want to work more proofs. Thursday we will begin chapter 6 on Predicate Logic. We are not doing chapter 5.
I've uploaded a worksheet (test7prep) to the schedule page. Do at least the first five problems. We'll begin Thursday with a clicker quiz on the new rules and equivalences, then work on these problems. In additions to the rules from 10/19, be sure you know the following equivalences: Commutation, Repeat, Material Implication, Double Negation, and Transposition.
The solution to test 6 has been uploaded to the schedule page. Tuesday we will be working on proofs with derived rules. Please memorize the following rules. We'll have a clicker quz at the end of the period on their use in proofs: Modus Tolens, Hypothetical Syllogism, Reiteration, Contradiction, Disjunctive Syllogism, and DeMorgan's.
I've uploaded a worksheet that involves both of our hypothetical rules. Please work hard on the first 5. We'll go over them in class and take a test at the end involving a couple of proofs similar to these.
We will be working on ~I and doing a clicker quiz at the end of the period. (Section 3 will take two quizzes, one of conditional introduction at the beginning of the period, which we weren't able to get in on 10/7). Make sure you can work the first few solved problems on ~I.
A conditional introduction worksheet has been uploaded to the schedule page. Please work on these, and we will go over them in class before the test at the end of the period. Section 3 (12-1:1:15) will begin class with the quiz we were not able to do on 10/5.
Tuesday we will cover the two hypothetical rules: conditional introduction and negation introduction. Please read section 4.3 a few times, as these rules are a little more complicated than the other basic rules. We will have a clicker quiz at the end of the period on the proper use of these rules.
Thursday we will spend the first part of the period working proofs with the basic rules. The test will be to write down all the basic rules from memory and to do one proof. I have uploaded a sheet with a list of basic rules to the schedule page. You will need to write them down in this form for the test. I have also uploaded a sheet with the proofs we will work on Thursday. Be sure to try to do them on your own before class.
The solution to test 3 has been uploaded to the schedule page. Read section 4.1-4.2 and memorize the following inference rules: Conditional Elimination, Negation Elimination, Conjunction Introduction, Conjunction Elimination,Disjunction Introduction and Disjunction Elimination. We will finish the class with a quiz on these rules.
By 10 AM Wednesday there will be a homework sheet with extra truth tree problems attached to the bottom of the schedule page. We will work some of these problems on Thursday before taking a test. You will be able to use your book and notes, but it is a very, very, very bad plan to rely on them in any way. Constantly referring to the book will become extremely confusing in a test situation. Memorize the rules cold!
Please make a habit of checking your grades in this class on the e-instruction site. I occasionally make recording errors, so please hold on to your tests so that you can demonstrate any discrepancy. Let me know immediately.
If you have gone to any of the McCormick/Disilvestro debates and would like credit for attending, please click on the Attendance Credit link in the sidebar. Follow the instructions carefully, noting that the absolute due date for submitting a summary is this Sunday at midnight.
Finish memorizing the refutation tree rules. We will review the rules for biconditional at the beginning of the period and then take a clicker quiz. Afterwards we will work problems on refutation trees. On Thursday we will continue to work refutation tree problems and we will have a test at the end of the period. In addition to the solved problems on pages 72-74, you should work problems 1-6 in section IV of page 79.
The solution to Tuesday's test has been uploaded as a pdf attachment to the bottom of the schedule page. For Thursday, please read section 3.7 and memorize the tree rules: Negation, Negated Negation, Conjunction, Disjunction, Negated Disjunction, Conditional, Negated Conditional.
As noted below, we'll have a test on truth tables on Tuesday at the end of the period. Be sure you are able to write down all the truth tables for all the connectives from memory when you come to class. Your test will consist, not of writing down the tables themselves, but of doing truth tables for wffs and determining whether the wff is tautologous, inconsistent, or truth-functionally contingent as in 3.5. In class we will also be learning how to use a truth table to test for validity as in 3.6, but the test will not cover that.
Read through 3.6 and begin to memorize the truth tables for all the connectives. On Tuesday 9/14 you will have a test that will depend on you knowing the truth tables from memory (no book allowed) so you should start now and test yourself on the ability to reproduce them perfectly several times before then.
On 9/9 we will have a test on translating English sentences into propositional logic, wffs. and the scope of connectives. We will use clickers to take this test. To prepare be sure you can do all the solved problems through page 55.
Work all problems on pages 48, 51, and 53. The solutions are given, but be disciplined about not using them. As in math, it is extremely tempting in logic to just look at solved problems, notice that the solution makes sense to you, and conclude that you understand it. You don't understand it until you can do it on your own! So just use the solutions to check your answers and figure out where you have gone wrong. (This applies to everything you do for the rest of your life.)
As noted in class, we will not have a test on Tuesday, but rather another clicker quiz. The quiz will begin with the following. Be sure you have answered it before coming to class, since you won't be given a lot of time to figure it out.
Symbolize the following argument using:
R= Jennifer is on the roof.
P= Jennifer is pounding in a nail.
S= Maude in soaking in the tub.
T= Maude is eating taquitos.
1. Either Jennifer is on the roof and pounding in a nail or Maude is soaking in the tub and eating taquitos.
2. Jennifer is on the roof.
3. Therefore Jennifer is pounding in a nail.
Is this a deductively valid argument?
Get your clickers registered and study the syllabus carefully. We will begin class with a clicker quiz on the course requirements and the difference between truth and deductive validity (Section 2.2 and 2.3). Prepare for class by reading Chapter 3 through section 3.4.
8/ 28/ 2010
Hey, I'm teaching two sections of Philosophy 60 Symbolic Logic this semester: Sections 2 and 3. Both of these courses use the same syllabus and run on the same schedule. If you look at the syllabus, you'll see the basic requirements and what you need for the course.
Your book is called Schaum's Outline of Logic, available at the Hornet bookstore and plenty of other online dealers as well. It's cheap. Definitely buy it.
You also need to buy or rent a CPS RF response pad, otherwise known as a "clicker". You need the clicker that is being sold in the Hornet bookstore. It is made by E-Instruction. If you have an older E-Instruction clicker, that's fine, but clickers made by other companies will not work.
You must register the clicker online according to the instructions on the box. If you find yourself without these instructions, simply go to www.einstruction.com and click on the tab that say "Students pay for and register your clicker" and follow the instructions.
To register your clicker you will need a credit card. You will also be asked for a unique number called a "class key". The class keys are:
Be sure you know which section you are in! It's best just to copy and paste this number into the box.
If you have any questions about anything, just e-mail me: firstname.lastname@example.org