WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Representation of Boolean Functions Using Binary Trees

​
number of propositional variables
2
3
4
Boolean function number
2
​
permutation of variables
{a,b,c}
Boolean form
CNF
show truth values
0
0
0
0
0
0
1
0
Boolean function:
¬a∧¬b∧c
This Demonstration shows representations of Boolean functions of two, three or four arguments using binary trees.
Abbreviations: CNF = canonical normal form, DNF = disjunctive normal form, BDT = binary decision tree, ANF = algebraic normal form, BFF = Boolean function form.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.