Jon Awbrey

Differential Logic and Dynamic Systems • Overview
• https://inquiryintoinquiry.com/2023/03/04/differential-logic-and-dynamic-systems-overview-2/
• https://oeis.org/wiki/Differential_Logic_and_Dynamic_Systems_%E2%80%A2_Overview

❝Stand and unfold yourself.❞
— Hamlet • Francisco • 1.1.2

In modeling intelligent systems, whether we are trying to understand a natural system or engineer an artificial system, there has long been a tension or trade-off between dynamic paradigms and symbolic paradigms. Dynamic models take their cue from physics, using quantitative measures and differential equations to model the evolution of a system’s state through time. Symbolic models use logical methods to describe systems and their agents in qualitative terms, deriving logical consequences of a system’s description or an agent’s state of information. Logic-based systems have tended to be static in character, largely because we have lacked a proper logical analogue of differential calculus. The work laid out in this report is intended to address that lack.

This article develops a differential extension of propositional calculus and applies it to the analysis of dynamic systems whose states are described in qualitative logical terms. The work pursued here is coordinated with a parallel application focusing on neural network systems but the dependencies are arranged to make the present article the main and the more self-contained work, to serve as a conceptual frame and a technical background for the network project.

#Peirce #Logic #LogicalGraphs #DifferentialLogic #DynamicSystems
#BooleanFunctions #BooleanDifferenceCalculus #QualitativeChange
#MinimalNegationOperators #NeuralNetworkSystems #Semiotics

Differential Logic and Dynamic Systems • Overview

Inquiry Into Inquiry
Feb 22, 2023 at 7:36pmWeb
Show threadJon AwbreyMar 5, 2023

Differential Logic and Dynamic Systems • Review and Transition 1
• https://oeis.org/wiki/Differential_Logic_and_Dynamic_Systems_%E2%80%A2_Part_1#Review_and_Transition

This note continues a previous discussion on the problem of dealing with change and diversity in logic-based intelligent systems. It is useful to begin by summarizing essential material from previous reports.

Table 1 outlines a notation for propositional calculus based on two types of logical connectives, both of variable \(k\)-ary scope.

• A bracketed list of propositional expressions in the form \(\texttt{(} e_1 \texttt{,} e_2 \texttt{,} \ldots \texttt{,} e_{k-1} \texttt{,} e_k \texttt{)}\) indicates that exactly one of the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) is false.

• A concatenation of propositional expressions in the form \(e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k\) indicates that all of the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) are true, in other words, that their logical conjunction is true.

All other propositional connectives can be obtained in a very efficient style of representation through combinations of these two forms. Strictly speaking, the concatenation form is dispensable in light of the bracketed form but it is convenient to maintain it as an abbreviation of more complicated bracket expressions.

#Peirce #Logic #LogicalGraphs #DifferentialLogic #DynamicSystems
#BooleanFunctions #BooleanDifferenceCalculus #QualitativeChange
#MinimalNegationOperators #NeuralNetworkSystems #Semiotics

Show threadSylvainMar 2, 2023
@Inquiry this looks extremely interesting! I will do my best to read it and give you feedback as soon as I can.
Show threadJon AwbreyMar 2, 2023

@Sylvain_julien

Thanks! Developed this as a graduate project under a systems engineering program back in '93-'94 and copied it to the web in various formats since. Some of the graphics got mushed in a Mac to PC platform change years ago and I've just about worked up the energy to try and redo them. Looking to serialize the whole thing on my blog and maybe try micro-blogging what I can here.