Differential Propositional Calculus • 7

Posted on November 21, 2023 by Jon Awbrey

Formal Development

The preceding discussion outlined the ideas leading to the differential extension of propositional logic.  The next task is to lay out the concepts and terminology needed to describe various orders of differential propositional calculi.

Elementary Notions

Logical description of a universe of discourse begins with a collection of logical signs.  For simplicity in a first approach we assume the signs are collected in the form of a finite alphabet, \mathfrak{A} = \{``a_1", \ldots, ``a_n"\}.  The signs are interpreted as denoting logical features, for example, properties of objects in the universe of discourse or simple propositions about those objects.  Corresponding to the alphabet \mathfrak{A} there is then a set of logical features, \mathcal{A} = \{ a_1, \ldots, a_n \}.

A set of logical features \mathcal{A} = \{ a_1, \ldots, a_n \} affords a basis for generating an n-dimensional universe of discourse, written A^\bullet = [ \mathcal{A} ] = [ a_1, \ldots, a_n ].  It is useful to consider a universe of discourse as a categorical object incorporating both the set of points A = \langle a_1, \ldots, a_n \rangle and the set of propositions A^\uparrow = \{ f : A \to \mathbb{B} \} implicit with the ordinary picture of a venn diagram on n features.  Accordingly, the universe of discourse A^\bullet may be regarded as an ordered pair (A, A^\uparrow) having the type (\mathbb{B}^n, (\mathbb{B}^n \to \mathbb{B})) and this last type designation may be abbreviated as \mathbb{B}^n\ +\!\!\to \mathbb{B}, or even more succinctly as [ \mathbb{B}^n ].  For convenience, the data type of a finite set on n elements may be indicated by either one of the equivalent notations, [n] or \mathbf{n}.

Table 7 summarizes the notations needed to describe ordinary propositional calculi in a systematic fashion.

\text{Table 7. Propositional Calculus} \stackrel{_\bullet}{} \text{Basic Notation}
Propositional Calculus • Basic Notation

Resources

cc: FB | Differential Logic • Laws of Form • Mathstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science

This entry was posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Differential Propositional Calculus • 7

  1. Pingback: Survey of Differential Logic • 6 | Inquiry Into Inquiry

  2. Pingback: Survey of Differential Logic • 7 | Inquiry Into Inquiry

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.