Changes

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

Revision as of 17:20, 17 August 2009

20 bytes removed , 17:20, 17 August 2009

renumber figures & tables

Line 1,164: Line 1,164:

o=============================< DNF >=======================o

</pre>

−

| (32)

+

| (31)

|}

Line 1,203: Line 1,203:

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

</pre>

−

| (33)

+

| (32)

|}

Line 1,230: Line 1,230:

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

</pre>

−

| (34)

+

| (33)

|}

Line 1,382: Line 1,382:

o=============================< DNF >=======================o

</pre>

−

| (35)

+

| (34)

|}

Line 1,402: Line 1,402:

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

</pre>

−

| (36)

+

| (35)

|}

Line 1,426: Line 1,426:

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

</pre>

−

| (37)

+

| (36)

|}

Line 1,446: Line 1,446:

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

</pre>

−

| (38)

+

| (37)

|}

Line 1,465: Line 1,465:

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

</pre>

−

| (39)

+

| (38)

|}

Line 1,496: Line 1,496:

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

</pre>

−

| (40)

+

| (39)

|}

Line 1,558: Line 1,558:

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

</pre>

−

| (41)

+

| (40)

|}

Line 1,997: Line 1,997:

o==================================< QED >==================o

</pre>

−

| (42)

+

| (41)

|}

Line 2,195: Line 2,195:

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

−

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

+

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

|- style="background:#f0f0ff"

|

Line 2,288: Line 2,288:

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

−

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

+

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

|-

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

Line 2,294: Line 2,294:

|  

|-

−

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

+

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

|-

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

Line 2,300: Line 2,300:

|  

|-

−

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

+

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

|-

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

Line 2,306: Line 2,306:

|  

|-

−

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

+

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

|-

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

Line 2,326: Line 2,326:

{| 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_{207} |] ~=~ [| p \le q |]</math>

+

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

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

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

Line 2,348: Line 2,348:

{| 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_{187} |] ~=~ [| q \le r |]</math>

+

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

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

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

Line 2,370: Line 2,370:

{| 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_{175} |] ~=~ [| p \le r |]</math>

+

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

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

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

Line 2,392: Line 2,392:

{| 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.} ~~ [| f_{139} |] ~=~ [| p \le q \le r |]</math>

+

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

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

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

Line 2,474: Line 2,474:

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 in 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) = f_{139}(p, q, r) = \texttt{(} p \texttt{(} q \texttt{))(} q \texttt{(} r \texttt{))}</math> as the ''syllogism map'', written as <math>\operatorname{syll} : \mathbb{B}^3 \to \mathbb{B},</math> and let us refer to its fiber of truth <math>[| \operatorname{syll} |] = \operatorname{syll}^{-1}(1)</math> as the ''syllogism relation'', written as <math>\operatorname{Syll} \subseteq \mathbb{B}^3.</math> Table 52 shows <math>\operatorname{Syll}</math> as a relational dataset.

+

For ease of reference in 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) = f_{139}(p, q, r) = \texttt{(} p \texttt{(} q \texttt{))(} q \texttt{(} r \texttt{))}</math> as the ''syllogism map'', written as <math>\operatorname{syll} : \mathbb{B}^3 \to \mathbb{B},</math> and let us refer to its fiber of truth <math>[| \operatorname{syll} |] = \operatorname{syll}^{-1}(1)</math> as the ''syllogism relation'', written as <math>\operatorname{Syll} \subseteq \mathbb{B}^3.</math> Table 51 shows <math>\operatorname{Syll}</math> as a relational dataset.

<br>

{| 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 52.} ~~ \text{Syllogism Relation}</math>

+

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

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

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

Line 2,498: Line 2,498:

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 53 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 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.

<br>

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

−

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

+

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

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

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

Line 2,587: Line 2,587:

Figure 28-a. Boolean 3-Cube B^3

</pre>

−

| (54)

+

| (53)

|}

−

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

+

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

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

|

<pre>

−

Table ~~28-b~~. Syll c B^3

+

Table 54. Syll c B^3

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

| p q r |

Line 2,605: Line 2,605:

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

</pre>

−

| (55)

+

| (54)

|-

|

Line 2,638: Line 2,638:

| |

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

−

Figure ~~28-c~~. Triadic Relation Syll c B^3

+

Figure 55. Triadic Relation Syll c B^3

</pre>

−

| (56)

+

| (55)

|}

Line 2,648: Line 2,648:

|

<pre>

−

Table ~~29-a~~. Syll c B^3

+

Table 56. Syll c B^3

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

| p q r |

Line 2,658: Line 2,658:

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

</pre>

−

| (57)

+

| (56)

|-

|

<pre>

−

Table ~~29-b~~. Dyadic Projections of Syll

+

Table 57. Dyadic Projections of Syll

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

Line 2,675: Line 2,675:

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

</pre>

−

| (58)

+

| (57)

