Our Final Test is Thursday May 20th 10:15-12:15.
Solutions to practice final test have been uploaded to the schedule page.
Final test administered from 10:15-12:15. Practice final has been uploaded to the schedule page.
Work problems from test 10 prep using predicate calculus rather than refutation trees. (We did the first two in class on Tuesday.) We'll do class evaluations then finish with test 12, a proof involving QE rules.
I've also uploaded a practice final test to the schedule page.
We'll cover 7.4 and 7.5 and take a quiz at the end on the proper use of identity and quantifier exchange rules.
I have uploaded both the solution to Thursday 5/6 test as well as a solution to problem 4 for the homework, which is worth studying.
We'll begin period with quiz we didn't take on Tuesday. We'll review the practice problems I've uploaded to the schedule page, then finish with a test on the predicate calculus through section 7.3. In addition to the uploaded problems, be sure you can work all the solved problems in 7.1-7.3.
Note: Until 9:45 PM Wednesday night there were errors in the uploaded worksheet on problems 2 and 4. Please see the corrected version. Thanks to Chase for pointing them out.
Beginning predicate calculus. Quiz at end of period covering 7.1-7.3.
Solution to Tuesday's test has been uploaded to the schedule page. Thursday we will cover 6.6, quiz at end of period.
Practice problems for refutation trees on predicate logic have been uploaded to the schedule page. We'll review as many of these problems as we have time for, then take a test on refutation trees at the end of the period.
We will begin with a quiz on refutation trees for propositional logic and end with a quiz on refutation trees for predicate logic.
Click on Nammour 2010 on the sidebar to see the schedule of events. There is a session corresponding to our classtime. In order to receive credit for a quiz on 4/20 you will need to attend this or some other session of the Nammour Symposium and send me a summary of the event by Sunday 4/25. You may attend additional sessions for
class credit according to the rules stated in the syllabus. Please remember that you can get credit for a maximum of 3 extra credit summaries during the semester. Summaries must be well composed in an essay style, about one page in length. Send all summaries to email@example.com as an e-mail, not as an attachment to an e-mail.
Solution to Test 9 has been uploaded to the schedule page. Thursday 4/22 we will begin with a quiz on refutation trees for propositional logic and end with a quiz on refutation trees for predicate logic.
Test on translations at the beginning of the period, then we will study truth trees for Predicate logic. Skip 6.4, read 6.5.
Do the predicate logic worksheet uploaded to the schedule page. We will review these problems and then take a clicker test (which we failed to take on 4/8) on translations. On Thursday we will begin the period with a non clicker test on translations and then begin predicate logic refutation trees.
Work the solved problems on page 132 and 135. Read section 6.3. We will have a clicker test at the end of the class on identifying proper translations.
The solution to Test 7 has been uploaded to the schedule page. Please prepare for class by reading sections 6.1 and 6.2. We will have a clicker quiz at the end of class on the concepts in this section. Have a great break.
Tuesday 3/23, Thursday 3/25
Finish memorizing the equivalences cited below if you haven't already. I have uploaded practice problems to the schedule page including an additional useful equivalence which you should memorize. We will begin class with a quiz on the proper use of the equivalences. This may be a clicker quiz, but it may also be a paper quiz in which you need to state the rules from memory. Be prepared for either one. Afterwards we will review the homework problems. Thursday we will not cover new material. We will just have a test at the beginning of the period. Predicate logic after spring break. (We will skip the chapter on Categorical Logic.)
Notice: I will not be in my office Thursday morning until 8AM.
Memorize the following equivalences from the bottom of page 103. DM, COM,ASSOC, DN, TRANS, MI. We will work some proofs involving the derived rules and the equivalences above, as well as supplementary problems posted to the schedule page. Then we will take a test involving proofs in which you are permitted to use any rule we have learned to date.
Read section 4.4-4.6. Memorize the following derived rules: Modus Tollens, Hypothetical Syllogism, Reiteration, Contradiction, Disjunctive Syllogism. We will do proofs involving these rules and take a quiz on the proper use of these rules at the end of the period.
Solution to test 5 has been uploaded to the schedule page.
Practice problems involving ~I are posted to the bottom of the schedule page. We will work some of these problems and then finish with a test on ~I.
The solution to test 4 is now at the bottom of the schedule page. We will finally introduce negation introduction, and some of the derived rules. At the end of class we will have a quiz on negation introduction and the derived rules we cover.
We will begin class with a test on conditional proofs. Additional practice problems have been uploaded to the schedule. We will end class after the test to allow students to attend the rally at the Capitol, which runs from 11-1.
We will begin class with a clicker quiz on the proper use of conditional introduction and other basic rules we have learned so far. Afterwards we'll work some problems using conditional proof; then we'll introduce the rule of negation introduction, aka: reductio ad absurdum. Read p.92-96 in preparation. Work the conditional proof problems that I have uploaded to the schedule page.
We will begin class with a test. I'll give you a single argument which you will prove valid using the refutation tree method and the propositional calculus. Check the bottom of the schedule page for a few extra problems to work for preparation. After the test we will work on 4.3 with particular emphasis on the rule of conditional introduction.
(Note: Paige pointed out that problem 3 could not actually be performed using the propositional calculus with only the basic non hypothetical rules. I've changed the negations signs so that it can be performed.)
Memorize the following basic inference rules from section 4.2: Conditional Elimination, Negation Elimination, Conjunction Introduction, Conjunction Elimination, Disjunction Introduction, Biconditional Introduction, Biconditional Elimination. We will begin the period with a clicker quiz on these rules. Then we will do some proofs using these rules and discuss the remaining basic rule: Disjunction Elimination. Continue to work on refutation trees. Thursday's test will involve demonstrating the validity of an argument using both a refutation tree and the propositional calculus.
I've uploaded some supplementary refutation problems to the bottom of the schedule page. We'll begin Thursday with a 20 minute test on refutation trees. The test is open book, but if you have not fully memorized the rules, this will not help you very much. After the test, we'll work the problems on the board. Then we'll spend the remaining time on sections 4.1 and 4.2.
Do all of the problems in section IV p. 79. Use refutation trees, not truth tables. We will have a quiz at the beginning of the period on proper use of rules, then we will work refutation tree problems.
Finish reading all of 3.7. We will develop the rules for testing validity of arguments using refutation trees. At the end of the class we will have a short quiz on the rules. Next week we will invert the quiz-test order. We will have a quiz on Tuesday and a test on refutation trees on Thursday.
We'll begin the class with a test, which will be administered using clickers. It will involve translations, identifying wffs., doing truth tables, and basic definitions of terms. Note: you may not collaborate during tests.
After the test we will study the use of truth tables for argument forms and begin learning how to use refutation trees. Read sections 3.6 and the first few pages of 3.7 in preparation for this.
Read 3.4 - 3.5. Memorize truth tables for all the connectives. Clicker quiz at end of class will concern using truth tables to determine truth values of wffs. and whether wffs are tautologies, contingent, or inconsistent.
Note: Always check this space the evening before class meets for changes of plan.
Read 3.1-3.4. Work solved problems 3.5, 3.6. Memorize truth tables for ~, &, v. Clicker quiz will occur at end of period covering concepts of 3.1-3.4.
Welcome to Philosophy 60: Symbolic Logic
For this course you'll need to acquire two things.
Instructions concerning clickers
The clicker costs about 25 dollars new, and it will also cost about 15 dollars to register it for the semester. If more than one of your courses is using this clicker, the registration fee covers all of them. Be sure you buy the clicker I have designated for this class. It is made by eInstruction, and it is the one endorsed by Sacramento State. Other clickers will not work. The clickers are usually available used and they can also be rented through the bookstore.
To register your clicker simply go to www.einstruction.com and click on the link that says: Pay for and Register Your Clicker. Here are some things you need to know.
Read the syllabus before coming to the first day of class. I will take questions about the syllabus, but we will not review it. Your first clicker quiz will be on Thursday. It will cover the content of the syllabus, as well as course content.
See you on January 26th!