Show Tautology without Truth Table
In this class, We discuss Show Tautology without Truth Table.
The reader should have prior knowledge of the list of equivalence formulas. Click here.
Example 1:
Show that (p ∧ q) -gt (p ∨ q) is a tautology.
We need to reduce the given proposition to true.
We use the equivalence formulas from our previous class.
Idea: ( p ∨ ¬p) = T
We need to reduce the proposition by ( p ∨ ¬p).
The below diagram shows the output.
Example 2:
Show that the given proposition is a tautology.
((p ∨ q) ∧ ¬(¬p ∧ (¬q ∨ ¬r))) ∨ (¬p ∧ ¬q) ∨ (¬p ∧ ¬r))
The below diagram shows the output.
Link for playlists:
/ @wisdomerscse
Link for our website: https://learningmonkey.in
Follow us on Facebook @ / learningmonkey
Follow us on Instagram @ / learningmonkey1
Follow us on Twitter @ / _learningmonkey
Mail us @ [email protected]
On this page of the site you can watch the video online Show Tautology without Truth Table || Lesson 11 || Discrete Math & Graph Theory || with a duration of hours minute second in good quality, which was uploaded by the user Wisdomers - Computer Science and Engineering 30 August 2023, share the link with friends and acquaintances, this video has already been watched 12,122 times on youtube and it was liked by 160 viewers. Enjoy your viewing!