3,698 views

3 Answers

Best answer
2 votes
2 votes

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

selected by
0 votes
0 votes

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.

Answer:

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

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

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

–1 votes
–1 votes
The dual of a compound proposition is formed by replacing each occurrence of the logical operator "and" with "or", each occurrence of "or" with "and", and negating all propositions.

The compound proposition is : p ∧ ¬q ∧ ¬r

The dual of this compound proposition is ; p ∨ q ∨ r

(p ∧ q ∧ r) ∨ s

The dual of this compound proposition is: (p ∨ ¬q ∨ ¬r) ∧ ¬s

(p ∨ F) ∧ (q ∨ T)

The dual of this compound proposition is: (¬p ∧ ¬F) ∨ (¬q ∧ ¬T)

Note that ; The logical operator "and" is replaced with "or" and the negation of q and r is removed, since dual of a negation is the removal of the negation.

Related questions

3 votes
3 votes
2 answers
2
Pooja Khatri asked Mar 16, 2019
1,136 views
Why are the duals of two equivalent compound propositions also equivalent, where these compound propositions contain only the operators $\wedge, \vee, \sim ?$
0 votes
0 votes
2 answers
3
1 votes
1 votes
2 answers
4