 something equivalent.

What's the point, you ask?  Well, I think of the vertex X as being
the point where the otherwise pure logic gets applied, and this is
a species of referential meaning that can vary from application to
application, a "run time parameter", so to speak.  But the logical
functions themselves, enjoying types like f' : B^k -&gt; B,  I cannot
see any way to classify these with any more pretense of refinement
than to sort them into "logical equivalence classes" (LEC's) based
on, what else, l