Example 3 steps, run in order in one session. Every step was executed against the engine and the output below is what it produced.

Step 1

f1 = x && (y || z);

No output - this step sets something up for the next one.

Step 2

t1 = BooleanTable[{x, y, z} -> f1, {x, y, z}]

Output

{{True, True, True} -> x && (y || z), {True, True, False} -> x && (y || z), {True, False, True} -> x && (y || z), {True, False, False} -> x && (y || z), {False, True, True} -> x && (y || z), {False, True, False} -> x && (y || z), {False, False, True} -> x && (y || z), {False, False, False} -> x && (y || z)}

Step 3

f2 = BooleanFunction[t1][x, y, z]

Output

BooleanFunction[{{True, True, True} -> x && (y || z), {True, True, False} -> x && (y || z), {True, False, True} -> x && (y || z), {True, False, False} -> x && (y || z), {False, True, True} -> x && (y || z), {False, True, False} -> x && (y || z), {False, False, True} -> x && (y || z), {False, False, False} -> x && (y || z)}][x, y, z]

Run this on Qurak All recipes

Create truth tables

Functions used

Related recipes