Differential Propositional Calculus • 3

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 may assume these logical signs are collected in the form of a finite alphabet, \mathfrak{A} = \{ {}^{\backprime\backprime} a_1 {}^{\prime\prime}, \ldots, {}^{\backprime\backprime} a_n {}^{\prime\prime} \}.  Each of these signs is interpreted as denoting a logical feature, for example, a property that objects of the universe of discourse may have or a proposition about objects in the universe of discourse.  There is then corresponding to the alphabet \mathfrak{A} 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.

Table 7.  Propositional Calculus : Basic Notation

Propositional Calculus : Basic Notation

cc: CyberneticsOntolog ForumPeirce ListStructural ModelingSystems 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.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

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