[CG] Re: Logical Graphs • First Impressions

Logical Graphs • First Impressions 5 • https://inquiryintoinquiry.com/2023/08/24/logical-graphs-first-impressions/ Duality : Logical and Topological (cont.) — It is easy to see the relationship between the parenthetical representations of Peirce's logical graphs, clippedly picturing the ordered containments of their formal contents, and the corresponding dual graphs, constituting a species of rooted trees to be described in greater detail below. In the case of our last example, a moment's contemplation of the following picture will lead us to see how we can get the corresponding parenthesis string by starting at the root of the tree, climbing up the left side of the tree until we reach the top, then climbing back down the right side of the tree until we return to the root, all the while reading off the symbols, in this case either “(” or “)”, we happen to encounter in our travels. Initial Equation I₂ • Dual Tree With Parentheses • https://inquiryintoinquiry.files.wordpress.com/2023/09/logical-graph-i2-tre… This ritual is called “traversing” the tree, and the string read off is often called the “traversal string” of the tree. The reverse ritual, which passes from the string to the tree, is called “parsing” the string, and the tree constructed is often called the “parse graph” of the string. The users of this jargon tend to use it loosely, often using “parse string” to mean the string that gets parsed into the associated graph. Regards, Jon cc: https://www.academia.edu/community/Voog1V cc: https://mathstodon.xyz/@Inquiry/110945139629369891