For homework Thursday turn in problem 10 and 12 from today's homework sheet. (The problems have been renumbered, so be sure to look at the sheet again.)

Solutions to yesterday's homework are posted on the schedule page.  

Tuesday we will move on to derivations in free logic. As the notes and book explain, this involves the adoption of new rules for the quantifiers, so when you do free logic you can not use the regular quantifier rules from predicate logic. All other inference rules and equivalences apply, including rules for modal operators.

Here is the homework for Tuesday. Turn in problems 1-3. Answer the question posed under 1. I'll assign problems from the same page for Thursday, but I'm not sure which ones yet.

Full solutions to the last two homeworks are on the schedule page. Thursday's homework is still as advertised below.

Tuesday:

• We'll do some more modal logic derivations on Tuesday from the same sheet. Turn in the orange ones for homework. During the second half of the period we'll talk some about Meinongian free logic. Slides and text in the schedule under weeks 9-10.

Thursday: 

• We'll do Meinongian free logic semantics. Here is the homework. Turn in all. 

Solutions to yesterday's homework are posted on the schedule page. We'll finish up the problems in the second column on Thursday and then move on to derivations in modal logic, which are covered in the second half of the lecture slides.

This morning I noticed a typo in the Homework for Thursday.  The assigned problem #4 originally said to use the result from #2, but it should have said #3. This has been changed. Sorry about that!

Exams are graded and scores posted to Canvas.  There was a 4 point curve. When you get your exam back be sure to check that your Canvas grade is 4 points higher than the raw score on your exam.

Next week we move on to Leibnizian modal logic. 

Here is Tuesday's homework. Submit all.

Here is Thursday's homework. Submit the blue ones.

The solution to the test is posted here and on the top of the schedule page.  Let me know if you think you detect any problems with answers on the last page. The trees and proofs are all from previous homework.

Next week we move on to modal logic. I will be posting homeworks by tomorrow.  Reading and lectures are from weeks 7 and 8.

Solutions to today's homework are now posted.

A couple of points with regard to the test:

1. Note that for HW 1 only a couple of tree solutions are provided. However there are two other problem sets labeled More1 and More2. These were not formally assigned to you, but full solutions are presented, so they may occur on the tests.

2. Note that the solutions to HW 3&4 provide you with a link to video & slides on which several of the proofs are presented. Do not neglect to study these. A few of them are a little tricky, but these are fair game for the test as well.

For Thursday's test you will have access to this sheet of rules and equivalences. Otherwise it is closed book.

See previous post for Tuesday's homework.

Here is a practice test. And here is the solution to it.

As noted in class, there will be no surprises on this test. The first four problems will be drawn from previous homeworks, all of which have solutions online. The last problem will involve the same model that is on the practice test. Only the questions will be different.

Do not fail to prepare well for this test! It is foundational material for the rest of the course, and, except for the homework, it is the lowest hanging fruit you will encounter.

Here is the homework for Tuesday.  Please submit the even numbered problems. (I am asking you to do more than the usual amount for submission because there will be no homework on Thursday.) You will need to engage the material on identity and functions.

I have posted solutions to the homework for yesterday on the schedule page.

I'll be posting a practice test sometime today.

Here is the homework for Thursday. Turn in the blue ones and try to have attempted problems 1-7.

This homework permits the use of equivalences from propositional and predicate logic. We'll start class by reviewing them, but you will find a summary of propositional logic equivalences in the propositional logic materials labeled Ch 4.4 (and here for convenience.) You will also find a summary of the quantifier equivalence rules under the predicate calculus materials labeled Ch 8 (and here for convenience.) This summary also contains the derivation rules for identity, which you may ignore for the time being.

I'll have solutions from today's homework posted by tomorrow morning.