Math: First Order Logic Prop
naholyr (contact me)
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.
| Utility
| Consistency
| Docs
| Examples
| Tests
| Videos
| Overall
| Rank
|
| Good (83.3%)
| Sufficient (66.7%)
| -
| Sufficient (66.7%)
| -
| -
| Not sure (55.0%)
| 971 |
Click here for detailed information about this class on phpclasses.org
Example
The basic demo: showing the values table, normal forms, and can prove the given formula
Example
basic operations on propositions
Example
testing EQUALITY (and not equivalence) of formulas
Example
testing if propositions are in disjunctive/conjunctive forms
Example
Show cloning feature, and how to set values to variables in a proposition
Example
Shows how you can extend the base class to have nice HTML output of the values table
Example
Shows conjunctive/disjunctive forms of a proposition. You can see here that the computation time is a bit long :(