Pantagruel v0.3.0 BoolAlg View Source
Boolean Algebra modelling. Implementing simple boolean logic as a tree of operations, implement term replacement and reduction over the tree.
Link to this section Summary
Functions
Term rewriting by replacement with true
and reduction
Conjunction
Disjunction
Mutual implication
Implication
Negation
Reduce a term until it can be reduced no further
Term rewriting by replacement with false
and reduction
Exclusive-or
Link to this section Functions
Term rewriting by replacement with true
and reduction.
Conjunction.
Disjunction.
Mutual implication.
Implication.
Negation.
Reduce a term until it can be reduced no further.
Term rewriting by replacement with false
and reduction.
Exclusive-or.