If you haven't already, please take a few minutes to fill out the class evaluation (you received an invitation to do so by e-mail.) You will get 1 point of extra quiz credit for doing so even if you have accumulated the 50 max possible.
Test number 13 will be administered during the final exam period, Monday 10:15-12:15. It will have two predicate logic problems, at least one involving the identity rules.
Also, most people were clueless on test 12, so I am going to administer it again to anyone who would like to retake it during the final exam period. It is not a difficult problem. The reason people did poorly on it is that they tried to negate only one of the disjuncts. This would only work if one of the disjuncts appears to be tautological, but neither is. So just ask yourself: How would you normally begin a ~I proof?
Quiz and test involving identity. There is a video solution to the last homework set and also two identity problems we didn't get to work on in class. I also uploaded the corresponding document with the completed solutions as test12prepsol.
We will introduce the rules for identity and work some problems. I have uploaded some extra problems involving QE and I will put a solution to them up by Thursday, but we will not work them in class. The identity problems we work on Wednesday will also involve QE. We will have a quiz on the identity rules if time permits; if not, we will do it at the beginning of class on Friday before the test.
We will cover section 7.4 Quantifier Equivalences work some problems and finish with a quiz.
I have uploaded the solutions to Wednesday's homework as Test11prepsol. On the bottom of the page are 3 more problems. One of these problems will be on the test on Friday. Sometime Thursday I will upload a video solution to these three problems and post the link on the schedule page. The test is closed book (the price we pay for having one problem in advance.)
I have uploaded the slides from Wednesday as PredicateCalculus and homework for Wednesday as Test11prep. Make sure to work the solved problems from 7.3, as some of them are similar to the homework problems.
I've uploaded the solutions we worked out on Friday along with some advice on how to do the ones we didn't get to as
Predicatecalculuspractice1solutions. On Monday we will introduce the two rules for the existential quantifier from 7.3 and work some problems.
I have uploaded Predicatecalculuspractice1 as homework for Friday. We'll begin class with a quiz on Universal Elimination and Universal Introduction, then review the homework.
Refer to the 'attendance credit' link in the sidebar for instructions on doing summaries for any session of the Symposium that you attended. You can get credit for a maximum of 3 summaries during the semester. All summaries due Sunday at midnight. No late ones accepted. Note: Any summary must cover all 3 presentations given during the session.
There is a link to the solution to Test 10 on the schedule page. Monday we will cover section 7.1 and 7.2.
Class will be at the Symposium on Wednesday. On Friday we will have a quiz but no test. regular class, no test, cover
I've uploaded the solutions to all the problems on Testprep10 as Testprep10solutions, and I have uploaded about half of Test 10 as Test10 partial. Test 10 will be closed book.
I've uploaded some homework problems most of which involve identity as Testprep10. We'll start with a quick quiz on identity then take turns working these problems to prepare for Friday's test. Friday's tests will be like last Friday's. Some translation, some evaluation in a model, so be sure to review the previous solution.
I've uploaded the solution to Friday's test. On Monday we are going to talk about section 6.6 on Identity. We are skipping 6.5, which is refutation trees in predicate logic. 6.6 begins doing refutation trees with identity on p. 160. You do not need to study these. Focus on 158 and work the solved problems on 159. We will plan on having a translation quiz involving identity at the end of the period.
We will have an in-class test very similar to the homework we did for 4/13. I have uploaded a part of the test, for those who would like to prepare a bit. It is closed everything.
Testprep9 has been uploaded to the schedule page. They are like the problems we were doing today, only on a slightly modified world. Pay attention to the notes below the table. The test will be similar to this one, except that it will also require you to write some wffs. that are true of the world.
A solution to test 8 has been uploaded to the schedule page. I won't be able to get your tests back to you before Friday, so be sure and study the solutions prior to Friday's test.
Test8 has been uploaded as a .doc and a .pdf. If you want to get full credit, you'll need to type it, so for most people the easiest thing will be to download the .doc. The test is due Monday morning within the first 5 minutes of the beginning of class. No late tests accepted. Be sure you can do all the solved problems on page 141. We will have the quiz we didn't take Friday on Monday, then discuss section 6.4 on models.
We will finish the translations exercises from predicatetranslationpractice, review formation rules as presented in 6.3 and take a short quiz if there is time. You will have a takehome test due Monday on translations in predicate logic. You may collaborate on this test, but your final product has to be typed in order to receive full credit.
Additional predicate logic translation problems have been uploaded as predicatetranslationpractice. We'll work on these in preparation for a translation test on Friday. Be sure to work on them prior to class. Like everything else we have done, you get a false sense of understanding these if all you do is follow along in class, but don't produce. We'll begin Wednesday with a short translation clicker quiz.
We'll start with a quiz on 6.1 and 6.2, then work on translations for the rest of the period. Be sure you can do all of the solved translations in these sections. (I said I'd put up some more, but I decided not to. The ones in the book are sufficient for preparing for the quiz.)
We will cover sections 6.1 and 6.2 and will have a quiz at the end of the period. Work the solved problems from these sections before class.
A paper solution to test 7 (inadvertently named Test 8) is posted to the schedule page.
We will have a test on Wednesday. There will be two proofs on the test. The first one will be one of the first three on Testprep8 (which we worked today in class) the second one will be chosen from one of 4-10 on Testprep8. The test will be closed book. On Friday we will begin Predicate Logic, Chapter 6. Sometime on Tuesday, hopefully by late morning, I have posted an instructional video on ~Introduction to the schedule page. (When you click on the link you may notice that session is titled Negation Elimination. It's a mistake, just ignore it and proceed.)
We will spend one more day working propositional logic proofs using equivalences. I have uploaded Testprep8 which contains many problems for you to work on using any rules from chapter 4. Some of them will look familiar. On Wednesday 3/30 we will have a test on proofs using equivalences. On Friday 4/1 we will begin chapter 5 predicate logic. During spring break I will make a few remedial videos for those of you who are trying to do some backlarnin. Watch this space and have a good, safe break.
We'll have a clicker quiz at the end of the period on the proper use of derived rules and equivalences. The equivalences that are most important to memorize are: DeMorgans', Commutation, Association, Double Negation, Transposition, and Material Implication. There is also one not mentioned in the book that is useful as well. We will call it ~-->, and it is the equivalence of ~(P -->Q) with (P & ~Q).
I uploaded the proofs we completed on Wednesday as well as a partial solution to problem 5 as Testprep7solutions.
Homework problems have been uploaded in preparation for Test 7, which we will review on Wednesday. Test 7 will occur the Friday after we return from spring break. There will be no test on Friday 3/18, but we will have a clicker quiz and a regular class which will focus on the essential equivalences in propositional logic.
A video solution to test 6 has been posted to the schedule page. On Monday we will review the significant derived rules and equivalences for propositional logic.
Test6prep is revised with all problems we've worked in class. Be sure you can do all of them without aid of notes or book. Test Friday is closed book and notes and will cover everything we have learned in class to date. Guaranteed you will need to be able to do vE, ~I, and -->I.
We'll start with a clicker quiz on both hypothetical rules, then we will work problems from Test6prep, which have been uploaded to the schedule page. The solutions to the problems we worked out on Monday are on that document as well.
On Monday we will be reviewing the other hypothethical rule, negation introduction. Study p. 92-96. A (nonvideo) solution to test 5 has been posted to the schedule page.
Test Friday on conditional introduction. I will not be in class. The test will be administered by Paige Nordberg, one of the class tutors. I have uploaded to the schedule page the problems we worked in class today. I partly worked out the last one so that you can use it to practice your justifications. Also, Miles pointed out a couple of important mistakes in the annotated solution on Testprep5. I have fixed it and added color to the missing lines. The comments have all been changed to reflect the new line numbers. Study hard for this test. You will need to be able to do all of the solved problems easily in order to do well on this test.
We'll begin the class with a clicker quiz reviewing the proper use of conditional introduction. Then we'll review the problems in Testprep5, which I've uploaded to the schedule page. Be sure to study all the solved conditional introduction problems in the book as well.
We'll begin class with a quiz reviewing the basic non hypothetical rules. We'll then introduce the hypothetical rule of conditional introduction, which the book discusses on page 87-92. So read those pages carefully and you also might want to take a look at the video solution to Friday's test, which is on the schedule page.
I have uploaded the solutions to the Test4prep problems we worked in class on 2/23. At the bottom of that document are 3 extra practice problems. On Friday we will begin with a quiz on proper use of all of the inference rules. Then we will take a test involving problems similar to those on Test4prep. Be sure to memorize all the rules. The test will be open book, but the book will not help you if you haven't memorized the rules.
I have uploaded Test4prep to the schedule page. Be sure to work on all of the problems before class. Also study and be sure you are able to reproduce all of the worked problems involving non hypothetical inference rules. Come with questions about any you don't understand.
A video solution to test 3 is available on the schedule page. On Monday we will finish the non hypothetical inference rules for the propositional calculus and do some proofs involving them. You just plan on having these rules committed to memory by Wednesday, when we'll have a clicker quiz on them.
Refutation tree test on Friday during first 20 minutes of class. No books or notes this time. I've uploaded a couple of more problems with solutions to the schedule page. We'll finish the period by adding some more rules to the propositional calculus.
Make sure you can work all the homework problems from 2/14. The test on Friday will have problems of similar difficulty. We'll begin the day with a quick refutation tree clicker quiz, then go over sections 4.1 and 4.2.
I put up a video solution to test 2 on the schedule page. It's in HD, so if you have a decent connection, it would be better to watch it full size because you can see the whiteboard better. If you're having some trouble with any of the basics of refutation trees it might help you to watch it. Four additional problems have been uploaded to the schedule page. The document is entitled ReftreePracticePhl60Sp2011.
I've uploaded a short problem set to the bottom of the schedule page entitled Test2prep, as well as some notes on refutation trees. We'll begin the period by working a few problems from the set, then finish with a test on similar problems. The test will be written.
Memorize all truth tree rules from 3.7. We'll review them, work some problems, and take a clicker quiz on the rules.
Read 3.7 on Refutation Trees and begin committing to memory the following rules: Negation, Negation Negation, Conjunction, Disjunction, Conditional.
We will show how to use truth tables to determine properties of wffs and to determine whether an argument is valid or invalid. We'll finish with a 15 point clicker TEST on everything we have learned to date. I've uploaded class notes from the first two weeks of class to the bottom of the schedule page. Make sure you have read through 3.6 of the text.
We will begin with a clicker quiz on wffs., scope, and identifying main connectives. We will then finish our discussion of the truth tables for the connectives and begin to show how truth tables can be used to determine truth values of wffs. and whether they are tautologous, inconsistent or contingent. (3.4-3.5)
Read section 3.4 and start to memorize the truth tables. Monday we will solidify our understanding of the formation rules and understanding the scope of the operators. Then we will develop the truth tables for the operators.
Work all problems on pages 48, 51, and 53. The solutions are given, but be disciplined about not using them except to check your answers. 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 Friday, but rather our first clicker quiz. The quiz will be over the syllabus, the concept of deductive validity, and the symbolization of sentences in propositional logic. Be sure you have registered your clicker online using the registration key I provided below.
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.
1. Textbook: Schaum's Outline of Logic, by Nolt, Rohatyn and Varzi.
All materials are available at the Hornet Bookstore. Note: You may purchase or rent either the CPS GEN 2 RF Response Pad or the CPS Pulse Clicker, but no other clicker will work.
Instructions for registering clicker
You will need to register your clicker for this class. Register it online according to the instructions on the box, or do one of the following.
1. If you just acquired this clicker, then click here to register it. You'll need a credit card and a class key (a number) from me in order to do so. That number is
2. If you are using a clicker that you have previously registered, click here and log in. Then follow the instructions given in 1 above.
That's it for now!