This class allows you to parse first order logic formulas. These formulas can be written in any syntax that you define.
You can apply basic logic operations (and, or, not, implies, etc...).
You can transform proposition (cleaning, developing, disjunctive form, conjunctive form).
You can even make demonstrations of your proposition, by looking up the values table or simply by demonstrating it (simple analysis of the disjunctive form: not too greedy).
The FOLP Checker allows you to prove that a proposition is a theorem, and if it is not, you will be presented a counterexample.
Karnaugh's table and other nice features will be soon added. |
