+1 vote
36 views

Find the dual of each of these compound propositions.

1. $p \wedge \sim q \wedge \sim r$
2. $(p \wedge q \wedge r) \vee s$
3. $(p \vee F) \wedge (q \vee T)$
| 36 views

+1 vote

Dual is same as de morgans low . Except we can not complement  of literls in dual .

by Boss (34.4k points)
selected
0

Literal$:-$  every occurrence of a variable in its true form $(or)$ complemented form.

Example$: A.\overline{B}+\overline{A}.B$

Number of literals$=4$

Dual = "The dual of a compound proposition that contains only the logical operators ∨, ∧, and ¬ is the compound proposition obtained by replacing each ∨ by ∧, each ∧ by ∨, each T by F, and each F by T. The dual of s is denoted by s∗."

we don't negate any of the literal.

a)  p$\vee$∼q$\vee$∼r

b)  (p$\vee$q$\vee$r)$\wedge$s

c)  (p$\wedge$T)$\vee$(q$\wedge$F)

by Active (1.4k points)

+1 vote
1
2
+1 vote