Proposition Validity Finder

While taking a Logic class, we started going over symbolic logic propositions. These are the math-like "equations" where you need to figure out if something is valid or not. For example:

`(A • B) | A`
Translates to: (A and B) or A

This would be a real problem that I would have assigned for homework, and I would have to figure out if it was valid or not using a "brute force" truth table technique. I would have to write out every possible combination of true or false to see if one contradicted another. A more descriptive version this can be found on Github.

I got frusterated at the homework I was being assigned because I knew that a machine could solve it almost instantly. So, I made this. Of course, I never used it to find the answers to the homework -- only to check to see if I was right (and the program worked).