Hypernetwork Based on Classical Logic

In Boolean logic, for any arbitrary T.B.T(total binary truth table) can generate a Boolean expression as a conjunctive normal form. This paper considers the notation of T.B.T, introduces a novel concept of hypergraphable Boolean functions and Boolean functionable hypergraphs with respect to T.B.T. This study defines a notation of kernel set on switching functions. Also is shown that every T.B.T corresponds to a hypergraph.

Keywords:

Switching function , hypergraphable Boolean function , Boolean functionable hypergraph , Boolean function–based hypergraph , switching kernel , T.B.T.