- I feel as though you have posted these same diagrams many times, and it is always portrayed as clearing the ground for something else. But the something else never arrives! I would be really interested to know what the next step is in your ideas.
Thanks for the question. Bruce Schuman mentioned radio button logic and I jumped on it “like a duck on a June bug” — as they say in several southern States I know — because that very thing marks an important first step in the application of minimal negation operators to represent finite domains of values, contextual individuals, genus and species, partitions, and so on. But some of the comments I got next gave me pause and made me feel I should go back and clarify a few points.
I wasn’t sure, but I got the sense Bruce was reading the cactus graphs I posted as an order of hierarchical, ontological, or taxonomic diagrams. What they really amount to are the abstract, human-viewable renditions of linked data structures or “pointer” data structures in computer memory. I explained the transformation from planar forms of enclosure to their topological dual trees to the pointer structures in one of the articles on logical graphs I wrote for Wikipedia and later for Google’s now-defunct Knol. People can find a version of that on the following page of my blog.