Class: First Order Logic Prop

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.

shows the test script in action

generated by AutoPhpDoc

The basic demo: showing the values table, normal forms, and can prove the given formula

Defines litteral syntax for the demo file (it then accepts two syntax, for example "a & b" is the same than "a AND b"). This is an example on how you can add your own supported syntax

basic operations on propositions

testing EQUALITY (and not equivalence) of formulas

testing if propositions are in disjunctive/conjunctive forms

Show cloning feature, and how to set values to variables in a proposition

Shows how you can extend the base class to have nice HTML output of the values table

Shows conjunctive/disjunctive forms of a proposition. You can see here that the computation time is a bit long :(

The file containing base class and the checker class