9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

Question

Question

9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic 10. Give a logical expression with variables p, q, and r thats true only if p and q are false and r is true. 11. Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Qlx): x is a perfect square Are the following logical expressions propositions? If the answer is yes, indicate whether the statement is true or false. a· PR) b. P(2) 12. Consider the following statements in English. Write a logical expression with the same meaning. The domain of discourse must be the set of all real numbers. a. There is a number whose cube is equal to -2 b. The reciprocal of every number between O and 1 is greater than 1. 5

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

[6 *f p and P and v is true a and γ is tru Loricel asuivalant ol above stztemant is Las dro tnth table 0

As per HomeworkLib policy should answer only 1 question, now have answered two of them, ask the remaining as a seperate questions. Thanks

Add a comment

Answer 2

Similar Homework Help Questions

true and false propositions with quantifiers. Answer the following questions in the space provided below. 1....

true and false propositions with quantifiers. Answer the following questions in the space provided below. 1. For each proposition below, first determine its truth value, then negate the proposition and simplify (using De Morgan's laws) to eliminate all – symbols. All variables are from the domain of integers. (a) 3.0, x2 <. (b) Vr, ((x2 = 0) + (0 = 0)). (c) 3. Vy (2 > 0) (y >0 <y)). 2. Consider the predicates defined below. Take the domain to...
Predicates P and Q are defined below. The domain of discourse is the set of all...

Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Q(x): x is a perfect square (i.e., x = y2, for some integer y) Find whether each logical expression is a proposition. If the expression is a proposition, then determine its truth value. 1) ∃x Q(x) 2) ∀x Q(x) ∧ ¬P(x) 3) ∀x Q(x) ∨ P(3)
Predicates P and Q are defined below. The domain of discourse is the set of all...

Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Q(x): x is a perfect square (i.e., x = y2, for some integer y) Indicate whether each logical expression is a proposition. If the expression is a proposition, then give its truth value. (c) ∀x Q(x) ∨ P(3) (d) ∃x (Q(x) ∧ P(x)) (e) ∀x (¬Q(x) ∨ P(x))

How do you show the following propositions are logically equivalent? (a) [(p → q) → r]...

How do you show the following propositions are logically equivalent? (a) [(p → q) → r] ⊕ (p ∧ q ∧ r) and (p ∨ r) ⊕ (p ∧ q) (b) ¬∃x {P(x) → ∃y [Q(x, y) ⊕ R(x, y)] } and (∀x P(x)) ∧ [∀x ∀y(Q(x, y) ↔ R(x, y))] (c) Does [(p → q) ∧ (q → r)] → r implies (p → r) → r?
Answer the following questions in the space provided below. 1. For each proposition below, first determine...

Answer the following questions in the space provided below. 1. For each proposition below, first determine its truth value, then negate the proposition and simplify (using DeMorgan's laws) to eliminate all – symbols. All variables are from the domain of integers. (a) 3x, 22 <2. (b) Vx, ((:22 = 0) + (x = 0)). (e) 3xWy((x > 0) (y > 0 + x Sy)). 2. Consider the predicates defined below. Take the domain to be the positive integers. P(x): x...
UIC 5. (20 pt.) Use the laws of propositional logic to prove that the following compound...

UIC 5. (20 pt.) Use the laws of propositional logic to prove that the following compound propositions are tautologies. a. (5 pt.) (p^ q) → (q V r) b. (5 pt) P)Ag)- Vg)A(A-r)- c. (10 pt.) Additional Topics: Satisfiability (10 pt.) A compound proposition is said to be satisfiable if there is an assignment of truth values to its variables that makes it true. For example. p ^ q is true when p = T and q = T;thus, pAqissatsfiable....

Simplify the following sentences in predicate logic so that all the negation symbols are directly in...

Simplify the following sentences in predicate logic so that all the negation symbols are directly in front of a predicate. (For example, Vx ((-0(x)) + (-E(x))) is simplified, because the negation symbols are direct in front of the predicates O and E. However, Væ -(P(2) V E(x)) is not simplified.) (i) -(3x (P(x) 1 (E(x) + S(x)))) (ii) -(Vx (E(x) V (P(x) +-(Sy G(x, y))))) Write a sentence in predicate logic (using the same predicates as above) which is true...
5. Symbolize the following argument and prove it is a valid argument. Let B ( x...

5. Symbolize the following argument and prove it is a valid argument. Let B ( x ) = x is a bear; D ( x ) = x is dangerous, and H ( x ) = x is hungry. Every bear that is hungry is dangerous. There is a hungry animal that is not dangerous. Therefore there is an animal that is not a bear. 6. In order to prove an quantificational argument invalid it is only necessary to find a...
Provide complete definitions for the following: 7 marks] Choosing a universe and predicates. (a) Consider the...

Provide complete definitions for the following: 7 marks] Choosing a universe and predicates. (a) Consider the following statement: Vz E N, P(x,165) -> P(x, 1) Provide one definition of a binary predicate P over N x N that makes the above statement True, and another definition of P that makes the statement False. Briefly justify your answers, but no formal proofs are necessary. b) Consider the following statement: Provide one definition of a non-empty set U, and predicates P, Q,...

In the following question, the domain of discourse is a set of employees who work at...

In the following question, the domain of discourse is a set of employees who work at a company. Ingrid is one of the employees at the company. Define the following predicates: • S(x): x was sick yesterday • W(x): x went to work yesterday • V(x): x was on vacation yesterday Translate the following English statements into a logical expression with the same meaning. (c) Everyone who was sick yesterday did not go to work. (d) Yesterday someone was sick...

9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

Homework Answers

Add Answer to:
9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

Post as a guest

Earn Coins

true and false propositions with quantifiers. Answer the following questions in the space provided below. 1....

Predicates P and Q are defined below. The domain of discourse is the set of all...

Predicates P and Q are defined below. The domain of discourse is the set of all...

How do you show the following propositions are logically equivalent? (a) [(p → q) → r]...

Answer the following questions in the space provided below. 1. For each proposition below, first determine...

UIC 5. (20 pt.) Use the laws of propositional logic to prove that the following compound...

Simplify the following sentences in predicate logic so that all the negation symbols are directly in...

5. Symbolize the following argument and prove it is a valid argument. Let B ( x...

Provide complete definitions for the following: 7 marks] Choosing a universe and predicates. (a) Consider the...

In the following question, the domain of discourse is a set of employees who work at...

9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

Homework Answers

Add Answer to: 9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

Post as a guest

Earn Coins

Add Answer to:
9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...