Abstract
Although it is known that every boolean function can be represented as a subgraph of a hypercube [Harary, 1989], the implications of this fact have been little explored. We show a method for constructing such graphs which allows any formula of propositional logic to be visually represented. Boolean operations can be defined as manipulations of such graphs. A simple method is shown whereby the validity of propositional sequents may be checked.