Show Tautology without Truth Table || Lesson 11 || Discrete Math & Graph Theory ||
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]
En esta página del sitio puede ver el video en línea Show Tautology without Truth Table || Lesson 11 || Discrete Math & Graph Theory || de Duración hora minuto segunda en buena calidad , que subió el usuario Wisdomers - Computer Science and Engineering 30 agosto 2023, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 12,122 veces y le gustó 160 a los espectadores. Disfruta viendo!
![File Explorer Is Slow to Open in Windows 11/10 [FIXED]](https://image.4k-video.cc/id-video/jUDyiY4zR-M)
