9. Use De Morgan's Laws, and any other logical equivalence facts you know to simplify the following statements. Show all your steps. Your final statements should have negations only appear directly next to the sentence variables or predicates (P, Q. E(r). etc.), and no double negations. It would be a good idea to use only conjunctions, disjunctions, and negations. a. -((-PAQ) V ¬(RV-S). b. -(-P-Q)^ (-Q → R)) (careful with the implications). C. For both parts above, verify your answers are correct using truth tables. That is, use a truth table to check that the given statement and your proposed simplification are actually logically equivalent.

Translate the given statement into symbolic form. Be sure to define all pred- icates used. Use the variable a with domain D = {a : a is an animal } as your main variable. Then, negate the symbolic statement. In your answer, negations should appear only in front of predicates. Finally, rewrite the negated statement clearly in plain English. "Any animal that is wild can be tamed." 2.

Which of the following represents the negation of the statement: "The cat sleeps and the mouse does not hide."

Please help me with the three questions (d,e,f) in the image below. Show all work.  Thank you

Let p, q, and r represent the following simple statements. p: I eat bananas. q: I like ice cream. r I like to eat. Write the following compound statement in its symbolic form. If I do not eat bananas then: I do not like ice cream and I do not like to eat. The symbolic form is

Translate the following sentence in terms of predicates, quantifiers, and logical connectives. Choose your own variables and predicate statement symbols as needed and define each of them clearly. Specify the domain

please change this sentence to fol (first order logic) Hanry is a student in Bina Nusantara University and that makes him to be called binusian. In Binus, there is a prestigious award so called a star.

Determine if the following statements are logically equivalent, negations or neither: ~p➡q ; ~(p∧q)   Are the statements logically equivalent, negations, or neither? ________________

8. Rewrite the following argument as a conditional statement q

Tulips The diagram shows the relationship between two sets. Flowers aUse the diagram to write a statement beginning with the word "all," "some," or "no" that illustrates the relationship between the sets. b.Determine if the statement in part (a) is true or false. If it is false, write its negation. a. Choose the correct statement below that illustrates the relationship between the sets. O A. No tulips are flowers. O B. All flowers are tulips. OC. All tulips are flowers. O D. Some flowers are tulips. O E. Some tulips are flowers. b. Is the statement in part (a) true or false? O A. False; its negation is "Some tulips are not flowers." O B. False; its negation is "Some flowers are not tulips." O C. False; its negation is "Some flowers are tulips." OD. False; its negation is "No tulips are flowers." O Time Remaining: 01:58:05 Next MacBook Air 4) 0 9. > FS) F7 esc F2 F4 #3 & * 2$ 4 2 3 5 6. 7 8 9 delete Q W E R Y A S F J K ck C V M N