#DifferentialPropositionalCalculus • 2.2
• https://inquiryintoinquiry.com/2020/02/22/differential-propositional-calculus-2/

Table 6 outlines a #Syntax for #PropositionalCalculus based on two types of #LogicalConnectives, both of variable \(k\)-ary scope.
• https://inquiryintoinquiry.files.wordpress.com/2020/02/syntax-and-semantics-of-a-calculus-for-propositional-logic.png

In the second type of connective a concatenation of propositional expressions in the form \(e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k\) indicates all the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) are true, in other words, their #LogicalConjunction is true.

#DifferentialPropositionalCalculus • 2.1
• https://inquiryintoinquiry.com/2020/02/22/differential-propositional-calculus-2/

Table 6 outlines a #Syntax for #PropositionalCalculus based on two types of #LogicalConnectives, both of variable \(k\)-ary scope.
• https://inquiryintoinquiry.files.wordpress.com/2020/02/syntax-and-semantics-of-a-calculus-for-propositional-logic.png

In the first type of connective 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 exactly one of the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) is false.