Changes

\end{array}</math>

\end{array}</math>

|-

|-

| <big>&bull;</big>

| valign="top" | <big>&bull;</big>

| colspan="3" | By itself, the information <math>p \le q</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

| colspan="3" | By itself, the information <math>p \le q</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

|-

|-

| <big>&bull;</big>

| valign="top" | <big>&bull;</big>

| colspan="3" | By itself, the information <math>q \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

| colspan="3" | By itself, the information <math>q \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

|-

|-

| <big>&bull;</big>

| valign="top" | <big>&bull;</big>

| colspan="3" | By itself, the information <math>p \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

| colspan="3" | By itself, the information <math>p \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits.

|}

|}

~ p \le q \le r

~ p \le q \le r

\end{array}</math>

\end{array}</math>

|}

|}

These are just some of the initial observations that can be made about the dimensions of information and uncertainty in the conduct of logical inference, and there are many issues to be taken up as we get to the thick of it.  In particular, we are taking propositions far too literally at the outset, reading their spots at face value, as it were, without yet considering their species character as fallible signs.

These are just some of the initial observations that can be made about the dimensions of information and uncertainty in the conduct of logical inference, and there are many issues to be taken up as we get to the thick of it.  In particular, we are taking propositions far too literally at the outset, reading their spots at face value, as it were, without yet considering their species character as fallible signs.

For ease of reference during the rest of this discussion, let us refer to the propositional form ''f'' : '''B'''³ &rarr; '''B''' such that ''f''(''p'', ''q'', ''r'') = ''q''₁₃₉(''p'', ''q'', ''r'') = (p (q))(q (r)) as the ''syllogism mapping'', written as ''syll'' : '''B'''³ &rarr; '''B''', and let us refer to the fiber ''syll''^&minus;1(1) &sube; '''B'''³ as the ''syllogism relation'', written as ''Syll'' &sube; '''B'''³. Table 25-a shows ''Syll'' as a relational dataset.

For ease of reference during the rest of this discussion, let us refer to the propositional form <math>f : \mathbb{B}^3 \to \mathbb{B}</math> such that <math>f(p, q, r) = q_{139}(p, q, r) = \texttt{(} p \texttt{(} q \texttt{))(} q \texttt{(} r \texttt{))}</math> as the ''syllogism mapping'', written as <math>\operatorname{syll} : \mathbb{B}^3 \to \mathbb{B},</math> and let us refer to the fiber <math>\operatorname{syll}^{-1}(1) \subseteq \mathbb{B}^3</math> as the ''syllogism relation'', written as <math>\operatorname{Syll} \subseteq \mathbb{B}^3.</math>  Table 25-a shows <math>\operatorname{Syll}</math> as a relational dataset.

{| align="center" cellpadding="10" style="text-align:center; width:90%"

{| align="center" cellpadding="10" style="text-align:center; width:90%"

|}

|}

One of the first questions that we might ask about a 3-adic relation, in this case ''Syll'', is whether it is ''determined by'' its 2-adic projections.  I will illustrate what this means in the present case.

One of the first questions that we might ask about a 3-adic relation, in this case <math>\operatorname{Syll},</math> is whether it is ''determined by'' its 2-adic projections.  I will illustrate what this means in the present case.

Table 25-b repeats the relation ''Syll'' in the first column, listing its 3-tuples in bit-string form, followed by the 2-adic or ''planar'' projections of ''Syll'' in the next three columns.  For instance, ''Syll''_''pq'' is the 2-adic projection of ''Syll'' on the ''pq'' plane that is arrived at by deleting the ''r'' column and counting each 2-tuple that results just one time.  Likewise, ''Syll''_''pr'' is obtained by deleting the ''q'' column and ''Syll''_''qr'' is derived by deleting the p column, ignoring whatever duplicate pairs may result.  The final row of the right three columns gives the propositions of the form ''f'' : '''B'''² &rarr; '''B''' that indicate the 2-adic relations that result from these projections.

Table 25-b repeats the relation ''Syll'' in the first column, listing its 3-tuples in bit-string form, followed by the 2-adic or ''planar'' projections of ''Syll'' in the next three columns.  For instance, ''Syll''_''pq'' is the 2-adic projection of ''Syll'' on the ''pq'' plane that is arrived at by deleting the ''r'' column and counting each 2-tuple that results just one time.  Likewise, ''Syll''_''pr'' is obtained by deleting the ''q'' column and ''Syll''_''qr'' is derived by deleting the p column, ignoring whatever duplicate pairs may result.  The final row of the right three columns gives the propositions of the form ''f'' : '''B'''² &rarr; '''B''' that indicate the 2-adic relations that result from these projections.