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.

Solutions to this week's homework have been posted on the schedule page (as HW7&8).

Please study all those that you had difficulty with, but pay particular attention to problem 7, which is an invalid proof that fails to terminate.  I realized after class that my semantic proof of the invalidity of this argument was hasty, so I've provided the explicit proof underneath.

Here is Tuesday's homework. Turn in the blue ones. Probably Thursday's homework will come from the same sheet, but it will like be expanded to include a few more problems.

To do this sheet you must know all four inference rules for the quantifiers. We have not yet reviewed existential elimination in class, so be sure to engage the video and/or slides and/or text regarding this rule before attempting the homework.  You will also find it helpful to know the derived rules we discussed in class.

Note: The videos on the inference rules for quantifiers make use of some of the derived rules but also the equivalence DN. I have explained how this works on the top of the homework page and you are free to use it even though we have not yet introduced equivalences in general.

I've added three problems involving identity to the homework and highlighted one of them for you to turn in (so there are total of 3 problems, rather than 2 due for tomorrow's homework.)

After working some more trees, we'll introduce Predicate logic derivations.

On Tuesday we will review formation rules for predicate logic and consider any of the formula evaluation problems from yesterday that remain perplexing to you (or that you suspect have been answered wrongly on the solution sheet).

We'll move on to trees in predicate logic.

Here is the homework for Tuesday and Thursday. Turn in the blue ones for Tuesday and the orange ones for Thursday.

I've posted the solutions today's homework here and on the schedule page. Each solution is accompanied by a proof, which you should work to understand and work to be able to produce.

I'll be posting next week's homework tomorrow.