Cf: Animated Logical Graphs ??? 35 http://inquiryintoinquiry.com/2020/08/19/animated-logical-graphs-35/
Re: Richard J. Lipton https://rjlipton.wordpress.com/about-me/ ::: Logical Complexity Of Proofs https://rjlipton.wordpress.com/2020/08/19/logical-complexity-of-proofs/ The smoothest way I know to do propositional calculus is by using minimal negation operators as primitives, parsing propositional formulas into (painted and rooted) cactus graphs, and using the appropriate extension of the axiom set from Charles S. Peirce's logical graphs and G. Spencer Brown's laws of form. There's a quick link here: * Cactus Language for Propositional Logic https://oeis.org/wiki/Differential_Logic_%E2%80%A2_Part_1#Cactus_Language_for_Propositional_Logic Resources ========= * Logic Syllabus https://oeis.org/wiki/Logic_Syllabus * Logical Graphs https://oeis.org/wiki/Logical_Graphs * Futures Of Logical Graphs https://oeis.org/wiki/Futures_Of_Logical_Graphs * Minimal Negation Operators https://oeis.org/wiki/Minimal_negation_operator * Survey of Theme One Program https://inquiryintoinquiry.com/2018/02/25/survey-of-theme-one-program-%e2%80%a2-2/ * Survey of Animated Logical Graphs https://inquiryintoinquiry.com/2019/05/22/survey-of-animated-logical-graphs-%e2%80%a2-2/ * Propositional Equation Reasoning Systems https://oeis.org/wiki/Propositional_Equation_Reasoning_Systems 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.
