Changes

This much preparation allows us to present the two most basic axioms of logical graphs, shown in graph and string forms below, along with handy names for referring to the different directions of applying the axioms.

This much preparation allows us to present the two most basic axioms of logical graphs, shown in graph and string forms below, along with handy names for referring to the different directions of applying the axioms.

{| align="center" cellpadding="10"

| [[Image:Logical_Graph_Figure_14_Banner.jpg|500px]]

|-

| [[Image:Logical_Graph_Figure_15_Banner.jpg|500px]]

|}

| ` ` ` ` ` ` ` ` ` @ ` ` ` ` = ` ` ` ` @ ` ` ` ` ` ` ` ` ` |

| ` ` ` ` ` ` ` `( ) ( )` ` ` = ` ` ` `( )` ` ` ` ` ` ` ` ` |

| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |

| Axiom I_1.` ` Distract <--- | ---> Condense ` ` ` ` ` ` ` |

| ` ` ` ` ` ` ` ` (( )) ` ` ` = ` ` ` ` ` ` ` ` ` ` ` ` ` ` |

| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |

o-----------------------------------------------------------o

| Axiom I_2.` ` ` Unfold <--- | ---> Refold ` ` ` ` ` ` ` ` |

The ''parse graphs'' that we've been looking at so far are one step toward the ''pointer graphs'' that it takes to make trees live in computer memory, but they are still a couple of steps too abstract to properly suggest in much concrete detail the species of dynamic data structures that we need.  I now proceed to flesh out the skeleton that I've drawn up to this point.

The ''parse graphs'' that we've been looking at so far are one step toward the ''pointer graphs'' that it takes to make trees live in computer memory, but they are still a couple of steps too abstract to properly suggest in much concrete detail the species of dynamic data structures that we need.  I now proceed to flesh out the skeleton that I've drawn up to this point.