Boolian connective system

Claim 1

A LOGIC NETWORK FOR PROVIDING LOGICAL OPERATIONS BETWEEN A BINARY CELL REPRESENTATIVE OF AN OPERAND A AND A BINARY CELL REPRESENTATIVE OF AN OPERAND B AND FOR STORING THE RESULT BACK IN THE CELL A COMPRISING SAID CELL A HAVING A RESET, A SET AND A TRIGGER INPUT, SAID CELL B HAVING A 1-SIDE AND A 0-SIDE OUTPUT, SET GATE MEANS HAVING AN OUTPUT CONNECTED TO SAID SET INPUT AND INCLUDING A FIRST AND A SECOND SET GATE, RESET GATE MEANS HAVING AN OUTPUT CONNECTED TO SAID RESET INPUT AND INCLUDING A FIRST AND A SECOND RESET GATE, TRIGGER GATE MEANS HAVING AN OUTPUT CONNECTED TO SAID TRIGGER INPUT AND INCLUDING A FIRST AND A SECOND TRIGGER GATE, MEANS CONNECTING SAID 1-SIDE OUTPUT OF CELL B TO AN IN PUT OF EACH OF SAID FIRST GATES, MEANS CONNECTING SAID 0-SIDE OF CELL B TO AN INPUT OF EACH OF SAID SECOND GATES, AND INSTRUCTION MEANS CONNECTED TO EACH OF SAID FIRST AND SECOND GATES FOR PROVIDING INSTRUCTION ENABLING SIGNALS TO SELECT A LOGICAL OPERATION TO BE PERFORMED BY SAID LOGIC NETWORK WHICH IS A TRUE "ANDING" OF THE FOUR POSSIBLE COMBINATIONS OF THE A AND B LITERALS WITHOUT USING A PHYSICALLY TO APPLY: (1) AN ENABLING SIGNAL TO SAID SECOND RESET GATE WHEN THE B TERM OF THE FUNCTION IS TRUE, (3) AN ENABLING SIGNAL TO SAID FIRST RESET GATE WHEN THE B TERM IS COMPLEMENTARY, AND (3) WHEN THE A TERM IS COMPLEMENTARY ON ENABLING SIGNAL TO (A) SAID FIRST TRIGGER GATE WHEN THE B TERM IS TRUE AND (B) SAID SECOND TRIGGER GATE WHEN THE B TERM IS COMPLEMENTARY.