Changes

Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems (view source)

Revision as of 04:36, 21 March 2010

No change in size , 04:36, 21 March 2010

→‎Variations on a theme of transitivity: reumber figures

Line 1,315: Line 1,315:

{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"

−

|+ <math>\text{Table 42.}~~\text{Composite and Compiled Order Relations}</math>

+

|+ <math>\text{Table 46.}~~\text{Composite and Compiled Order Relations}</math>

|- style="background:#f0f0ff"

|

Line 1,408: Line 1,408:

{| align="center" cellpadding="6" style="text-align:center"

−

| [[Image:Venn Diagram (P (Q)).jpg|500px]] || (42)

+

| [[Image:Venn Diagram (P (Q)).jpg|500px]] || (47)

|-

| <math>f_{207}(p, q, r) ~=~ \texttt{(} p \texttt{~(} q \texttt{))}</math>

Line 1,414: Line 1,414:

|  

|-

−

| [[Image:Venn Diagram (Q (R)).jpg|500px]] || (43)

+

| [[Image:Venn Diagram (Q (R)).jpg|500px]] || (48)

|-

| <math>f_{187}(p, q, r) ~=~ \texttt{(} q \texttt{~(} r \texttt{))}</math>

Line 1,420: Line 1,420:

|  

|-

−

| [[Image:Venn Diagram (P (R)).jpg|500px]] || (44)

+

| [[Image:Venn Diagram (P (R)).jpg|500px]] || (49)

|-

| <math>f_{175}(p, q, r) ~=~ \texttt{(} p \texttt{~(} r \texttt{))}</math>

Line 1,426: Line 1,426:

|  

|-

−

| [[Image:Venn Diagram (P (Q)) (Q (R)).jpg|500px]] || (45)

+

| [[Image:Venn Diagram (P (Q)) (Q (R)).jpg|500px]] || (50)

|-

| <math>f_{139}(p, q, r) ~=~ \texttt{(} p \texttt{~(} q \texttt{))~(} q \texttt{~(} r \texttt{))}</math>

Line 1,446: Line 1,446:

{| align="center" cellpadding="8" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black; text-align:center; width:40%"

−

|+ style="height:30px" | <math>\text{Table 47.} ~~ [| f_{207} |] ~=~ [| p \le q |]</math>

+

|+ style="height:30px" | <math>\text{Table 51.} ~~ [| f_{207} |] ~=~ [| p \le q |]</math>

|- style="height:40px; background:#f0f0ff"

| style="border-bottom:1px solid black" | <math>p\!</math>

Line 1,468: Line 1,468:

{| align="center" cellpadding="8" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black; text-align:center; width:40%"

−

|+ style="height:30px" | <math>\text{Table 48.} ~~ [| f_{187} |] ~=~ [| q \le r |]</math>

+

|+ style="height:30px" | <math>\text{Table 52.} ~~ [| f_{187} |] ~=~ [| q \le r |]</math>

|- style="height:40px; background:#f0f0ff"

| style="border-bottom:1px solid black" | <math>p\!</math>

Line 1,490: Line 1,490:

{| align="center" cellpadding="8" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black; text-align:center; width:40%"

−

|+ style="height:30px" | <math>\text{Table 49.} ~~ [| f_{175} |] ~=~ [| p \le r |]</math>

+

|+ style="height:30px" | <math>\text{Table 53.} ~~ [| f_{175} |] ~=~ [| p \le r |]</math>

|- style="height:40px; background:#f0f0ff"

| style="border-bottom:1px solid black" | <math>p\!</math>

Line 1,512: Line 1,512:

{| align="center" cellpadding="8" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black; text-align:center; width:40%"

−

|+ style="height:30px" | <math>\text{Table 50.} ~~ [| f_{139} |] ~=~ [| p \le q \le r |]</math>

+

|+ style="height:30px" | <math>\text{Table 54.} ~~ [| f_{139} |] ~=~ [| p \le q \le r |]</math>

|- style="height:40px; background:#f0f0ff"

| style="border-bottom:1px solid black" | <math>p\!</math>

Line 1,599: Line 1,599:

{| align="center" cellpadding="8" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black; text-align:center; width:40%"

−

|+ style="height:30px" | <math>\text{Table 51.} ~~ \text{Syllogism Relation}</math>

+

|+ style="height:30px" | <math>\text{Table 55.} ~~ \text{Syllogism Relation}</math>

|- style="height:40px; background:#f0f0ff"

| style="border-bottom:1px solid black" | <math>p\!</math>

Line 1,618: Line 1,618:

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 52 repeats the relation <math>\operatorname{Syll}</math> in the first column, listing its 3-tuples in bit-string form, followed by the 2-adic or ''planar'' projections of <math>\operatorname{Syll}</math> in the next three columns. For instance, <math>\operatorname{Syll}_{pq}</math> is the 2-adic projection of <math>\operatorname{Syll}</math> on the <math>pq\!</math> plane that is arrived at by deleting the <math>r\!</math> column and counting each 2-tuple that results just one time. Likewise, <math>\operatorname{Syll}_{pr}</math> is obtained by deleting the <math>q\!</math> column and <math>\operatorname{Syll}_{qr}</math> is derived by deleting the <math>p\!</math> column, ignoring whatever duplicate pairs may result. The final row of the right three columns gives the propositions of the form <math>f : \mathbb{B}^2 \to \mathbb{B}</math> that indicate the 2-adic relations that result from these projections.

+

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

<br>

{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:80%"

−

|+ style="height:30px" | <math>\text{Table 52.} ~~ \text{Dyadic Projections of the Syllogism Relation}</math>

+

|+ style="height:30px" | <math>\text{Table 56.} ~~ \text{Dyadic Projections of the Syllogism Relation}</math>

|- style="height:40px; background:#f0f0ff"

| <math>\operatorname{Syll}</math>

Line 1,671: Line 1,671:

But the more I survey the problem setting the more it looks like we need better ways to bring our visual intuitions to play on the scene, and so let us next lay out some visual schemata that are designed to facilitate that.

−

Figure 52 shows the familiar picture of a boolean 3-cube, where the points of <math>\mathbb{B}^3</math> are coordinated as bit strings of length three. Looking at the functions <math>f : \mathbb{B}^3 \to \mathbb{B}</math> and the relations <math>L \subseteq \mathbb{B}^3</math> on this pattern, one views the construction of either type of object as a matter of coloring the nodes of the 3-cube with choices from a pair of colors that stipulate which points are in the relation <math>L = [| f |]\!</math> and which points are out of it. Bowing to common convention, we may use the color <math>1\!</math> for points that are ''in'' a given relation and the color <math>0\!</math> for points that are ''out'' of the same relation. However, it will be more convenient here to indicate the former case by writing the coordinates in the place of the node and to indicate the latter case by plotting the point as an unlabeled node "o".

+

Figure 57 shows the familiar picture of a boolean 3-cube, where the points of <math>\mathbb{B}^3</math> are coordinated as bit strings of length three. Looking at the functions <math>f : \mathbb{B}^3 \to \mathbb{B}</math> and the relations <math>L \subseteq \mathbb{B}^3</math> on this pattern, one views the construction of either type of object as a matter of coloring the nodes of the 3-cube with choices from a pair of colors that stipulate which points are in the relation <math>L = [| f |]\!</math> and which points are out of it. Bowing to common convention, we may use the color <math>1\!</math> for points that are ''in'' a given relation and the color <math>0\!</math> for points that are ''out'' of the same relation. However, it will be more convenient here to indicate the former case by writing the coordinates in the place of the node and to indicate the latter case by plotting the point as an unlabeled node "o".

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

Line 1,705: Line 1,705:

| |

o-------------------------------------------------o

−

Figure 52. Boolean 3-Cube B^3

+

Figure 56. Boolean 3-Cube B^3

</pre>

−

| (52)

+

| (57)

|}

−

Table 53 shows the 3-adic relation <math>\operatorname{Syll} \subseteq \mathbb{B}^3</math> again, and Figure 54 shows it plotted on a 3-cube template.

+

Table 58 shows the 3-adic relation <math>\operatorname{Syll} \subseteq \mathbb{B}^3</math> again, and Figure 59 shows it plotted on a 3-cube template.

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

|

<pre>

−

Table 53. Syll c B^3

+

Table 58. Syll c B^3

o-----------------------o

| p q r |

Line 1,725: Line 1,725:

o-----------------------o

</pre>

−

| (53)

+

| (58)

|-

|

Line 1,758: Line 1,758:

| |

o-------------------------------------------------o

−

Figure 54. Triadic Relation Syll c B^3

+

Figure 59. Triadic Relation Syll c B^3

</pre>

−

| (54)

+

| (59)

|}

Line 1,768: Line 1,768:

|

<pre>

−

Table 55. Syll c B^3

+

Table 60. Syll c B^3

o-----------------------o

| p q r |

Line 1,778: Line 1,778:

o-----------------------o

</pre>

−

| (55)

+

| (60)

|-

|

<pre>

−

Table 56. Dyadic Projections of Syll

+

Table 61. Dyadic Projections of Syll

o-----------o o-----------o o-----------o

Line 1,795: Line 1,795:

o-----------o o-----------o o-----------o

</pre>

−

| (56)

+

| (61)

|}

In showing the 2-adic projections of a 3-adic relation <math>L \subseteq \mathbb{B}^3,</math> I will translate the coordinates of the points in each relation to the plane of the projection, there dotting out with a dot "." the bit of the bit string that is out of place on that plane.

−

Figure 57 shows <math>\operatorname{Syll}</math> and its three 2-adic projections:

+

Figure 62 shows <math>\operatorname{Syll}</math> and its three 2-adic projections:

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

Line 1,856: Line 1,856:

| |

o-------------------------------------------------o

−

Figure 57. Syll c B^3 and its Dyadic Projections

+

Figure 62. Syll c B^3 and its Dyadic Projections

</pre>

−

| (57)

+

| (62)

|}

Line 1,866: Line 1,866:

|

<pre>

−

Table 58. Syll c B^3

+

Table 63. Syll c B^3

o-----------------------o

| p q r |

Line 1,876: Line 1,876:

o-----------------------o

</pre>

−

| (58)

+

| (63)

|-

|

<pre>

−

Table 59. Dyadic Projections of Syll

+

Table 64. Dyadic Projections of Syll

o-----------o o-----------o o-----------o

Line 1,893: Line 1,893:

o-----------o o-----------o o-----------o

</pre>

−

| (59)

+

| (64)

|-

|

<pre>

−

Table 60. Tacit Extensions of Projections of Syll

+

Table 65. Tacit Extensions of Projections of Syll

o---------------o o---------------o o---------------o

Line 1,915: Line 1,915:

o---------------o o---------------o o---------------o

</pre>

−

| (60)

+

| (65)

|-

|

Line 1,958: Line 1,958:

| |

o-------------------------------------------------o

−

Figure 61. Tacit Extension te_12_3 (Syll_12)

+

Figure 66. Tacit Extension te_12_3 (Syll_12)

</pre>

−

| (61)

+

| (66)

|-

|

Line 2,012: Line 2,012:

| |

o-------------------------------------------------o

−

Figure 62. Tacit Extension te_13_2 (Syll_13)

+

Figure 67. Tacit Extension te_13_2 (Syll_13)

</pre>

−

| (62)

+

| (67)

|-

|

Line 2,057: Line 2,057:

| |

o-------------------------------------------------o

−

Figure 63. Tacit Extension te_23_1 (Syll_23)

+

Figure 68. Tacit Extension te_23_1 (Syll_23)

</pre>

−

| (63)

+

| (68)

|}

−

The reader may wish to contemplate Figure 64 and use it to verify the following two facts:

+

The reader may wish to contemplate Figure 69 and use it to verify the following two facts:

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

Line 2,135: Line 2,135:

| |

o-------------------------------------------------o

−

Figure 64. Syll = te(Syll_12) |^| te(Syll_23)

+

Figure 69. Syll = te(Syll_12) |^| te(Syll_23)

</pre>

−

| (64)

+

| (69)

|}

Line 2,144: Line 2,144:

In accord with my experimental way, I will stick with the case of transitive inference until I have pinned it down thoroughly, but of course the real interest is much more general than that.

−

At first sight, the relationships seem easy enough to write out. Figure 65 shows how the various logical expressions are related to each other: The expressions <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} q \texttt{))} {}^{\prime\prime}</math> and <math>{}^{\backprime\backprime} \texttt{(} q \texttt{~(} r \texttt{))} {}^{\prime\prime}</math> are conjoined in a purely syntactic fashion — much in the way that one might compile a theory from axioms without knowing what either the theory or the axioms were about — and the best way to sum up the state of information implicit in taking them together is just the expression <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} q \texttt{))~(} q \texttt{~(} r \texttt{))}{}^{\prime\prime}</math> that would the canonical result of an equational or reversible rule of inference. From that equational inference, one might arrive at the implicational inference <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} r \texttt{))} {}^{\prime\prime}</math> by the most conventional implication.

