Changes

{| align="center" cellpadding="6" width="90%"

{| align="center" cellpadding="6" width="90%"

| A parenthesized sequence of propositional expressions in the form <math>\texttt{(} e_1 \texttt{,} e_2 \texttt{,} \ldots \texttt{,} e_{k-1} \texttt{,} e_k \texttt{)}</math> indicates that exactly one of the propositions <math>e_1, e_2, \ldots, e_{k-1}, e_k</math> is false, in other words, that their [[minimal negation]] is true.

| The second kind of propositional expression takes the form of a parenthesized sequence of propositional expressions, <math>\texttt{(} e_1 \texttt{,} e_2 \texttt{,} \ldots \texttt{,} e_{k-1} \texttt{,} e_k \texttt{)},</math> and is taken to indicate that exactly one of the propositions <math>e_1, e_2, \ldots, e_{k-1}, e_k</math> is false, in other words, that their [[minimal negation]] is true.

|}

|}

{| align="center" cellpadding="6" width="90%"

{| align="center" cellpadding="6" width="90%"

| A concatenated sequence of propositional expressions in the form <math>e_1\ e_2\ \ldots\ e_{k-1}\ e_k</math> indicates that all of the propositions <math>e_1, e_2, \ldots, e_{k-1}, e_k</math> are true, in other words, that their [[logical conjunction]] is true.

| The other kind of propositional expression takes the form of a concatenated sequence of propositional expressions, <math>e_1\ e_2\ \ldots\ e_{k-1}\ e_k,</math> and is taken to indicate that all of the propositions <math>e_1, e_2, \ldots, e_{k-1}, e_k</math> are true, in other words, that their [[logical conjunction]] is true.

|}

|}