Mapping truth tables onto Boolean cubes

A B F

0 0 1

0 1 0

1 0 1

1 1 0

ON-set = solid nodesOFF-set = empty nodesDC-set = ?'d nodes

• Uniting theorem combines two "faces" of a cube into a larger "face"

• Example:

F

Previous slide

Next slide

Back to first slide

View graphic version