Answer to Question #308446 in Discrete Mathematics for Blue

Question #308446

Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives.

a) No one is perfect.

b) Not everyone is perfect.

c) All your friends are perfect.

d) At least one of your friends is perfect.

e) Everyone is your friend and is perfect.

f) Not everybody is your friend or someone is not perfect. Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives.

a) No one is perfect.

b) Not everyone is perfect.

c) All your friends are perfect.

d) At least one of your friends is perfect.

e) Everyone is your friend and is perfect.

f) Not everybody is your friend or someone is not perfect.


1
Expert's answer
2022-03-11T09:30:56-0500

Solution


Let the domain consist of all people


Consider "p(x)" as proposition function, where ""x" ", is perfect.


Consider "q(x)" as proposition function, where ""x" ", is your friend or in your class.



Solution (a) No one is perfect.


"\u2200x(\u00acp(x))"




Solution (b) Not everyone is perfect.


"\u00ac\u2200x(p(x))"




Solution (c) All your friends are perfect.


"\u2200x(q(x)\\rightarrow p(x))"



Solution (d) At least one of your friends is perfect.


"\\exists x(q(x)\\rightarrow p(x))"




Solution (e) Everyone is your friend and is perfect.


"\u2200x(p(x))\u2227\u2200x(q(x)))"



Solution (f) Not everybody is your friend or someone is not perfect.


"\u00ac\u2200x(q(x))\\vee (\\exist x\u00ac(p(x))))"



Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS