(a)
(p → q) is equivalent to (~p v q)
p → q
P | Q | (P → Q) |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
~p v q
P | Q | (¬P ∨ Q) |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
(b)
Given statement :
If you are led by the Spirit, then you are not under the law.
Let p = you are led by the Spirit
q = you are not under the law
The negation of the conditional stement is,
So, the negation statement can be written as,
you are led by the Spirit and you are not under the law
***please comment if you have any doubts.Happy to help you.Thank you. Please Like.
(a) Circle the logical statement that is equivalent to p→9. 9P ~pvq ~p~9 рл~ 4 (b)...
a. Define what it means for two logical statements to be equivalent b. If P and Q are two statements, show that the statement ( P) л (PvQ) is equivalent to the statement Q^ P c. Write the converse and the contrapositive of the statement "If you earn an A in Math 52, then you understand modular arithmetic and you understand equivalence relations." Which of these d. Write the negation of the following statement in a way that changes the...
Verify the logical equivalences using the theorem below: (p ∧ ( ~ ( ~ p ∨ q ) ) ) ∨ (p ∧ q) ≡ p Theorem 2.1.1 Let p, q, and r be statement variables, t a tautology, and c a contradiction. The following logical equivalences are true. 1. Commutativity: p1q=q1p; p V q = 9VP 2. Associativity: ( pq) Ar=p1qAr); (pVq) Vr=pv (Vr) 3. Distributivity: PA(Vr) = (p19) (par); p V (qar) = (pVg) (Vr) 4. Identity: pAt=p:...
In this assignment you will write code that will prove both equations for three logical equivalences (pick any three except the double negative law). Below is the list of logical equivalences. Please create a program that allows a user to test logical equivalences and have proof of their equivalency for the user. The rubric is below. Submit screen shots of the code, input, and output of the program. Theorem 2.1.1 Logical Equivalences Given any statement variables p, q, and r,...
16 pts) #4. TRUE/FALSE. Determine the truth value of each sentence (no explanation required). ________(a) A statement is a sentence that is true. ________(b) In logic, p q refers to the "inclusive or, " true when either p or q or both are true. ________(c) The phrase "not p and not q" means "not both p and q." ________(d) The conditional statement p q is true if p is false. ________(e) The negation of p q is p ~q. #5....
Problem 12.1: Let p and be logical statements. By using a truth table determine if the following compound statements are logically equivalent. Show work! Circle one: A: The statements are equivalent. B: The statements are not equivalent. Problem 12.2: Let P, Q, and be be logical statements. By using a truth table determine if the following compound statements are logically equivalent. Show work! Circle one: A: The statements are equivalent. B: The statements are not equivalent.
2) [3 marks] Using logical equivalent properties discussed in class, prove: 3) [2 marks] Use a truth table to verify the associative law: (p v q) vrp (qr) 4) [2 marks] Use De Morgan's laws to find the negation of each of the following statements. a) Kwame will take a job in industry or go to graduate school. b) Yoshiko knows Java and calculus c) James is young and strong. d) Rita will move to Oregon or Washington. 5) [2]...
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 that's 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,...
14. For each statement, write an equivalent statement in logarithmic form. a) 63 = 216 b) 3-4 = 1 c) a =C 15. For each statement, write an equivalent statement in exponential form. a) log: 32 = -5 b) log2 V8 = c) log, sut 16. Find the value of each expression without using a calculator. a) log3 729 b) log 100,000 d) log 16 e) log32 2 g) logs 16 h) log1632 j) In e k) In e c)...
5 points Show that p + (q + r) and q + (pvr) are logically equivalent without using a truth table. To get full credit, include which logical equivalences you used.