Cf: Animated Logical Graphs • 41 http://inquiryintoinquiry.com/2020/09/29/animated-logical-graphs-41/
All, Last time we looked at a formula of propositional logic Leibniz called a Praeclarum Theorema (PT). We don't concur it's a theorem, of course, until there's a proof it's identically true and Leibniz gave an argument to demonstrate that. Written out in one of our more current formalisms, PT takes the following form. ((a ⇒ b) ∧ (d ⇒ c)) ⇒ ((a ∧ d) ⇒ (b ∧ c)) Somewhat in the spirit of Reduced Instruction Set Computing, we reformulated PT in a propositional calculus using just two primitive operations, writing the logical negation of a proposition p as (p) and the logical conjunction of two propositions p, q as pq. That gave us a text string in teletype parentheses and proposition letters, formatted two ways below. Figure 1. Praeclarum Theorema Text Strings https://inquiryintoinquiry.files.wordpress.com/2020/09/praeclarum-theorema-text-strings.png Our next transformation of the theorem’s expression exploits a standard correspondence in combinatorics and computer science between parenthesized symbol strings and trees with symbols attached to the nodes. Figure 2. Praeclarum Theorema Parse Graph https://inquiryintoinquiry.files.wordpress.com/2020/09/praeclarum-theorema-parse-graph-2.0.png We can see the correspondence between text and tree in the case of PT by starting at the root of the tree and reading off the characters of the text string as we traverse the edges and nodes of the tree in the following manner. The initial "(" tells us to ascend the first edge, the next "(" tells us to ascend the next edge on the left, where we find the letter "a" from the string checks with the letter "a" attached to the node of the tree where we are. Another "(" takes us up another edge, where we find the letter "b" from the string checks with the letter "b" on the current tree node. Reading the first ")" on the string entitles us to descend an edge and reading another ")" gives us licence to descend another. The way of things is most likely clear by this point — at any rate, I leave the exercise to the reader. On the scene of the general correspondence between formulas and graphs the action may be summed up as follows. The tree, called a "parse tree" or "parse graph", is constructed in the process of checking whether the text string is syntactically well-formed, in other words, whether it satisfies the prescriptions of the associated formal grammar and is therefore a member in good standing of the prescribed formal language. If the text string checks out, grammatically speaking, we call it a "traversal string" of the corresponding parse graph, because it can be reconstructed from the graph by a process like that illustrated above called "traversing" the graph. To be continued … Regards, Jon
_ _ _ _ _ _ _ _ _ _ ► PEIRCE-L subscribers: Click on "Reply List" or "Reply All" to REPLY ON PEIRCE-L to this message. PEIRCE-L posts should go to [email protected] . ► To UNSUBSCRIBE, send a message NOT to PEIRCE-L but to [email protected] with no subject, and with the sole line "UNSubscribe PEIRCE-L" in the BODY of the message. More at http://www.cspeirce.com/peirce-l/peirce-l.htm . ► PEIRCE-L is owned by THE PEIRCE GROUP; moderated by Gary Richmond; and co-managed by him and Ben Udell.
