Back to forall x: Calgary

Normal forms

Finding sentences in disjunctive or conjunctive normal form equivalent to given TFL sentences, working from their truth tables.

forall x: Calgary, Normal forms

Status

FlagsLoading your progress…

1 exercise

Exercise A

Consider the following sentences:

$(A\rightarrow\neg B)$
$\neg(A\leftrightarrow B)$
$(\neg A\vee\neg(A\wedge B))$
$(\neg(A\rightarrow B)\wedge(A\rightarrow C))$
$(\neg(A\vee B)\leftrightarrow((\neg C\wedge\neg A)\rightarrow\neg B))$
$((\neg(A\wedge\neg B)\rightarrow C)\wedge\neg(A\wedge D))$

For each sentence, find an equivalent sentence in DNF and one in CNF.

Adapted from forall x: Calgary © 2025 P. D. Magnus, Tim Button, Robert Trueman, and Richard Zach. Licensed under CC BY 4.0. Source: forall x: Calgary. Imported at revision ec34df8.