is a binary logic tree composed of
    just {then, else} tests, and that contradictions can be encountered at any leaf,
    yet the resolution algorithms to the contradictions are known at the branches
    somewhere above the leafs.  In such a case if the leaf sets the third state of
    logic (call it surprise, or Oh), and if the branches are composed of the tests
    {then, else, OhThen, OhElse}, then there is an interpreter that can find and run
    the appropriate algorithm to resolve the contradictions