Re: Zeroth Order Ontology

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

ZOO.  Note 5

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

Let's play around a while with the "glass bead game" variations
on the theme of logical graphs.  To do this in a stringey medium,
sans marbles, we use the old comp sci trick of representing trees
by means of their "growth rings", in the form of pure parentheses.
After a while we get used to writing things out in the overheated
medium of parentheses but imagine the cooler shades of the trees.

A few minimal examples will be enough to get you started.

The blank expression " " parses to a rooted node:

          @

The spike expression "()" parses to a rooted edge:

          o
          |
          @

The expression "(())" parses to an end-rooted 2-path:

          o
          |
          o
          |
          @

The expression "()()" parses to a mid-rooted 2-path:

        o   o
         \ /
          @

Et sic deinceps ...

Jon Awbrey

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