![]() Some basic established logical equivalences are tabulated below. That better way is to construct a mathematical proof which uses already established logical equivalences to construct additional more useful logical equivalences. In this case, there needs to be a better way to prove that the two given propositions are logically equivalent. ![]() But this method is not always feasible since the propositions can be increasingly complex both in the number of propositional variables used and size of the expression. The truth table must be identical for all combinations for the given propositions to be equivalent. One way of proving that two propositions are logically equivalent is to use a truth table. The notation is used to denote that and are logically equivalent. Two propositions and are said to be logically equivalent if is a Tautology.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2022
Categories |