Proving equivalences

Establishing equivalences by chains of substitution transformations rather than truth tables, rewriting sentences step by step.

forall x: Calgary, Proving equivalences

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 inCNF by giving a chain of equivalences. Use (Id), (Absorp), and (Simp) to simplify your sentences as much as possible.

3.0