+

At first sight, the relationships seem easy enough to write out. Figure 70 shows how the various logical expressions are related to each other: The expressions <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} q \texttt{))} {}^{\prime\prime}</math> and <math>{}^{\backprime\backprime} \texttt{(} q \texttt{~(} r \texttt{))} {}^{\prime\prime}</math> are conjoined in a purely syntactic fashion — much in the way that one might compile a theory from axioms without knowing what either the theory or the axioms were about — and the best way to sum up the state of information implicit in taking them together is just the expression <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} q \texttt{))~(} q \texttt{~(} r \texttt{))}{}^{\prime\prime}</math> that would the canonical result of an equational or reversible rule of inference. From that equational inference, one might arrive at the implicational inference <math>{}^{\backprime\backprime} \texttt{(} p \texttt{~(} r \texttt{))} {}^{\prime\prime}</math> by the most conventional implication.

<pre>

Line 2,200: Line 2,200:

o-------------------o

−

Figure 65. Expressive Aspects of Transitive Inference

+

Figure 70. Expressive Aspects of Transitive Inference

</pre>

Line 2,209: Line 2,209:

Despite how simple the formulaic aspects of transitive inference might appear on the surface, there are problems that wait for us just beneath the syntactic surface, as we quickly discover if we turn to considering the kinds of objects, abstract and concrete, that these formulas are meant to denote, and all the more so if we try to do this in a context of computational implementations, where the "interpreters" to be addressed take nothing on faith. Thus we engage the ''denotative semantics'' or the ''model theory'' of these extremely simple programs that we call ''propositions''.

