Differential Propositional Calculus • 9

Special Classes of Propositions

The full set of propositions f : A \to \mathbb{B} contains a number of smaller classes deserving of special attention.

A basic proposition in the universe of discourse [a_1, \ldots, a_n] is one of the propositions in the set \{ a_1, \ldots, a_n \}.  There are of course exactly n of these.  Depending on the context, basic propositions may also be called coordinate propositions or simple propositions.

Among the 2^{2^n} propositions in [a_1, \ldots, a_n] are several families numbering 2^n propositions each which take on special forms with respect to the basis \{ a_1, \ldots, a_n \}.  Three of these families are especially prominent in the present context, the linear, the positive, and the singular propositions.  Each family is naturally parameterized by the coordinate n-tuples in \mathbb{B}^n and falls into n + 1 ranks, with a binomial coefficient \tbinom{n}{k} giving the number of propositions having rank or weight k in their class.

In each case the rank k ranges from 0 to n and counts the number of positive appearances of the coordinate propositions a_1, \ldots, a_n in the resulting expression.  For example, when n = 3 the linear proposition of rank 0 is 0, the positive proposition of rank 0 is 1, and the singular proposition of rank 0 is \texttt{(} a_1 \texttt{)} \texttt{(} a_2 \texttt{)} \texttt{(} a_3 \texttt{)}.

The basic propositions a_i : \mathbb{B}^n \to \mathbb{B} are both linear and positive.  So these two kinds of propositions, the linear and the positive, may be viewed as two different ways of generalizing the class of basic propositions.

Finally, it is important to note that all of the above distinctions are relative to the choice of a particular logical basis \mathcal{A} = \{ a_1, \ldots, a_n \}.  A singular proposition with respect to the basis \mathcal{A} will not remain singular if \mathcal{A} is extended by a number of new and independent features.  Even if one keeps to the original set of pairwise options \{ a_i \} \cup \{ \texttt{(} a_i \texttt{)} \} to pick out a new basis, the sets of linear propositions and positive propositions are both determined by the choice of basic propositions, and this whole determination is tantamount to the purely conventional choice of a cell as origin.

Resources

cc: FB | Differential LogicLaws of FormMathstodonAcademia.edu
cc: Conceptual GraphsCyberneticsStructural 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.

2 Responses to Differential Propositional Calculus • 9

  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.