|}

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 ~~29-c~~ shows <math>\operatorname{Syll}</math> and its three 2-adic projections:

+

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

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

Line 2,736: Line 2,736:

| |

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

−

Figure ~~29-c~~. Syll c B^3 and its Dyadic Projections

+

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

</pre>

−

| (59)

+

| (58)

|}

Line 2,746: Line 2,746:

|

<pre>

−

Table ~~30-a~~. Syll c B^3

+

Table 59. Syll c B^3

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

| p q r |

Line 2,756: Line 2,756:

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

</pre>

−

| (60)

+

| (59)

|-

|

<pre>

−

Table ~~30-b~~. Dyadic Projections of Syll

+

Table 60. Dyadic Projections of Syll

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

Line 2,773: Line 2,773:

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

</pre>

−

| (61)

+

| (60)

|-

|

<pre>

−

Table ~~30-c~~. Tacit Extensions of Projections of Syll

+

Table 61. Tacit Extensions of Projections of Syll

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

Line 2,795: Line 2,795:

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

</pre>

−

| (62)

+

| (61)

|-

|

Line 2,838: Line 2,838:

| |

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

−

Figure ~~30-d~~. Tacit Extension te_12_3 (Syll_12)

+

Figure 62. Tacit Extension te_12_3 (Syll_12)

</pre>

−

| (63)

+

| (62)

|-

|

Line 2,892: Line 2,892:

| |

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

−

Figure ~~30-e~~. Tacit Extension te_13_2 (Syll_13)

+

Figure 63. Tacit Extension te_13_2 (Syll_13)

</pre>

−

| (64)

+

| (63)

|-

|

Line 2,937: Line 2,937:

| |

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

−

Figure ~~30-f~~. Tacit Extension te_23_1 (Syll_23)

+

Figure 64. Tacit Extension te_23_1 (Syll_23)

</pre>

−

| (65)

+

| (64)

|}

Line 3,015: Line 3,015:

| |

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

−

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

+

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

</pre>

−

| (66)

+

| (65)

|}

Line 3,024: Line 3,024:

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 or maybe second sight, the relationships seem easy enough to write out. Figure 32 shows how the various logical expressions are related to each other: The expressions "(p (q))" and "(q (r))" 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 "(p (q)) (q (r))" that would the canonical result of an equational or reversible rule of inference. From that equational inference, one might arrive at the implicational inference "(p (r))" by the most conventional implication.

+

At first or maybe second sight, the relationships seem easy enough to write out. Figure 66 shows how the various logical expressions are related to each other: The expressions "(p (q))" and "(q (r))" 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 "(p (q)) (q (r))" that would the canonical result of an equational or reversible rule of inference. From that equational inference, one might arrive at the implicational inference "(p (r))" by the most conventional implication.

<pre>

Line 3,080: Line 3,080:

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

−

Figure 32. Expressive Aspects of Transitive Inference

+

Figure 66. Expressive Aspects of Transitive Inference

</pre>

Most of the customary names for this type of process have turned out to have misleading connotations, and so I will experiment with calling it the ''expressive'' aspect of the various rules for transitive inference, simply to emphasize the fact that rules can be given for it that operate solely on signs and expressions, without necessarily needing to look at the objects that are denoted by these signs and expressions.

−

In the way of many experiments, the word ''expressive'' does not seem to work for what I wanted to say here, since we too often use it to suggest something that expresses an object or a purpose, and I wanted it to imply what is purely a matter of expression, shorn of consideration for anything objective. Aside from coining a word like ''ennotative'', some other options would be ''connotative'', ''hermeneutic'', ''semiotic'', ''syntactic'' — each of which works in some range of interpretation but fails in others~~. Trial 2~~. Let's try ''formulaic''.

+

In the way of many experiments, the word ''expressive'' does not seem to work for what I wanted to say here, since we too often use it to suggest something that expresses an object or a purpose, and I wanted it to imply what is purely a matter of expression, shorn of consideration for anything objective. Aside from coining a word like ''ennotative'', some other options would be ''connotative'', ''hermeneutic'', ''semiotic'', ''syntactic'' — each of which works in some range of interpretation but fails in others. Let's try ''formulaic''.

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''.

−

Table 33 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:

+

Table 67 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 3,159: Line 3,159:

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

−

Figure 33. Denotative Aspects of Transitive Inference

+

Figure 67. Denotative Aspects of Transitive Inference

</pre>

Line 3,197: Line 3,197:

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 35 translates the contents of Figure 33 into the new language.

+

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

<pre>

Line 3,261: Line 3,261:

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

−

Figure 35. Denotative Aspects of Transitive Inference

+

Figure 68. Denotative Aspects of Transitive Inference

</pre>

Jon Awbrey

12,080

edits

Changes

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

Revision as of 17:20, 17 August 2009

Navigation menu

Page actions

Page actions

Personal tools

Navigation

semantic

Site statistics

Tools

Search