Cf: Differential Logic • Discussion 3
At:
http://inquiryintoinquiry.com/2020/06/17/differential-logic-%e2%80%a2-discussion-3/
Re: R.J. Lipton
https://rjlipton.wordpress.com/about-me/
Re: P<NP
https://rjlipton.wordpress.com/2020/06/16/pnp/
Instead of boolean circuit complexity I would look at logical graph complexity, where those logical graphs are
constructed from minimal negation operators.
Physics once had a frame problem (complexity of dynamic updating) long before AI did but physics learned to reduce
complexity through the use of differential equations and group symmetries (combined in Lie groups).
One of the promising features of minimal negation operators is their relationship to differential operators. So I've
been looking into that. Here’s a link, a bit in medias res, but what I've got for now.
• Differential Logic • Cactus Language
https://oeis.org/wiki/Differential_Logic_%E2%80%A2_Part_1#Cactus_Language_for_Propositional_Logic
Resources
=========
• Logical Graphs
https://oeis.org/wiki/Logical_Graphs
• Minimal Negation Operators
https://oeis.org/wiki/Minimal_negation_operator
• Survey of Animated Logical Graphs
https://inquiryintoinquiry.com/2019/05/22/survey-of-animated-logical-graphs-%e2%80%a2-2/
• Survey of Differential Logic
https://inquiryintoinquiry.com/2020/02/08/survey-of-differential-logic-%e2%80%a2-2/
• Survey of Theme One Program
https://inquiryintoinquiry.com/2018/02/25/survey-of-theme-one-program-%e2%80%a2-2/
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 peirce-L@list.iupui.edu .
► To UNSUBSCRIBE, send a message NOT to PEIRCE-L but to l...@list.iupui.edu
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.
