Cf: Animated Logical Graphs • 22 https://inquiryintoinquiry.com/2019/07/22/animated-logical-graphs-22/
The step of controlled reflection we took in the previous post ( https://inquiryintoinquiry.com/2019/07/12/animated-logical-graphs-21/ ) can be repeated at will, as suggested by the following series of forms. Figure 1. Reflective Series (a) to (a, b, c, d) https://inquiryintoinquiry.files.wordpress.com/2019/07/reflective-series-a-to-abcd.jpg Written inline, we have the series “(a)”, “(a, b)”, “(a, b, c)”, “(a, b, c, d)”, and so on, whose general form is “(x₁, x₂, …, xₖ)”. With this move we have passed beyond the graph-theoretical form of rooted trees to what graph theorists know as “rooted cacti”. I will discuss this “cactus language” and its logical interpretations next. 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 UNSUBSCRIBE PEIRCE-L in the SUBJECT LINE of the message and nothing in the body. More at https://list.iupui.edu/sympa/help/user-signoff.html . ► PEIRCE-L is owned by THE PEIRCE GROUP; moderated by Gary Richmond; and co-managed by him and Ben Udell.
