# Homework 5

Build truth tables for the following formulas:

1. $$A \vee B \vee \neg C$$
2. $$(A \wedge \neg B) \vee C$$
3. $$(\neg A \leftrightarrow B) \vee B$$

Express the following statements in propositional logic:

1. $$B$$ and $$C$$ are both true should $$A$$ be true.
2. $$B$$ is known to be true when $$A$$ is true and not otherwise.
3. At most one of $$R$$, $$S$$, and $$T$$ can be true.
4. The grass is wet if either it rained or the sprinkler was on. (Create propositional symbols, and give their definitions.)

We have a knowledge base that contains:

a. $$(R \rightarrow S) \wedge Q$$

b. $$(J \wedge Q) \rightarrow P$$

c. $$Q \rightarrow Z$$

d. $$P \rightarrow \neg Q$$

e. $$(R \rightarrow S) \rightarrow (\neg H \rightarrow J)$$

f. $$(\neg Q \vee T) \rightarrow J$$

Derive each of the following using inference rules for propositional logic. Indicate the rule used (i.e., MP for modus ponens) and the propositions used with the rule. You can use propositions you have already proved but were not in the initial knowledge base.

1. $$Z$$
2. $$\neg P$$
3. $$\neg (J \wedge Q)$$
4. $$\neg J$$
5. $$\neg T$$