Question

In: Computer Science

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((?...

Use the laws of propositional logic to prove that the following compound propositions are tautologies.

((? → ?) ∧ (? → ?)) → (? → ?)

Solutions

Expert Solution

Ans:-

You should know :-

a ->(implies) b will be false only if a is true and b is false

a^b  will be true only if both a is true and b is true

If all cases are true then its tautology

Take all cases.

1 denotes True, 0 denotes False in below table

Please like the answer if it is helpful to you.

bomo : - Here pimplies True, o implies false p q r (eq) ( gr) (6) (169) MG) ( 9 ) / ) (fr) 0 0 0 1 1 o ao a - - ooo o - --0- --- - oo ---- o - --0-OOO- -- -0-0- 1 1 0 0-

venereology answered 2 years ago
Next > < Previous

Related Solutions

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((?...
Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((? → ?) ∧ (? → ?)) → (? → ?)
Use the laws of propositional logic to prove that the followingcompound propositions are logically equivalent....
Use the laws of propositional logic to prove that the following compound propositions are logically equivalent.A. ? ↔ (? ∧ ?) and ? → ?B. ¬(? ∨ (? ∧ (? → ?))) and ¬? ∧ (? → ?)
Use the laws of propositional logic to prove that the following compound proposition is a tautologies...
Use the laws of propositional logic to prove that the following compound proposition is a tautologies (¬? ∧ (? ∨ ?)) → ?
Two compound propositions p and q in propositional logic are logically equivalent if . . ..
Complete the following statements.Two compound propositions p and q in propositional logic are logically equivalent if . . ..An argument form in propositional logic is valid if . . ..A theorem is a statement that . . ..A statement that is assumed to be true is called a(n) . . ..A proof is a valid argument that . . ..
Prove the validity using laws of propositional logic and rules of inference: ∀x(P(x) → (Q(x) ∧...
Prove the validity using laws of propositional logic and rules of inference: ∀x(P(x) → (Q(x) ∧ S(x))) ∃x(P(x) ∧ R(x)) − − − − − − − − − − − − − ∴ ∃x(R(x) ∧ S(x))
Represent the following in propositional logic. Label the component propositions. Note you may have to reword...
Represent the following in propositional logic. Label the component propositions. Note you may have to reword some propositions. Bread contains carbs and so does rice. Either John or Chris was the first student in class this morning. I have a bad shoulder and whenever it is raining, my shoulder aches. If the weather is nice, then if Dr Marlowe is lecturing, we will sleep in and then go for a hike. Henry will stay in his job only if he...
Is the argument valid? Use rules of inference and laws of logic to prove or disprove...
Is the argument valid? Use rules of inference and laws of logic to prove or disprove (no Truth tables) 1. If John has talent and works very hard, then he will get a job. If he gets a job, then he’ll be happy. Hence if John is not happy, then he either not worked very hard or does not have talent. 2.For spring break Marie will travel to Cancun or Miami. If she goes to Cancun, she will not visit...
Propositional Logic Using operator properties and other logical equivalences (not truth tables), prove these statements. 1....
Propositional Logic Using operator properties and other logical equivalences (not truth tables), prove these statements. 1. ((p→r)∧(q→r)∧(p∨q))→r (tautology) 2. ¬(q→p)∧(p∧q∧s→r)∧p (contradiction) 3. (p→q)∧(p→r)≡p→(q∧r)
What form of logic is trying to be used in the logic of the 3 propositions...
What form of logic is trying to be used in the logic of the 3 propositions below and why does the logic in the last proposition fail? ·A platypus called Tom lays eggs ·All duck lays eggs ·Therefore, a Platypus is a duck
Represent the following argument in the symbolic notation of Propositional Logic: If this argument is sound,...
Represent the following argument in the symbolic notation of Propositional Logic: If this argument is sound, it’s valid, but it’s not sound, so it’s invalid. (Remember how to use slashes in propositional logic)
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT