WOLFRAM|DEMONSTRATIONS PROJECT

Solving Logic Puzzles with Binary Trees

​
number of propositional variables
2
3
4
difficulty
less
more
permutation of variables
{a,b}
show truth values
new example
Example:
b⧦¬a
0
1
1
0
This Demonstration uses a binary tree representation of Boolean functions with two to four arguments to solve simple propositional logic puzzles.