Worksheet

Practice problems: equivalent formulas, negating statements

Published · by

Open PDF The PDF is in Romanian.

Summary

The problems train truth tables, spotting tautologies and proving equivalences. Statements are negated in words, with De Morgan's laws and the negation of an implication, and each implication gets its converse, inverse and contrapositive. The last problem is a small logic puzzle.

Press “Check” next to an exercise. Your answers stay on this device.

Solve the problems in your notebook, with justifications.

  1. Build the truth table and decide which of the formulas are tautologies:

    a) $p \rightarrow (p \vee q)$;

    b) $(p \vee q) \rightarrow p$;

    c) $\overline{p \land \overline{p}}$;

    d) $(p \rightarrow q) \leftrightarrow (\overline{q} \rightarrow \overline{p})$.

  2. Prove the following equivalences with truth tables:

    a) $\overline{p \land q} \equiv \overline{p} \vee \overline{q}$ (De Morgan's law);

    b) $p \rightarrow (q \rightarrow r) \equiv (p \land q) \rightarrow r$.

  3. Write the negation of each proposition in words. For a)–d), state the truth value of the proposition and of its negation.

    a) “The number $35$ is divisible by $5$ and by $7$.”

    b) “$\sqrt{9} = 3$ or $\sqrt{9} = - 3$.”

    c) “If $10 \vdots 4$, then $10 \vdots 8$.”

    d) “$2 < \sqrt{5} < 3$” (that is, “$2 < \sqrt{5}$ and $\sqrt{5} < 3$”).

    e) “Triangle $ABC$ is isosceles or right-angled.”

  4. Let $x$ be a real number. Write the negation of each statement:

    a) “$x > 1$ and $x \leq 5$”;

    b) “$x < - 2$ or $x \geq 3$”;

    c) “If $x^{2} = 9$, then $x = 3$.”

    For c), find a value of $x$ for which the negation is true.

  5. Write the converse, the inverse and the contrapositive of each implication, and state the truth value of the four statements:

    a) “If a quadrilateral is a square, then its diagonals are congruent.”

    b) “If a natural number is even, then its square is even.”

  6. Given that the proposition $(p \vee q) \rightarrow r$ is false and that $v(p) = 0$, find $v(q)$, $v(r)$ and the truth value of the proposition $\overline{q} \rightarrow (p \land r)$.

  7. Let $p$: “Ana goes to the cinema” and $q$: “Ana studies”.

    a) Express in words: $\overline{p} \land q$, $\overline{p \vee q}$, $p \rightarrow \overline{q}$, $\overline{p \rightarrow q}$.

    b) Which of these propositions says the same thing as “Ana neither goes to the cinema nor studies”?

  8. How many rows does the truth table of a formula with $3$ variables have?

    And with $n$ variables?

    Build the table of the formula $(p \vee q) \rightarrow r$ and state for which values of $p$, $q$, $r$ the formula is false.

  9. Challenge. One of Radu, Sorin and Tudor ate the cake. Radu says: “Sorin ate it.” Sorin says: “I did not eat it.” Tudor says: “I did not eat it.” Knowing that exactly one of them tells the truth, find out who ate the cake. (Hint: compare what Radu and Sorin say.)

Frequently asked questions

When are both an implication and its converse true?

Then the propositions are equivalent: $p \leftrightarrow q$ is true, and in mathematics we say “$p$ if and only if $q$”. To show this, you prove $p \rightarrow q$ and $q \rightarrow p$ separately; the second one can be replaced by the inverse of the original implication, $\overline{p} \rightarrow \overline{q}$, which has the same truth value.

How do I write the negation of a compound statement in words?

Start from the symbolic form: find the simple propositions and the operator that links them, apply the negation rule, then translate back into words. Writing “It is not true that…” is correct, but a well-written negation moves the “not” onto the simple propositions, as in “is not … or is not …”.

How do I show that an implication is false?

Look for a case where the hypothesis is true and the conclusion is false; a single such case, called a counterexample, shows that the implication is false. Check both parts: the hypothesis must hold and the conclusion must fail. For a true implication, on the other hand, an example is not enough: you need a proof.