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-


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...
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)
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
Propositional Logic Is the following formula in Conjunctive Normal Form? Why? Why not? (¬A) n (A...
Propositional Logic Is the following formula in Conjunctive Normal Form? Why? Why not? (¬A) n (A u B) n ¬(A u B) where A and B are propositional variables.
How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science?...
How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science? Examples of how it implies to computer science would be great.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT