Created
June 29, 2020 15:07
-
-
Save sguzman/927428f552021dabfedda65a619ac050 to your computer and use it in GitHub Desktop.
Proof of De Morgan rules in boolean algebra using Mathematica
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| FindEquationalProof[ | |
| \!\( | |
| \*SubscriptBox[\(\[ForAll]\), \({\[FormalA], \[FormalB]}\)]\( | |
| \*OverscriptBox[\(\[FormalA]\[CircleTimes]\[FormalB]\), \(_\)] == | |
| \*OverscriptBox[\(\[FormalA]\), \(_\)]\[CirclePlus] | |
| \*OverscriptBox[\(\[FormalB]\), \(_\)]\)\), | |
| AxiomaticTheory["BooleanAxioms"] | |
| ] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment