Prove Modus Tollens Law
Вставка
- Опубліковано 3 жов 2024
- Prove Modus Tollens Law
★Please Subscribe !
/ @randerson112358
★Easy Algorithm Analysis Tutorial:
www.udemy.com/...
★Recurrence Relation Made Easy: www.udemy.com/...
►Tree Traversal Videos:
(1) Preorder: • Preorder Traversal
(2) Postorder: • Postorder Traversal
(3) Inorder: • Inorder Traversal
(4) Tree Traversal Example: • Tree Traversal Example
►Videos on Discrete Math Induction:
(1) Induction Summation: • Proof By Induction Sum...
(2) Mathematical Induction Divisibility: • Proof By Induction Div...
(3) Induction Recurrence Relation 1: • Recurrence Relation Pr...
(4) Induction Recurrence Relation 2: • Recurrence Relation Ru...
►Videos on Logical Equivalence:
(0) Logical Equivalence: • Prove Logical Equivale...
(1) Tautology: • Truth Table Tautology ...
(2) Tautology: www.youtube.co....
(3) Contradiction: www.youtube.co....
(4) Laws: • Laws Of Logical Equiva...
►Videos on Big-O Asymptotics:
(1)Solve Big O: • Solve Big-O By Definition
(2)Solve Theta: • Prove Big Theta
(3)Solve Big Omega: • Prove Big Omega
(4)Big O Notation Explained: • Big O Notation Explained
►Summation Videos:
Closed Form Solution Summation: • Closed Form Solution S...
Algorithm Analysis Summation: • Algorithm Analysis and...
Summation / Sigma Notation: • Summation / Sigma Nota...
Summation Closed Form Solution: • Summation Closed Form ...
Evaluate The Summation: • Evaluate The Summation
Time Complexity of Code using summations: • Time Complexity of Cod...
►Recurrence Relation Videos:
Recurrence Relation Proof by Induction: • Recurrence Relation Pr...
Recurrence Relation Run Time by Induction: • Recurrence Relation Ru...
Recurrence Tree: • Recursion Tree Method ...
►Big O, Big Omega, Big Theta Limit Videos:
(1) Solve Big Omega by Limits:
• Solve Big Omega By Limits
(2)Solve Big O by Limits:
• Solve Big-Oh By Limits
(3) Prove Little-o By Limits:
• Little o Proof Using L...
(4) Solve Big Theta By Limits:
• Solve Big Theta By Limits
♥ Visit My Website:
everythingcomp...
♥Support this channel on Patreon:
/ randerson112358
♥Helpful Books:
►Algorithm Analysis Books:
www.amazon.com...
►Discrete Mathematics Workbooks:
(1) Practice Problems In Discrete Mathematics - www.amazon.com...
(2)Discrete Mathematics Workbook - www.amazon.com...
#ModusTollens #RuleOfInference
In ~q /\ p-->q only last row are true, but last but one row is F and T which gives F but ~p have T. Then how is ~q /\ p-->q is equal to ~p?
Great explanation!
Thanks!
What other logic rules are there? I only remember modus tollens.
I thought modus tollens and modus ponens are tautology. Why there is false on your truth table?
Your formula using logical equivalence is demonstrably false. Where not q is false the left hand side is false while not p can remain true.
I don't understand what you are trying to explain, the video is correct.
@@randerson112358 the formula (-q&(p -> q) = -p is not a logical equivalence, it is demonstrably false when q is true and p is false. work out a truth table on it.
@Martin Rice I understand your confusion now.
You are correct that the equation (-q&(p -> q) = -p isn't always true, as can be seen when creating the truth table.
However this condition is always true if -q is true and (p->q) is true, which I put right underneath the logical equivalence.
This can also be seen in the truth table.
Thanks for watching, I hope that clears everything up ! :)