Re: Zeroth Order Ontology

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

ZOO.  Discussion Note 12

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

Murray, et al.

A principal theme of this disquisition, to express it
epigrammically, is:  "Graphical Form Is Logical Form".

That is to say, a bit more hedgedly, one of the most
efficient and felicitous ways to convey logical form
is by way of graph-theoretic structure.  And the way
to execute these parallel forms and to perform their
corresponding transformations most gracefully in the
computational medium is by way of pointer structures
or linkage graphs.  And that is the main reason that
I am diverting you with this excursus into the realm
of graphs, and trees, and cacti.

In accord with this purpose, one of the things that
we most want to avoid is falling into the deathtrap
of 2-dim representation, and that is another one of
the reasons, aside from my intrinsic lassitude, for
not e-lavishing too much e-fort on Flatland imagery.

It's the living dynamic data structures, and their
graph-theoretic transformations in memory, that we
need to spend our time thinking on, and doing here.

The main reason for e-laborating a few crude sketches
at the outset is just to build up a minimal basis for
recursive procedures, and to develop one's intuitions
about what is required.  Beyond that point, it's just
too much workload not to automate the transformations.

Jon Awbrey

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o