−

Figure 66 is an attempt to outline the model-theoretic relationships that are involved in our study of transitive inference. A couple of alternative notations are introduced in this Table:

+

Figure 71 is an attempt to outline the model-theoretic relationships that are involved in our study of transitive inference. A couple of alternative notations are introduced in this Table:

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

Line 2,279: Line 2,279:

o---------o---------o o---------o---------o

−

Figure 66. Denotative Aspects of Transitive Inference

+

Figure 71. Denotative Aspects of Transitive Inference

</pre>

Line 2,317: Line 2,317:

An abstract reference to a point of <math>X\!</math> is a triple in <math>\mathbb{B}^3.</math> A concrete reference to a point of <math>X\!</math> is a conjunction of signs from the dimensions <math>P^\ddagger, Q^\ddagger, R^\ddagger,</math> picking exactly one sign from each dimension.

−

To illustrate the use of concrete coordinates for points and concrete types for spaces and propositions, Figure 67 translates the contents of Figure 66 into the new language.

+

To illustrate the use of concrete coordinates for points and concrete types for spaces and propositions, Figure 72 translates the contents of Figure 71 into the new language.

<pre>

Line 2,381: Line 2,381:

o---------o---------o o---------o---------o

−

Figure 67. Denotative Aspects of Transitive Inference

+

Figure 72. Denotative Aspects of Transitive Inference

</pre>

Jon Awbrey

12,080

edits