A simple algorithm for deduction

Bill Whiten


It is shown that a simple deduction engine can be developed for a propositional logic that follows the normal rules of classical logic in symbolic form, but the description of what is known about a proposition uses a two numeric state variables that conveniently describe unknown and inconsistent, as well as true and false. Partly true and
partly false can be included in deductions. The multi-valued logic is easily understood as the proposition values relate directly to true and false. The deduction engine provides a convenient standard method for handling multiple or complicated logical relations. It is particularly convenient when the deduction can start with different propositions being given initial values of true or false. It extends Horn clause based deduction for propositional logic to arbitrary clauses. The logic system used has potential applications in many areas. A comparison with propositional logic makes the paper self contained.



deduction, classical propositional logic, two-variable logic, simple algorithm

DOI: https://doi.org/10.21914/anziamj.v51i0.2380

Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.