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.

I've posted the solutions to the entire homework from today here and on the schedule page. We'll go over some more of these on Thursday, but the homework for Thursday assigned below remains the same.

Solutions to the homework from last week have been posted on the schedule page.

Homework for Tuesday and Thursday of next week are below.

Tuesday homework

Turn in solutions to the first column.

Thursday homework

Turn in solutions to all of the problems.

The relevant material is explained in weeks 3-5 of the schedule.

For Thursday's homework, try to finish this sheet from today. I indicated two other problems to turn in for homework in blue.

Additionally, study the material from the first two lectures on predicate logic relating to names, variables and quantifiers.

I mentioned in class that I will normally be putting up homework for Thursday before class on Tuesday. This time, however, the homework will be more propositional logic problems of the sort that I have assigned for you on Tuesday, but which ones depends on how much work we get done in class.

Here is the homework for Monday. Turn in the blue ones. We will be covering proofs using the hypothetical rules of Conditional Introduction and Negation Introduction. If this material is new for you, please spend time with the relevant videos.

I will be out of town until Sunday evening, but you can still email me. I just might be slower than usual in answering.

I've posted the solutions to the two assigned problems on the schedule page. Normally I post the problems to all of the assigned problems, but trees are kind of tedious. So, instead I've posted more practice trees with solutions under the headings More 1 and More 2.

Also, I am not sure, but it is possible that in doing the second assigned problem from yesterday's homework I made an undetected transcription error that affected the answer. So please be sure to look at the correct one.

Here is the homework for Thursday. I will post the solution to today's homework tomorrow morning. Thursday we will review some of the homework problems and then talk about conditional and indirect proof.