12,080
edits
Changes
Directory:Jon Awbrey/Papers/Futures Of Logical Graphs (view source)
Revision as of 12:41, 6 August 2017
, 12:41, 6 August 2017→Categories of structured individuals: waybak links
{{DISPLAYTITLE:Futures Of Logical Graphs}}
{{DISPLAYTITLE:Futures Of Logical Graphs}}
This article develops an extension of [[Charles Sanders Peirce]]'s [[Logical Graph]]s.
'''Author: [[User:Jon Awbrey|Jon Awbrey]]'''
This article develops an extension of [[Charles Sanders Peirce]]'s [[Logical Graphs]].
==Introduction==
==Introduction==
I think I am finally ready to speculate on the futures of logical graphs that will be able to rise to the challenge of embodying the fundamental logical insights of Peirce.
I think I am finally ready to speculate on the futures of logical graphs that will be able to rise to the challenge of embodying the fundamental logical insights of Peirce.
For the sake of those who may be unfamiliar with it, let us first divert ourselves with an exposition of a standard way that graphs of the order that Peirce considered, those embedded in a continuous manifold like a plane sheet of paper, without or without the paper bridges that Peirce used to augment his genus, can be represented as parse-strings in Asciiish and sculpted into pointer-structures in computer memory.
For the sake of those who may be unfamiliar with it, let us first divert ourselves with an exposition of a standard way that graphs of the order that Peirce considered, those embedded in a continuous manifold like a plane sheet of paper, without or without the paper bridges that Peirce used to augment his genus, can be represented as parse-strings in Ascii and sculpted into pointer-structures in computer memory.
A blank sheet of paper can be represented as a blank space in a line of text, but that way of doing it tends to be confusing unless the logical expression under consideration is set off in a separate display.
A blank sheet of paper can be represented as a blank space in a line of text, but that way of doing it tends to be confusing unless the logical expression under consideration is set off in a separate display.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_3_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_3_Visible_Frame.jpg|500px]]
|}
|}
This can be written inline as <math>{}^{\backprime\backprime} \texttt{(~(~)~)} = \quad {}^{\prime\prime}</math> or set off in a text display:
This can be written inline as <math>{}^{\backprime\backprime} \texttt{(} ~ \texttt{(} ~ \texttt{)} ~ \texttt{)} = \quad {}^{\prime\prime}~\!</math> or set off in a text display:
{| align="center" cellpadding="10"
{| align="center" cellspacing="10"
| width="33%" | <math>\texttt{(~(~)~)}</math>
| width="33%" | <math>\texttt{(} ~ \texttt{(} ~ \texttt{)} ~ \texttt{)}~\!</math>
| width="34%" | <math>=\!</math>
| width="34%" | <math>=~\!</math>
| width="33%" |
| width="33%" |
|}
|}
When we turn to representing the corresponding expressions in computer memory, where they can be manipulated with utmost facility, we begin by transforming the planar graphs into their topological duals. The planar regions of the original graph correspond to nodes (or points) of the dual graph, and the boundaries between planar regions in the original graph correspond to edges (or lines) between the nodes of the dual graph.
When we turn to representing the corresponding expressions in computer memory, where they can be manipulated with utmost facility, we begin by transforming the planar graphs into their topological duals. The planar regions of the original graph correspond to nodes (or points) of the dual graph, and the boundaries between planar regions in the original graph correspond to edges (or lines) between the nodes of the dual graph.
For example, overlaying the corresponding dual graphs on the plane-embedded graphs shown above, we get the following composite picture:
For example, overlaying the corresponding dual graphs on the plane-embedded graphs shown above, we get the following composite picture:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_4_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_4_Visible_Frame.jpg|500px]]
|}
|}
The outermost region of the plane-embedded graph is singled out for special consideration and the corresponding node of the dual graph is referred to as its ''root node''. By way of graphical convention in the present text, the root node is indicated by means of a horizontal strike-through.
The outermost region of the plane-embedded graph is singled out for special consideration and the corresponding node of the dual graph is referred to as its ''root node''. By way of graphical convention in the present text, the root node is indicated by means of a horizontal strike-through.
Extracting the dual graph from its composite matrix, we get this picture:
Extracting the dual graph from its composite matrix, we get this picture:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_5_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_5_Visible_Frame.jpg|500px]]
|}
|}
It is easy to see the relationship between the parenthetical expressions of Peirce's logical graphs, that somewhat clippedly picture the ordered containments of their formal contents, and the associated dual graphs, that constitute the species of rooted trees here to be described.
It is easy to see the relationship between the parenthetical expressions of Peirce's logical graphs, that somewhat clippedly picture the ordered containments of their formal contents, and the associated dual graphs, that constitute the species of rooted trees here to be described.
In the case of our last example, a moment's contemplation of the following picture will lead us to see that we can get the corresponding parenthesis string by starting at the root of the tree, climbing up the left side of the tree until we reach the top, then climbing back down the right side of the tree until we return to the root, all the while reading off the symbols, in this case either <math>{}^{\backprime\backprime} \texttt{(} {}^{\prime\prime}</math> or <math>{}^{\backprime\backprime} \texttt{)} {}^{\prime\prime},</math> that we happen to encounter in our travels.
In the case of our last example, a moment's contemplation of the following picture will lead us to see that we can get the corresponding parenthesis string by starting at the root of the tree, climbing up the left side of the tree until we reach the top, then climbing back down the right side of the tree until we return to the root, all the while reading off the symbols, in this case either <math>{}^{\backprime\backprime} \texttt{(} {}^{\prime\prime}~\!</math> or <math>{}^{\backprime\backprime} \texttt{)} {}^{\prime\prime},~\!</math> that we happen to encounter in our travels.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_6_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_6_Visible_Frame.jpg|500px]]
|}
|}
This ritual is called ''traversing'' the tree, and the string read off is often called the ''traversal string'' of the tree. The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is often called the ''parse graph'' of the string. I tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.
This ritual is called ''traversing'' the tree, and the string read off is often called the ''traversal string'' of the tree. The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is often called the ''parse graph'' of the string. I tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.
This much preparation allows us to present the two most basic axioms of logical graphs, shown in graph and string forms below, along with handy names for referring to the different directions of applying the axioms.
This much preparation allows us to present the two most basic axioms of logical graphs, shown in graph and string forms below, along with handy names for referring to the different directions of applying the axioms.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_14_Banner.jpg|500px]]
| [[File:Logical_Graph_Figure_14_Banner.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_15_Banner.jpg|500px]]
| [[File:Logical_Graph_Figure_15_Banner.jpg|500px]]
|}
|}
The ''parse graphs'' that we've been looking at so far are one step toward the ''pointer graphs'' that it takes to make trees live in computer memory, but they are still a couple of steps too abstract to properly suggest in much concrete detail the species of dynamic data structures that we need. I now proceed to flesh out the skeleton that I've drawn up to this point.
The ''parse graphs'' that we've been looking at so far are one step toward the ''pointer graphs'' that it takes to make trees live in computer memory, but they are still a couple of steps too abstract to properly suggest in much concrete detail the species of dynamic data structures that we need. I now proceed to flesh out the skeleton that I've drawn up to this point.
Nodes in a graph depict ''records'' in computer memory. A record is a collection of data that can be thought to reside at a specific ''address''. For semioticians, an address can be recognized as a type of index, and is commonly spoken of, on analogy with demonstrative pronouns, as a ''pointer'', even among computer programmers who are otherwise innocent of semiotics.
Nodes in a graph depict ''records'' in computer memory. A record is a collection of data that can be thought to reside at a specific ''address''. For semioticians, an address can be recognized as a type of index, and is commonly spoken of, on analogy with demonstrative pronouns, as a ''pointer'', even among computer programmers who are otherwise innocent of semiotics.
At the next level of concreteness, a pointer-record structure is represented as follows:
At the next level of concreteness, a pointer-record structure is represented as follows:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_11_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_11_Visible_Frame.jpg|500px]]
|}
|}
This portrays the pointer <math>\mathit{index}_0\!</math> as the address of a record that contains the following data:
This portrays the pointer <math>\mathit{index}_{\,0}~\!</math> as the address of a record that contains the following data:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| <math>\mathit{datum}_1, \mathit{datum}_2, \mathit{datum}_3, \ldots,\!</math> and so on.
| <math>\mathit{datum}_{\,1}, \mathit{datum}_{\,2}, \mathit{datum}_{\,3}, \ldots,~\!</math> and so on.
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_12_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_12_Visible_Frame.jpg|500px]]
|}
|}
Back at the abstract level, it takes three nodes to represent the three data records, with a root node connected to two other nodes. The ordinary bits of data are then treated as labels on the nodes:
Back at the abstract level, it takes three nodes to represent the three data records, with a root node connected to two other nodes. The ordinary bits of data are then treated as labels on the nodes:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_13_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_13_Visible_Frame.jpg|500px]]
|}
|}
Notice that, with rooted trees like these, drawing the arrows is optional, since singling out a unique node as the root induces a unique orientation on all the edges of the tree, ''up'' being the same as ''away from the root''.
Notice that, with rooted trees like these, drawing the arrows is optional, since singling out a unique node as the root induces a unique orientation on all the edges of the tree, ''up'' being the same as ''away from the root''.
We have treated in some detail various forms of the initial equation or logical axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(~(~)~)} = \quad {}^{\prime\prime}.</math> For the sake of comparison, let's record the plane-embedded and topological dual forms of the axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(~)(~)} = \texttt{(~)} {}^{\prime\prime}.</math>
We have treated in some detail various forms of the initial equation or logical axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(} ~ \texttt{(} ~ \texttt{)} ~ \texttt{)} = \quad {}^{\prime\prime}.~\!</math> For the sake of comparison, let's record the plane-embedded and topological dual forms of the axiom that is formulated in string form as <math>{}^{\backprime\backprime} \texttt{(} ~ \texttt{)(} ~ \texttt{)} = \texttt{(} ~ \texttt{)} {}^{\prime\prime}.~\!</math>
First the plane-embedded maps:
First the plane-embedded maps:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_7_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_7_Visible_Frame.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_8_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_8_Visible_Frame.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_9_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_9_Visible_Frame.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_10_Visible_Frame.jpg|500px]]
| [[File:Logical_Graph_Figure_10_Visible_Frame.jpg|500px]]
|}
|}
Because I plan this time around a somewhat leisurely excursion through the primordial wilds of logics that were so intrepidly explored by C.S. Peirce and again in recent times revisited by George Spencer Brown, let me just give a few extra pointers to those who wish to run on ahead of this torturous tortoise pace:
Because I plan this time around a somewhat leisurely excursion through the primordial wilds of logics that were so intrepidly explored by C.S. Peirce and again in recent times revisited by George Spencer Brown, let me just give a few extra pointers to those who wish to run on ahead of this torturous tortoise pace:
:* Jon Awbrey, [http://forum.wolframscience.com/printthread.php?threadid=297&perpage=35 Propositional Equation Reasoning Systems].
:* Jon Awbrey, [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems].
:* Lou Kauffman, [http://www.math.uic.edu/~kauffman/Arithmetic.htm Box Algebra, Boundary Mathematics, Logic, and Laws of Form].
:* Lou Kauffman, [http://www.math.uic.edu/~kauffman/Arithmetic.htm Box Algebra, Boundary Mathematics, Logic, and Laws of Form].
When I call to mind a ''category of structured individuals'' (COSI), I get a picture of a certain form, with blanks to be filled in as the thought of it develops, that can be sketched at first like so:
When I call to mind a ''category of structured individuals'' (COSI), I get a picture of a certain form, with blanks to be filled in as the thought of it develops, that can be sketched at first like so:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Category @
/ \
/ \
/ \
/ \
/ \
Individuals o ... o
/ \ / \
/ \ / \
/ \ / \
Structures o->-o->-o o->-o->-o
</pre>
</pre>
|}
|}
The various glyphs of this picturesque hierarchy serve to remind us that a COSI in general consists of many individuals, which in spite of their calling as such may have specific structures involving the ordering of their component parts. Of course, this generic picture may have degenerate realizations, as when we have a 1-adic relation, that may be viewed in most settings as nothing different than a set:
The various glyphs of this picturesque hierarchy serve to remind us that a COSI in general consists of many individuals, which in spite of their calling as such may have specific structures involving the ordering of their component parts. Of course, this generic picture may have degenerate realizations, as when we have a 1-adic relation, that may be viewed in most settings as nothing different than a set:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Category @
/ \
/ \
/ \
/ \
/ \
Individuals o ... o
| |
| |
| |
Structures o ... o
</pre>
</pre>
|}
|}
The practical use of Peirce's categories is simply to organize our thoughts about what sorts of formal models are demanded by a material situation, for instance, a domain of phenomena from atoms to biology to culture. To say that "k-ness" is involved in a phenomenon is simply to say that we need k-adic relations to model it adequately, and that the phenomenon itself appears to demand nothing less. Aside from this, Peirce's realization that k-ness for k = 1, 2, 3 affords us with a sufficient basis for all that we need to model is a formal fact that depends on a particular theorem in the logic of relatives. If it weren't for that, there would hardly be any reason to single out three.
The practical use of Peirce's categories is simply to organize our thoughts about what sorts of formal models are demanded by a material situation, for instance, a domain of phenomena from atoms to biology to culture. To say that “''k''-ness” is involved in a phenomenon is simply to say that we need ''k''-adic relations to model it adequately, and that the phenomenon itself appears to demand nothing less. Aside from this, Peirce's realization that ''k''-ness for ''k'' = 1, 2, 3 affords us with a sufficient basis for all that we need to model is a formal fact that depends on a particular theorem in the logic of relatives. If it weren't for that, there would hardly be any reason to single out three.
In order to discuss the various forms of iconicity that might be involved in the application of Peirce's logical graphs and their kind to the object domain of logic itself, we will need to bring out two or three ''categories of structured individuals'' (COSIs), depending on how one counts. These are called the ''object domain'', the ''sign domain'', and the ''interpretant sign domain'', which may be written <math>O, S, I,\!</math> respectively, or <math>X, Y, Z,\!</math> respectively, depending on the style that fits the current frame of discussion.
In order to discuss the various forms of iconicity that might be involved in the application of Peirce's logical graphs and their kind to the object domain of logic itself, we will need to bring out two or three ''categories of structured individuals'' (COSIs), depending on how one counts. These are called the ''object domain'', the ''sign domain'', and the ''interpretant sign domain'', which may be written <math>{O, S, I},~\!</math> respectively, or <math>{X, Y, Z},~\!</math> respectively, depending on the style that fits the current frame of discussion.
For the time being, we will be considering systems where the sign domain and the interpretant domain are the same sets of entities, although, of course, their roles in a given ''[[sign relation]]'', say, <math>L \subseteq O \times S \times I</math> or <math>L \subseteq X \times Y \times Z,</math> remain as distinct as ever. We may use the term ''semiotic domain'' for the common set of elements that constitute the signs and the interpretant signs in any setting where the sign domain and the interpretant domain are equal as sets.
For the time being, we will be considering systems where the sign domain and the interpretant domain are the same sets of entities, although, of course, their roles in a given ''[[sign relation]]'', say, <math>L \subseteq O \times S \times I</math> or <math>L \subseteq X \times Y \times Z,</math> remain as distinct as ever. We may use the term ''semiotic domain'' for the common set of elements that constitute the signs and the interpretant signs in any setting where the sign domain and the interpretant domain are equal as sets.
To consider how a system of logical graphs, taken together as a semiotic domain, might bear an iconic relationship to a system of logical objects that make up our object domain, we will next need to consider what our logical objects are.
To consider how a system of logical graphs, taken together as a semiotic domain, might bear an iconic relationship to a system of logical objects that make up our object domain, we will next need to consider what our logical objects are.
A popular answer, if by popular one means that both Peirce and Frege agreed on it, is to say that our ultimate logical objects are without loss of generality most conveniently referred to as Truth and Falsity. If nothing else, it serves the end of beginning simply to go along with this thought for a while, and so we can start with an object domain that consists of just two ''objects'' or ''values'', to wit, <math>O = \mathbb{B} = \{ \operatorname{false}, \operatorname{true} \}.</math>
A popular answer, if by popular one means that both Peirce and Frege agreed on it, is to say that our ultimate logical objects are without loss of generality most conveniently referred to as Truth and Falsity. If nothing else, it serves the end of beginning simply to go along with this thought for a while, and so we can start with an object domain that consists of just two ''objects'' or ''values'', to wit, <math>O = \mathbb{B} = \{ \mathrm{false}, \mathrm{true} \}.</math>
Given those two categories of structured individuals, namely, <math>O = \mathbb{B} = \{ \operatorname{false}, \operatorname{true} \}</math> and <math>S = \{ \text{logical graphs} \},\!</math> the next task is to consider the brands of morphisms from <math>S\!</math> to <math>O\!</math> that we might reasonably have in mind when we speak of the ''arrows of interpretation''.
Given those two categories of structured individuals, namely, <math>O = \mathbb{B} = \{ \mathrm{false}, \mathrm{true} \}</math> and <math>S = \{ \text{logical graphs} \},~\!</math> the next task is to consider the brands of morphisms from <math>S~\!</math> to <math>O~\!</math> that we might reasonably have in mind when we speak of the ''arrows of interpretation''.
With the aim of embedding our consideration of logical graphs, as seems most fitting, within Peirce's theory of triadic sign relations, we have declared the first layers of our object, sign, and interpretant domains. As we often do in formal studies, we've taken the sign and interpretant domains to be the same set, <math>S = I,\!</math> calling it the ''semiotic domain'', or, as I see that I've done in some other notes, the ''syntactic domain''.
With the aim of embedding our consideration of logical graphs, as seems most fitting, within Peirce's theory of triadic sign relations, we have declared the first layers of our object, sign, and interpretant domains. As we often do in formal studies, we've taken the sign and interpretant domains to be the same set, <math>S = I,~\!</math> calling it the ''semiotic domain'', or, as I see that I've done in some other notes, the ''syntactic domain''.
Truth and Falsity, the objects that we've so far declared, are recognizable as abstract objects, and like so many other hypostatic abstractions that we use they have their use in moderating between a veritable profusion of more concrete objects and more concrete signs, in ''factoring complexity'' as some people say, despite the fact that some complexities are irreducible in fact.
Truth and Falsity, the objects that we've so far declared, are recognizable as abstract objects, and like so many other hypostatic abstractions that we use they have their use in moderating between a veritable profusion of more concrete objects and more concrete signs, in ''factoring complexity'' as some people say, despite the fact that some complexities are irreducible in fact.
As agents of systems, whether that system is our own physiology or our own society, we move through what we commonly imagine to be a continuous manifold of states, but with distinctions being drawn in that space that are every bit as compelling to us, and often quite literally, as the difference between life and death. So the relation of discretion to continuity is not one of those issues that we can take lightly, or simply dissolve by choosing a side and ignoring the other, as we may imagine in abstraction. I'll try to get back to this point later, one in a long list of cautionary notes that experience tells me has to be attached to every tale of our pilgrimage, but for now we must get under way.
As agents of systems, whether that system is our own physiology or our own society, we move through what we commonly imagine to be a continuous manifold of states, but with distinctions being drawn in that space that are every bit as compelling to us, and often quite literally, as the difference between life and death. So the relation of discretion to continuity is not one of those issues that we can take lightly, or simply dissolve by choosing a side and ignoring the other, as we may imagine in abstraction. I'll try to get back to this point later, one in a long list of cautionary notes that experience tells me has to be attached to every tale of our pilgrimage, but for now we must get under way.
Returning to <math>\operatorname{En}</math> and <math>\operatorname{Ex},</math> the two most popular interpretations of logical graphs, ones that happen to be dual to each other in a certain sense, let's see how they fly as ''hermeneutic arrows'' from the syntactic domain <math>S\!</math> to the object domain <math>O,\!</math> at any rate, as their trajectories can be spied in the radar of what George Spencer Brown called the ''primary arithmetic''.
Returning to <math>\mathrm{En}</math> and <math>\mathrm{Ex},</math> the two most popular interpretations of logical graphs, ones that happen to be dual to each other in a certain sense, let's see how they fly as ''hermeneutic arrows'' from the syntactic domain <math>S~\!</math> to the object domain <math>O,~\!</math> at any rate, as their trajectories can be spied in the radar of what George Spencer Brown called the ''primary arithmetic''.
Taking <math>\operatorname{En}</math> and <math>\operatorname{Ex}</math> as arrows of the form <math>\operatorname{En}, \operatorname{Ex} : S \to O,</math> at the level of arithmetic taking <math>S = \{ \text{rooted trees} \}\!</math> and <math>O = \{ \operatorname{falsity}, \operatorname{truth} \},\!</math> it is possible to factor each arrow across the domain <math>S_0\!</math> that consists of a single rooted node plus a single rooted edge, in other words, the domain of formal constants <math>S_0 = \{ \ominus, \vert \} = \{</math>[[Image:Rooted Node.jpg|16px]], [[Image:Rooted Edge.jpg|12px]]<math>\}.\!</math> This allows each arrow to be broken into a purely syntactic part <math>\operatorname{En}_\text{syn}, \operatorname{Ex}_\text{syn} : S \to S_0</math> and a purely semantic part <math>\operatorname{En}_\text{sem}, \operatorname{Ex}_\text{sem} : S_0 \to O.</math>
Taking <math>\mathrm{En}~\!</math> and <math>\mathrm{Ex}~\!</math> as arrows of the form <math>\mathrm{En}, \mathrm{Ex} : S \to O,</math> at the level of arithmetic taking <math>S = \{ \text{rooted trees} \}~\!</math> and <math>O = \{ \mathrm{falsity}, \mathrm{truth} \},~\!</math> it is possible to factor each arrow across the domain <math>S_0~\!</math> that consists of a single rooted node plus a single rooted edge, in other words, the domain of formal constants <math>S_0 = \{ \ominus, \vert \} = \{</math>[[File:Rooted Node Big.jpg|16px]], [[File:Rooted Edge Big.jpg|12px]]<math>\}.~\!</math> This allows each arrow to be broken into a purely syntactic part <math>\mathrm{En}_\text{syn}, \mathrm{Ex}_\text{syn} : S \to S_0</math> and a purely semantic part <math>\mathrm{En}_\text{sem}, \mathrm{Ex}_\text{sem} : S_0 \to O.</math>
As things work out, the syntactic factors are formally the same, leaving our dualing interpretations to differ in their semantic components alone. Specifically, we have the following mappings:
As things work out, the syntactic factors are formally the same, leaving our dualing interpretations to differ in their semantic components alone. Specifically, we have the following mappings:
{| cellpadding="6"
{| cellpadding="6"
| width="5%" |
| width="5%" |
| width="5%" | <math>\operatorname{En}_\text{sem} :</math>
| width="5%" | <math>\mathrm{En}_\text{sem} :</math>
| width="5%" align="center" | [[Image:Rooted Node.jpg|16px]]
| width="5%" align="center" | [[File:Rooted Node Big.jpg|16px]]
| width="5%" | <math>\mapsto</math>
| width="5%" | <math>\mapsto</math>
| <math>\operatorname{false},</math>
| <math>\mathrm{false},</math>
|-
|-
|
|
|
|
| align="center" | [[Image:Rooted Edge.jpg|12px]]
| align="center" | [[File:Rooted Edge Big.jpg|12px]]
| <math>\mapsto</math>
| <math>\mapsto</math>
| <math>\operatorname{true}.</math>
| <math>\mathrm{true}.</math>
|-
|-
|
|
| <math>\operatorname{Ex}_\text{sem} :</math>
| <math>\mathrm{Ex}_\text{sem} :</math>
| align="center" | [[Image:Rooted Node.jpg|16px]]
| align="center" | [[File:Rooted Node Big.jpg|16px]]
| <math>\mapsto</math>
| <math>\mapsto</math>
| <math>\operatorname{true},</math>
| <math>\mathrm{true},</math>
|-
|-
|
|
|
|
| align="center" | [[Image:Rooted Edge.jpg|12px]]
| align="center" | [[File:Rooted Edge Big.jpg|12px]]
| <math>\mapsto</math>
| <math>\mapsto</math>
| <math>\operatorname{false}.</math>
| <math>\mathrm{false}.</math>
|}
|}
On the other side of the ledger, because the syntactic factors, <math>\operatorname{En}_\text{syn}</math> and <math>\operatorname{Ex}_\text{syn},</math> are indiscernible from each other, there is a syntactic contribution to the overall interpretation process that can be most readily investigated on purely formal grounds. That will be the task to face when next we meet on these lists.
On the other side of the ledger, because the syntactic factors, <math>\mathrm{En}_\text{syn}</math> and <math>\mathrm{Ex}_\text{syn},</math> are indiscernible from each other, there is a syntactic contribution to the overall interpretation process that can be most readily investigated on purely formal grounds. That will be the task to face when next we meet on these lists.
Cast into the form of a 3-adic sign relation, the situation before us can now be given the following shape:
Cast into the form of a 3-adic sign relation, the situation before us can now be given the following shape:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Y
Semiotic Domain
o-------------------o
| |
| Rooted Trees |
| |
o-------------------o
|
|
Syntactic
Reduction
|
|
v
o-----------o En_sem o-----------o
| |<--------------| o |
| F T | | O | |
| |<--------------| @ |
o-----------o Ex_sem o-----------o
X Y_0
Canonical
Object Domain Sign Domain
</pre>
</pre>
|}
|}
The interpretation maps <math>\operatorname{En}, \operatorname{Ex} : Y \to X</math> are factored into (1) a common syntactic part and (2) a couple of distinct semantic parts:
The interpretation maps <math>\mathrm{En}, \mathrm{Ex} : Y \to X</math> are factored into (1) a common syntactic part and (2) a couple of distinct semantic parts:
{| align="center" cellpadding="10" width="90%"
{| align="center" cellpadding="10" width="90%"
<math>\begin{array}{ll}
<math>\begin{array}{ll}
1. &
1. &
\operatorname{En}_\text{syn} = \operatorname{Ex}_\text{syn} = \operatorname{E}_\text{syn} : Y \to Y_0
\mathrm{En}_\text{syn} = \mathrm{Ex}_\text{syn} = \mathrm{E}_\text{syn} : Y \to Y_0
\\[10pt]
\\[10pt]
2. &
2. &
\operatorname{En}_\text{sem}, \operatorname{Ex}_\text{sem} : Y_0 \to X
\mathrm{En}_\text{sem}, \mathrm{Ex}_\text{sem} : Y_0 \to X
\end{array}</math>
\end{array}</math>
|}
|}
The functional images of the syntactic reduction map <math>\operatorname{E}_\text{syn} : Y \to Y_0</math> are the two simplest signs or the most reduced pair of expressions, regarded as the rooted trees [[Image:Rooted Node.jpg|16px]] and [[Image:Rooted Edge.jpg|12px]], and these may be treated as the canonical representatives of their respective equivalence classes.
The functional images of the syntactic reduction map <math>\mathrm{E}_\text{syn} : Y \to Y_0</math> are the two simplest signs or the most reduced pair of expressions, regarded as the rooted trees [[File:Rooted Node Big.jpg|16px]] and [[File:Rooted Edge Big.jpg|12px]], and these may be treated as the canonical representatives of their respective equivalence classes.
The more Peirce-sistent among you, on contemplating that last picture, will naturally ask, "What happened to the irreducible 3-adicity of sign relations in this portrayal of logical graphs?"
The more Peirce-sistent among you, on contemplating that last picture, will naturally ask, "What happened to the irreducible 3-adicity of sign relations in this portrayal of logical graphs?"
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Y
Semiotic Domain
o-------------------o
| |
| Rooted Trees |
| |
o-------------------o
|
|
Syntactic
Reduction
|
|
v
o-----------o En_sem o-----------o
| |<--------------| o |
| F T | | O | |
| |<--------------| @ |
o-----------o Ex_sem o-----------o
X Y_0
Canonical
Object Domain Sign Domain
</pre>
</pre>
|}
|}
The answer is that the last bastion of 3-adic irreducibility presides precisely in the duality of the dual interpretations <math>\operatorname{En}_\text{sem}</math> and <math>\operatorname{Ex}_\text{sem}.</math> To see this, consider the consequences of there being, contrary to all that we've assumed up to this point, some ultimately compelling reason to assert that the clean slate, the empty medium, the vacuum potential, whatever one wants to call it, is inherently more meaningful of either Falsity or Truth. This would issue in a conviction forthwith that the 3-adic sign relation involved in this case decomposes as a composition of a couple of functions, that is to say, reduces to a 2-adic relation.
The answer is that the last bastion of 3-adic irreducibility presides precisely in the duality of the dual interpretations <math>\mathrm{En}_\text{sem}</math> and <math>\mathrm{Ex}_\text{sem}.</math> To see this, consider the consequences of there being, contrary to all that we've assumed up to this point, some ultimately compelling reason to assert that the clean slate, the empty medium, the vacuum potential, whatever one wants to call it, is inherently more meaningful of either Falsity or Truth. This would issue in a conviction forthwith that the 3-adic sign relation involved in this case decomposes as a composition of a couple of functions, that is to say, reduces to a 2-adic relation.
The duality of interpretation for logical graphs tells us that the empty medium, the tabula rasa, what Peirce called the ''Sheet of Assertion'' (SA) is a genuine symbol, not to be found among the degenerate species of signs that make up icons and indices, nor, as the SA has no parts, can it number icons or indices among its parts. What goes for the medium must go for all of the signs that it mediates. Thus we have the kinds of signs that Peirce in one place called "pure symbols", naming a selection of signs for basic logical operators specifically among them.
The duality of interpretation for logical graphs tells us that the empty medium, the tabula rasa, what Peirce called the ''Sheet of Assertion'' (SA) is a genuine symbol, not to be found among the degenerate species of signs that make up icons and indices, nor, as the SA has no parts, can it number icons or indices among its parts. What goes for the medium must go for all of the signs that it mediates. Thus we have the kinds of signs that Peirce in one place called "pure symbols", naming a selection of signs for basic logical operators specifically among them.
:* Pure Symbols
:* Pure Symbols
:: http://stderr.org/pipermail/inquiry/2005-March/thread.html#2465
:: [http://web.archive.org/web/20141124153003/http://stderr.org/pipermail/inquiry/2005-March/thread.html#2465 2005 • March]
:: http://stderr.org/pipermail/inquiry/2005-April/thread.html#2517
:: [http://web.archive.org/web/20120601160642/http://stderr.org/pipermail/inquiry/2005-April/thread.html#2517 2005 • April]
:* Pure Symbols : Discussion
:* Pure Symbols : Discussion
:: http://stderr.org/pipermail/inquiry/2005-March/thread.html#2466
:: [http://web.archive.org/web/20141124153003/http://stderr.org/pipermail/inquiry/2005-March/thread.html#2466 2005 • March]
:: http://stderr.org/pipermail/inquiry/2005-April/thread.html#2514
:: [http://web.archive.org/web/20120601160642/http://stderr.org/pipermail/inquiry/2005-April/thread.html#2514 2005 • April]
:: http://stderr.org/pipermail/inquiry/2005-May/thread.html#2654
:: [http://web.archive.org/web/20120421003708/http://stderr.org/pipermail/inquiry/2005-May/thread.html#2654 2005 • May]
And some will find an ethical principle in this freedom of interpretation. The act of interpretation bears within it an inalienable degree of freedom. In consequence of this truth, as far as the activity of interpretation goes, freedom and responsibility are the very same thing. We cannot blame objects for what we say or what we think. We cannot blame symbols for what we do. We cannot escape our response ability. We cannot escape our freedom.
And some will find an ethical principle in this freedom of interpretation. The act of interpretation bears within it an inalienable degree of freedom. In consequence of this truth, as far as the activity of interpretation goes, freedom and responsibility are the very same thing. We cannot blame objects for what we say or what we think. We cannot blame symbols for what we do. We cannot escape our response ability. We cannot escape our freedom.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_14_Banner.jpg|500px]]
| [[File:Logical_Graph_Figure_14_Banner.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_15_Banner.jpg|500px]]
| [[File:Logical_Graph_Figure_15_Banner.jpg|500px]]
|}
|}
Let <math>S\!</math> be the set of rooted trees and let <math>S_0\!</math> be the 2-element subset of <math>S\!</math> that consists of a rooted node and a rooted edge.
Let <math>S~\!</math> be the set of rooted trees and let <math>S_0~\!</math> be the 2-element subset of <math>S~\!</math> that consists of a rooted node and a rooted edge.
{| align="center" cellpadding="10" style="text-align:center"
{| align="center" cellpadding="10" style="text-align:center"
| <math>S\!</math>
| <math>S~\!</math>
| <math>=\!</math>
| <math>=~\!</math>
| <math>\{ \text{rooted trees} \}\!</math>
| <math>\{ \text{rooted trees} \}~\!</math>
|-
|-
| <math>S_0\!</math>
| <math>S_0~\!</math>
| <math>=\!</math>
| <math>=~\!</math>
| <math>\{ \ominus, \vert \} = \{</math>[[Image:Rooted Node.jpg|16px]], [[Image:Rooted Edge.jpg|12px]]<math>\}\!</math>
| <math>\{ \ominus, \vert \} = \{</math>[[File:Rooted Node Big.jpg|16px]], [[File:Rooted Edge Big.jpg|12px]]<math>\}~\!</math>
|}
|}
Simple intuition, or a simple inductive proof, assures us that any rooted tree can be reduced by way of the arithmetic initials either to a root node [[Image:Rooted Node.jpg|16px]] or else to a rooted edge [[Image:Rooted Edge.jpg|12px]] .
Simple intuition, or a simple inductive proof, assures us that any rooted tree can be reduced by way of the arithmetic initials either to a root node [[File:Rooted Node Big.jpg|16px]] or else to a rooted edge [[File:Rooted Edge Big.jpg|12px]] .
For example, consider the reduction that proceeds as follows:
For example, consider the reduction that proceeds as follows:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_16.jpg|500px]]
| [[File:Logical_Graph_Figure_16.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_16.jpg|500px]]
| [[File:Logical_Graph_Figure_16.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_17.jpg|500px]]
| [[File:Logical_Graph_Figure_17.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_18.jpg|500px]]
| [[File:Logical_Graph_Figure_18.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_19.jpg|500px]]
| [[File:Logical_Graph_Figure_19.jpg|500px]]
|}
|}
Thus, if you find youself in an argument with another interpreter who swears to the influence of some quality common to the object and the sign and that really does affect his or her conduct in regard to the two of them, then that argument is almost certainly bound to be utterly futile. I am sure we've all been there.
Thus, if you find youself in an argument with another interpreter who swears to the influence of some quality common to the object and the sign and that really does affect his or her conduct in regard to the two of them, then that argument is almost certainly bound to be utterly futile. I am sure we've all been there.
When I first became acquainted with the Entish and Extish hermenautics of logical graphs, back in the late great 1960's, I was struck in the spirit of those times by what I imagined to be their Zen and Zenoic sensibilities, the ''tao is silent'' wit of the Zen mind being the empty mind, that seems to go along with the ''Ex'' interpretation, and the way from ''the way that's marked is not the true way'' to ''the mark that's marked is not the remarkable mark'' and to ''the sign that's signed is not the significant sign'' of the ''En'' interpretation, reminding us that the sign is not the object, no matter how apt the image. And later, when my discovery of the cactus graph extension of logical graphs led to the leimons of neural pools, where ''En'' says that truth is an active condition, while ''Ex'' says that sooth is a quiescent mind, all these themes got reinforced more still.
When I first became acquainted with the Entish and Extish hermenautics of logical graphs, back in the late great 1960s, I was struck in the spirit of those times by what I imagined to be their Zen and Zenoic sensibilities, the ''tao is silent'' wit of the Zen mind being the empty mind, that seems to go along with the <math>\mathrm{Ex}~\!</math> interpretation, and the way from ''the way that's marked is not the true way'' to ''the mark that's marked is not the remarkable mark'' and to ''the sign that's signed is not the significant sign'' of the <math>\mathrm{En}~\!</math> interpretation, reminding us that the sign is not the object, no matter how apt the image. And later, when my discovery of the cactus graph extension of logical graphs led to the leimons of neural pools, where <math>\mathrm{En}~\!</math> says that truth is an active condition, while <math>\mathrm{Ex}~\!</math> says that sooth is a quiescent mind, all these themes got reinforced more still.
We hold these truths to be self-iconic, but they come in complementary couples, in consort to the flip-side of the tao.
We hold these truths to be self-iconic, but they come in complementary couples, in consort to the flip-side of the tao.
A ''sort'' of signs is more formally known as an ''equivalence class'' (EC). There are in general many sorts of sorts of signs that we might wish to consider in this inquiry, but let's begin with the sort of signs all of whose members denote the same object as their referent, a sort of signs to be henceforth referred to as a ''referential equivalence class'' (REC).
A ''sort'' of signs is more formally known as an ''equivalence class'' (EC). There are in general many sorts of sorts of signs that we might wish to consider in this inquiry, but let's begin with the sort of signs all of whose members denote the same object as their referent, a sort of signs to be henceforth referred to as a ''referential equivalence class'' (REC).
:* [http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104 FOLG]
:* [http://web.archive.org/web/20150224133200/http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104 Inquiry List • Futures Of Logical Graphs]
:* [http://stderr.org/pipermail/inquiry/2005-October/003113.html FOLG 5]
:* [http://web.archive.org/web/20120206123011/http://stderr.org/pipermail/inquiry/2005-October/003113.html Inquiry List • Futures Of Logical Graphs • Note 5]
Toward the outset of this excursion, I mentioned the distinction between a ''pointwise-restricted iconic map'' or a ''pointedly rigid iconic map'' (PRIM) and a ''system-wide iconic map'' (SWIM). The time has come to make use of that mention.
Toward the outset of this excursion, I mentioned the distinction between a ''pointwise-restricted iconic map'' or a ''pointedly rigid iconic map'' (PRIM) and a ''system-wide iconic map'' (SWIM). The time has come to make use of that mention.
We are once again concerned with ''categories of structured items'' (COSIs) and the categories of mappings between them, indeed, the two ideas are all but inseparable, there being many good reasons to consider the very notion of structure to be most clearly defined in terms of the brands of "arrows", maps, or morphisms between items that are admitted to the category in view.
We are once again concerned with ''categories of structured items'' (COSIs) and the categories of mappings between them, indeed, the two ideas are all but inseparable, there being many good reasons to consider the very notion of structure to be most clearly defined in terms of the brands of "arrows", maps, or morphisms between items that are admitted to the category in view.
At the level of the ''primary arithmetic'' (PAR), we have a set-up like this:
At the level of the ''primary arithmetic'', we have a set-up like this:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Categories` ` ` ` `!O!` ` ` ` ` ` ` ` ` ` ` ` `!S!` ` ` ` ` `
Categories !O! !S!
/ \ / \
/ \ / \
/ \ / \
/ \ / \
/ \ Denotes / \
Individuals `{F}` ` ` ` `{T}` <------ ` {...} ` ` ` {...} ` `
Individuals {F} {T} <------ {...} {...}
| | /|\ /|\
| | / | \ / | \
| | / | \ / | \
Structures` ` F ` ` ` ` ` T ` ` ` ` ` o ` o ` o ` o ` o ` o `
Structures F T o o o o o o
o
|
o o o o
| \ / |
o o o o o o
| | | \ / |
F T @ @ @ @ @ @
</pre>
</pre>
|}
|}
The object domain '''O''' is the boolean domain '''B''' = {Falsity, Truth}, the semiotic domain '''S''' is any of the spaces isomorphic to the set of rooted trees, matched-up parentheses, or unlabeled alpha graphs, and we treat a couple of ''denotation maps'' ''D''<sub>en</sub>, ''D''<sub>ex</sub> : '''S''' → '''O'''.
The object domain <math>O~\!</math> is the boolean domain <math>\mathbb{B} = \{ \mathrm{falsity}, \mathrm{truth} \},</math> the semiotic domain <math>S~\!</math> is any of the spaces isomorphic to the set of rooted trees, matched-up parentheses, or unlabeled alpha graphs, and we treat a couple of ''denotation maps'' <math>\mathrm{den}_\text{en}, \mathrm{den}_\text{ex} : S \to O.</math>
Either one of the denotation maps induces the same partition of '''S''' into REC's, a partition whose structure is suggested by the following two sets of strings:
Either one of the denotation maps induces the same partition of <math>S~\!</math> into RECs, a partition whose structure is suggested by the following two sets of strings:
{| align="center" cellpadding="10" width="90%"
|
<math>\begin{matrix}
\{
& {}^{\backprime\backprime} \texttt{~} {}^{\prime\prime},
& {}^{\backprime\backprime} \texttt{((~))} {}^{\prime\prime},
& {}^{\backprime\backprime} \texttt{((~)(~))} {}^{\prime\prime},
& \ldots
& \}
\\[10pt]
\{
& {}^{\backprime\backprime} \texttt{(~)} {}^{\prime\prime},
& {}^{\backprime\backprime} \texttt{(~)(~)} {}^{\prime\prime},
& {}^{\backprime\backprime} \texttt{(((~)))} {}^{\prime\prime},
& \ldots
& \}
\end{matrix}</math>
|}
These are of course the parenthesis strings that correspond to the rooted trees that are shown in the lower right corner of the Figure.
These are of course the parenthesis strings that correspond to the rooted trees that are shown in the lower right corner of the Figure.
In thinking about mappings between categories of structured individuals, we can take each mapping in two parts. At the first level of analysis, there is the part that maps individuals to individuals. At the second level of analysis, there is the part that maps the structural parts of each individual to the structural parts of the individual that forms its counterpart under the first part of the mapping in question.
In thinking about mappings between categories of structured individuals, we can take each mapping in two parts. At the first level of analysis, there is the part that maps individuals to individuals. At the second level of analysis, there is the part that maps the structural parts of each individual to the structural parts of the individual that forms its counterpart under the first part of the mapping in question.
The general scheme of things is suggested by the following Figure, where the mapping ''f'' from COSI ''U'' to COSI ''V'' is analyzed in terms of a mapping ''g'' that takes individuals to individuals, ignoring their inner structures, and a set of mappings ''h''<sub>''j''</sub>, where ''j'' ranges over the individuals of COSI ''U'', and where ''h''<sub>''j''</sub> specifies just how the parts of ''j'' map to the parts of ''g''(''j''), its counterpart under ''g''.
The general scheme of things is suggested by the following Figure, where the mapping <math>f~\!</math> from COSI <math>U~\!</math> to COSI <math>V~\!</math> is analyzed in terms of a mapping <math>g~\!</math> that takes individuals to individuals, ignoring their inner structures, and a set of mappings <math>h_j,~\!</math> where <math>j~\!</math> ranges over the individuals of COSI <math>U,~\!</math> and where <math>h_j~\!</math> specifies just how the parts of <math>j~\!</math> map to the parts of <math>{g(j)},~\!</math> its counterpart under <math>{g}.~\!</math>
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
U f V
@ --------------------> @
/ \ / \
/ \ / \
/ \ / \
/ \ / \
/ \ g / \
o ... o --------> o ... o
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
o->-o->-o o->-o->-o o->-o->-o o->-o->-o
\ /
\ /
\ /
\ /
\ h_j /
o-------->----------o
</pre>
</pre>
|}
|}
Next time we'll apply this general scheme to the ''En'' and ''Ex'' interpretations of logical graphs, and see how it helps us to sort out the varieties of iconic mapping that are involved in that setting.
Next time we'll apply this general scheme to the <math>\mathrm{En}~\!</math> and <math>\mathrm{Ex}~\!</math> interpretations of logical graphs, and see how it helps us to sort out the varieties of iconic mapping that are involved in that setting.
Corresponding to the Entitative and Existential interpretations of the primary arithmetic, there are two distinct mappings from the sign domain '''S''', containing the topological equivalents of bare and rooted trees, onto the object domain '''O''', containing the two objects whose conventional, ordinary, or meta-language names are ''Falsity'' and ''Truth'', respectively.
Corresponding to the Entitative and Existential interpretations of the primary arithmetic, there are two distinct mappings from the sign domain <math>S,~\!</math> containing the topological equivalents of bare and rooted trees, onto the object domain <math>O,~\!</math> containing the two objects whose conventional, ordinary, or meta-language names are ''falsity'' and ''truth'', respectively.
The next two Figures suggest how one might view the interpretation maps as mappings from a COSI '''S''' to a COSI '''O'''. Here I have placed names of categories at the bottom, indices of individuals at the next level, and extended upward from there whatever structures the individuals may have.
The next two Figures suggest how one might view the interpretation maps as mappings from a COSI <math>S~\!</math> to a COSI <math>O.~\!</math> Here I have placed names of categories at the bottom, indices of individuals at the next level, and extended upward from there whatever structures the individuals may have.
Here is the Figure for the Entitative interpretation:
Here is the Figure for the Entitative interpretation:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o
|
o o o o
| | \ /
Structures` ` F ` ` ` ` ` T ` ` ` ` ` @ ` @ `...` @ ` @ `...`
Structures F T @ @ ... @ @ ...
| | \ | / \ | /
| | \ | / \ | /
| | En \|/ \|/
Individuals ` o ` ` ` ` ` o ` <-----` ` ` o ` ` ` ` ` o ` ` `
Individuals o o <----- o o
\ / \ /
\ / \ /
\ / \ /
\ / \ /
\ / \ /
Categories` ` ` ` `!O!` ` ` ` ` ` ` ` ` ` ` ` `!S!` ` ` ` ` `
Categories !O! !S!
</pre>
</pre>
|}
|}
Here is the Figure for the Existential interpretation:
Here is the Figure for the Existential interpretation:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o
|
o o o o
| \ / |
Structures` ` F ` ` ` ` ` T ` ` ` ` ` @ ` @ `...` @ ` @ `...`
Structures F T @ @ ... @ @ ...
| | \ | / \ | /
| | \ | / \ | /
| | Ex \|/ \|/
Individuals ` o ` ` ` ` ` o ` <-----` ` ` o ` ` ` ` ` o ` ` `
Individuals o o <----- o o
\ / \ /
\ / \ /
\ / \ /
\ / \ /
\ / \ /
Categories` ` ` ` `!O!` ` ` ` ` ` ` ` ` ` ` ` `!S!` ` ` ` ` `
Categories !O! !S!
</pre>
</pre>
|}
|}
Note that the structure of a tree begins at its root, marked by an "O". The objects in '''O''' have no further structure to speak of, so there is nothing much happening in the object domain '''O''' between the level of individuals and the level of structures. In the sign domain '''S''', the individuals are the parts of the partition into referential equivalence classes, each part of which contains a countable infinity of syntactic structures, rooted trees, or whatever form one views their structures taking. The sense of the Figures is that the interpretation under consideration maps the individual on the left (right) side of '''S''' to the individual on the left (right) side of '''O'''.
Note that the structure of a tree begins at its root, marked by an "O". The objects in <math>O~\!</math> have no further structure to speak of, so there is nothing much happening in the object domain <math>O~\!</math> between the level of individuals and the level of structures. In the sign domain <math>S~\!</math> the individuals are the parts of the partition into referential equivalence classes, each part of which contains a countable infinity of syntactic structures, rooted trees, or whatever form one views their structures taking. The sense of the Figures is that the interpretation under consideration maps the individual on the left side of <math>S~\!</math> to the individual on the left side of <math>O~\!</math> and maps the individual on the right side of <math>S~\!</math> to the individual on the right side of <math>O.~\!</math>
An iconic mapping, that gets formalized in mathematical terms as a ''morphism'', is said to be a ''structure-preserving map''. This does not mean that all of the structure of the source domain is preserved in the map ''images'' of the target domain, but only ''some'' of the structure, that is, specific types of relation that are defined among the elements of the source and target, respectively.
An iconic mapping, that gets formalized in mathematical terms as a ''morphism'', is said to be a ''structure-preserving map''. This does not mean that all of the structure of the source domain is preserved in the map ''images'' of the target domain, but only ''some'' of the structure, that is, specific types of relation that are defined among the elements of the source and target, respectively.
For example, let's start with the archetype of all morphisms, namely, a ''linear function'' or a ''linear mapping'' ''f'' : ''X'' → ''Y''.
For example, let's start with the archetype of all morphisms, namely, a ''linear function'' or a ''linear mapping'' <math>f : X \to Y.</math>
To say that the function ''f'' is ''linear'' is to say that we have already got in mind a couple of relations on ''X'' and ''Y'' that have forms roughly analogous to "addition tables", so let's signify their operation by means of the symbols "#" for "addition in ''X''" and "+" for "addition in ''Y''".
To say that the function <math>f~\!</math> is ''linear'' is to say that we have already got in mind a couple of relations on <math>X~\!</math> and <math>Y~\!</math> that have forms roughly analogous to "addition tables", so let's signify their operation by means of the symbols <math>{}^{\backprime\backprime} \# {}^{\prime\prime}</math> for addition in <math>X~\!</math> and <math>{}^{\backprime\backprime} + {}^{\prime\prime}</math> for addition in <math>Y.~\!</math>
More exactly, the use of "#" refers to a 3-adic relation ''L''<sub>''X''</sub> ⊆ ''X'' × ''X'' × ''X'' that licenses the formula "''a'' # ''b'' = ''c''" just when <''a'', ''b'', ''c''> is in ''L''<sub>''X''</sub>, and the use of "+" refers to a 3-adic relation ''L''<sub>''Y''</sub> ⊆ ''Y'' × ''Y'' × ''Y'' that licenses the formula "''p'' + ''q'' = ''r''" just when <''p'', ''q'', ''r''> is in ''L''<sub>''Y''</sub>.
More exactly, the use of <math>{}^{\backprime\backprime} \# {}^{\prime\prime}</math> refers to a 3-adic relation <math>L_X \subseteq X \times X \times X</math> that licenses the formula <math>a ~\#~ b = c</math> just when <math>(a, b, c)~\!</math> is in <math>L_X~\!</math> and the use of <math>{}^{\backprime\backprime} + {}^{\prime\prime}</math> refers to a 3-adic relation <math>L_Y \subseteq Y \times Y \times Y</math> that licenses the formula <math>p + q = r~\!</math> just when <math>(p, q, r)~\!</math> is in <math>L_Y.~\!</math>
In this setting, the mapping ''f'' : ''X'' → ''Y'' is said to be ''linear'', and to ''preserve'' the structure of ''L''<sub>''X''</sub> in the structure of ''L''<sub>''Y''</sub>, if and only if ''f''(''a'' # ''b'') = ''f''(''a'') + ''f''(''b''), for all pairs ''a'', ''b'' in ''X''. In other words, ''f'' ''distributes'' over the additions # to +, just as if it were a form of multiplication, like ''m''(''a'' + ''b'') = ''ma'' + ''mb''.
In this setting the mapping <math>f : X \to Y</math> is said to be ''linear'', and to ''preserve'' the structure of <math>L_X~\!</math> in the structure of <math>L_Y,~\!</math> if and only if <math>f(a ~\#~ b) = f(a) + f(b),</math> for all pairs <math>a, b~\!</math> in <math>X.~\!</math> In other words, the function <math>f~\!</math> ''distributes'' over the two additions, from <math>\#</math> to <math>+,~\!</math> just as if <math>f~\!</math> were a form of multiplication, analogous to <math>m(a + b) = ma + mb.~\!</math>
Writing this more directly in terms of the 3-adic relations ''L''<sub>''X''</sub> and ''L''<sub>''Y''</sub> instead of via their operation symbols, we would say that ''f'' : ''X'' → ''Y'' is linear with regard to ''L''<sub>''X''</sub> and ''L''<sub>''Y''</sub> if and only if <''a'', ''b'', ''c''> being in the relation ''L''<sub>''X''</sub> determines that its map image <''f''(''a''), ''f''(''b''), ''f''(''c'')> be in ''L''<sub>''Y''</sub>. To see this, observe that <''a'', ''b'', ''c''> being in ''L''<sub>''X''</sub> implies that ''c'' = ''a'' # ''b'', and <''f''(''a''), ''f''(''b''), ''f''(''c'')> being in ''L''<sub>''Y''</sub> implies that ''f''(''c'') = ''f''(''a'') + ''f''(''b''), so we have that ''f''(''a'' # ''b'') = ''f''(''c'') = ''f''(''a'') + ''f''(''b''), and the two notions are one.
Writing this more directly in terms of the 3-adic relations <math>L_X~\!</math> and <math>L_Y~\!</math> instead of via their operation symbols, we would say that <math>f : X \to Y</math> is linear with regard to <math>L_X~\!</math> and <math>L_Y~\!</math> if and only if <math>(a, b, c)~\!</math> being in the relation <math>L_X~\!</math> determines that its map image <math>(f(a), f(b), f(c))~\!</math> be in <math>L_Y.~\!</math> To see this, observe that <math>(a, b, c)~\!</math> being in <math>L_X~\!</math> implies that <math>c = a ~\#~ b,</math> and <math>(f(a), f(b), f(c))~\!</math> being in <math>L_Y~\!</math> implies that <math>f(c) = f(a) + f(b),~\!</math> so we have that <math>f(a ~\#~ b) = f(c) = f(a) + f(b),</math> and the two notions are one.
The idea of mappings that preserve 3-adic relations should ring a few bells here.
The idea of mappings that preserve 3-adic relations should ring a few bells here.
Once again into the breach between the interpretations ''En'', ''Ex'' : '''S''' → '''O''', drawing but a single Figure in the sand and relying on the reader to recall:
Once again into the breach between the interpretations <math>\mathrm{En}, \mathrm{Ex} : S \to O,</math> drawing but a single Figure in the sand and relying on the reader to recall:
{| align="center" cellpadding="10" width="90%"
|
<p><math>\mathrm{En}~\!</math> maps every tree on the left side of <math>S~\!</math> to the left side of <math>O.~\!</math></p>
<p><math>\mathrm{En}~\!</math> maps every tree on the right side of <math>S~\!</math> to the right side of <math>O.~\!</math></p>
|-
|
<p><math>\mathrm{Ex}~\!</math> maps every tree on the left side of <math>S~\!</math> to the right side of <math>O.~\!</math></p>
{| align="center" style="text-align:center; width:90%"
<p><math>\mathrm{Ex}~\!</math> maps every tree on the right side of <math>S~\!</math> to the left side of <math>O.~\!</math></p>
|}
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o
|
o o o o
| | \ /
Structures` ` F ` ` ` ` ` T ` ` ` ` ` @ ` @ `...` @ ` @ `...`
Structures F T @ @ ... @ @ ...
| | \ | / \ | /
| | \ | / \ | /
| | En \|/ \|/
Individuals ` o ` ` ` ` ` o ` <-----` ` ` o ` ` ` ` ` o ` ` `
Individuals o o <----- o o
\ / Ex \ /
\ / \ /
\ / \ /
\ / \ /
\ / \ /
Categories` ` ` ` `!O!` ` ` ` ` ` ` ` ` ` ` ` `!S!` ` ` ` ` `
Categories !O! !S!
</pre>
</pre>
|}
|}
Those who wish to say that these logical signs are iconic of their logical objects must not only find some reason that logic itself singles out one interpretation over the other, but, even if they succeed in that, they must further make us believe that every sign for Truth is iconic of Truth, while every sign for Falsity is iconic of Falsity.
One of the questions that arises at this point, where we have a very small object domain <math>O = \{ \mathrm{falsity}, \mathrm{truth} \}</math> and a very large sign domain <math>S \cong \{ \text{rooted trees} \},</math> is the following:
:* Why do we have so many ways of saying the same thing?
In other words, what possible utility is there in a language having so many signs to denote the same object? Why not just restrict the language to a canonical collection of signs, each of which denotes one and only one object, exclusively and uniquely? Indeed, language reformers from time to time have proposed the design of languages that have just this property, but I think this is one of those places where natural evolution has luckily hit on a better plan than the sorts of intentional design that inexperienced designers typically craft.
Of course, very little of this can be apparent at the level of primary arithmetic, but I think it should become a little more obvious as we enter the primary algebra.
The answer to the puzzle of semiotic multiplicity appears to have something to do with the use of language in interacting with a complex external world. The objective world throws its multiplicity of problems at us, and the first duty of language is to provide some expression of their structure, on the fly, as quickly as possible, in real time, as they come in, no matter how obscurely our quick and dirty expressions of the problematic situation might otherwise be. Of course, very little of this can be apparent at the level of primary arithmetic, but I think it should become a little more obvious as we enter the primary algebra.
I will now give a reference version of the CSP-GSB axioms for the abstract calculus that is formally recognizable in several senses as giving form to propositional logic.
I will now give a reference version of the CSP–GSB axioms for the abstract calculus that is formally recognizable in several senses as giving form to propositional logic.
The first order of business is to give the exact forms of the axioms that I use, devolving from Peirce's "Logical Graphs" via Spencer-Brown's ''Laws of Form'' (LOF). In formal proofs, I will use a variation of the annotation scheme from LOF to mark each step of the proof according to which axiom, or ''initial'', is being invoked to justify the corresponding step of syntactic transformation, whether it applies to graphs or to strings.
The first order of business is to give the exact forms of the axioms that I use, devolving from Peirce's Logical Graphs via Spencer-Brown's ''Laws of Form'' (LOF). In formal proofs, I will use a variation of the annotation scheme from LOF to mark each step of the proof according to which axiom, or ''initial'', is being invoked to justify the corresponding step of syntactic transformation, whether it applies to graphs or to strings.
The axioms are just four in number, and they come in a couple of flavors: the ''arithmetic initials'' ''I''<sub>1</sub> and ''I''<sub>2</sub>, and the ''algebraic initials'' ''J''<sub>1</sub> and ''J''<sub>2</sub>.
The axioms are just four in number, and they come in a couple of flavors: the ''arithmetic initials'' <math>I_1~\!</math> and <math>I_2,~\!</math> and the ''algebraic initials'' <math>J_1~\!</math> and <math>J_2.~\!</math>
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_20.jpg|500px]]
| [[File:Logical_Graph_Figure_20.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_21.jpg|500px]]
| [[File:Logical_Graph_Figure_21.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_22.jpg|500px]]
| [[File:Logical_Graph_Figure_22.jpg|500px]]
|-
|-
| [[Image:Logical_Graph_Figure_23.jpg|500px]]
| [[File:Logical_Graph_Figure_23.jpg|500px]]
|}
|}
Notice that all of the axioms in this set have the form of equations. This means that all of the inference steps they allow are reversible. In the proof annotation scheme below, I will use a double bar "=====" to mark this fact, but I may at times leave it to the reader to pick which direction is the one required for applying the indicated axiom.
Notice that all of the axioms in this set have the form of equations. This means that all of the inference steps they allow are reversible. In the proof annotation scheme below, I will use a double bar <math>=~\!=~\!=~\!=~\!=</math> to mark this fact, but I may at times leave it to the reader to pick which direction is the one required for applying the indicated axiom.
==Frequently used theorems==
==Frequently used theorems==
===C<sub>1</sub>. Double negation theorem===
===C<sub>1</sub>. Double negation theorem===
The first theorem goes under the names of ''Consequence 1'' <math>(C_1)\!</math>, the ''double negation theorem'' (DNT), or ''Reflection''.
The first theorem goes under the names of ''Consequence 1'' <math>(C_1)~\!</math>, the ''double negation theorem'' (DNT), or ''Reflection''.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_24.jpg|500px]]
| [[File:Logical_Graph_Figure_24.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_25.jpg|500px]]
| [[File:Logical_Graph_Figure_25.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_26.jpg|500px]]
| [[File:Logical_Graph_Figure_26.jpg|500px]]
|}
|}
===C<sub>2</sub>. Generation theorem===
===C<sub>2</sub>. Generation theorem===
One theorem of frequent use goes under the nickname of the ''weed and seed theorem'' (WAST). The proof is just an exercise in mathematical induction, once a suitable basis is laid down, and it will be left as an exercise for the reader. What the WAST says is that a label can be freely distributed or freely erased anywhere in a subtree whose root is labeled with that label. The second in our list of frequently used theorems is in fact the base case of this weed and seed theorem. In LOF, it goes by the names of ''Consequence 2'' <math>(C_2)\!</math> or ''Generation''.
One theorem of frequent use goes under the nickname of the ''weed and seed theorem'' (WAST). The proof is just an exercise in mathematical induction, once a suitable basis is laid down, and it will be left as an exercise for the reader. What the WAST says is that a label can be freely distributed or freely erased anywhere in a subtree whose root is labeled with that label. The second in our list of frequently used theorems is in fact the base case of this weed and seed theorem. In LOF, it goes by the names of ''Consequence 2'' <math>(C_2)~\!</math> or ''Generation''.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_27.jpg|500px]]
| [[File:Logical_Graph_Figure_27.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_28.jpg|500px]]
| [[File:Logical_Graph_Figure_28.jpg|500px]]
|}
|}
: In: [http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104 FOLG]
: In: [http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104 FOLG]
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
What sorts of sign relation are implicated in this sign process? For simplicity, let's answer for the existential interpretation.
What sorts of sign relation are implicated in this sign process? For simplicity, let's answer for the existential interpretation.
In ''Ex'', all four of the listed signs are expressions of Falsity, and, viewed within the special type of semiotic procedure that is being considered here, each sign interprets its predecessor in the sequence. Thus we might begin by drawing up this Table:
In <math>\mathrm{Ex},</math> all four of the listed signs are expressions of Falsity, and, viewed within the special type of semiotic procedure that is being considered here, each sign interprets its predecessor in the sequence. Thus we might begin by drawing up this Table:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Let's take another look at the semiotic sequence associated with a logical evaluation and the corresponding sample of a sign relation that we were looking at last time.
Let's take another look at the semiotic sequence associated with a logical evaluation and the corresponding sample of a sign relation that we were looking at last time.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
|}
|}
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
The sign of equality "=", interpreted as logical equivalence "⇔", that marked our steps in the process of conducting the evaluation, is evidently intended to denote an equivalence relation, and this is a 2-adic relation that is reflexive, symmetric, and transitive. If we then pass to the reflexive, symmetric, transitive closure of the <''s'', ''i''> pairs that occur in our initial sample, attaching the constant reference to Falsity in the object domain, we will sweep out a more complete selection of the sign relation that inheres in the definition of the primary logical arithmetic.
The sign of equality "=", interpreted as logical equivalence "⇔", that marked our steps in the process of conducting the evaluation, is evidently intended to denote an equivalence relation, and this is a 2-adic relation that is reflexive, symmetric, and transitive. If we then pass to the reflexive, symmetric, transitive closure of the <''s'', ''i''> pairs that occur in our initial sample, attaching the constant reference to Falsity in the object domain, we will sweep out a more complete selection of the sign relation that inheres in the definition of the primary logical arithmetic.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Before we leave it for richer coasts — not to say we won't find ourselves returning eternally — let's note one other feature of our randomly chosen microcosm, one I suspect we'll see many echoes of in the macrocosm of our future wanderings.
Before we leave it for richer coasts — not to say we won't find ourselves returning eternally — let's note one other feature of our randomly chosen microcosm, one I suspect we'll see many echoes of in the macrocosm of our future wanderings.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
===C<sub>3</sub>. Dominant form theorem===
===C<sub>3</sub>. Dominant form theorem===
The third of the frequently used theorems of service to this survey is one that Spencer-Brown annotates as ''Consequence 3'' <math>(C_3)\!</math> or ''Integration''. A better mnemonic might be ''dominance and recession theorem'' (DART), but perhaps the brevity of ''dominant form theorem'' (DFT) is sufficient reminder of its double-edged role in proofs.
The third of the frequently used theorems of service to this survey is one that Spencer-Brown annotates as ''Consequence 3'' <math>(C_3)~\!</math> or ''Integration''. A better mnemonic might be ''dominance and recession theorem'' (DART), but perhaps the brevity of ''dominant form theorem'' (DFT) is sufficient reminder of its double-edged role in proofs.
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_29.jpg|500px]]
| [[File:Logical_Graph_Figure_29.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_30.jpg|500px]]
| [[File:Logical_Graph_Figure_30.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_31.jpg|500px]]
| [[File:Logical_Graph_Figure_31.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_32.jpg|500px]]
| [[File:Logical_Graph_Figure_32.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_33.jpg|500px]]
| [[File:Logical_Graph_Figure_33.jpg|500px]]
|}
|}
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_34.jpg|500px]]
| [[File:Logical_Graph_Figure_34.jpg|500px]]
|}
|}
For example, consider the following expression:
For example, consider the following expression:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
a a
o-----o
|
|
@
</pre>
</pre>
|}
|}
We may regard this algebraic expression as a general expression for an infinite set of arithmetic expressions, starting like so:
We may regard this algebraic expression as a general expression for an infinite set of arithmetic expressions, starting like so:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o o o o o o
| | \ / \ /
o o o o o o o o o o o o o o o o
| | \ / \ / | | \|/ \|/ | |
o-----o o-----o o-----o o-----o o-----o o-----o
| | | | | |
| | | | | |
@ @ @ @ @ @
</pre>
</pre>
|}
|}
Now consider what this says about the following algebraic law:
Now consider what this says about the following algebraic law:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
a a
o-----o
|
|
@ = @
</pre>
</pre>
|}
|}
To begin with a concrete case that's as easy as possible, let's examine this extremely simple algebraic expression:
To begin with a concrete case that's as easy as possible, let's examine this extremely simple algebraic expression:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
a
o
|
@
</pre>
</pre>
|}
|}
As we've already discussed, the algebraic variable name indicates the contemplated absence or presence of any arithmetic expression taking its place in the surrounding template, which expression is proxied well enough by its value, of which values we know but two. Thus, the given algebraic expression varies between these choices:
As we've already discussed, the algebraic variable name indicates the contemplated absence or presence of any arithmetic expression taking its place in the surrounding template, which expression is proxied well enough by its value, of which values we know but two. Thus, the given algebraic expression varies between these choices:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o
|
o o
| |
@ , @
</pre>
</pre>
|}
|}
We had been contemplating the penultimately simple algebraic expression "(a)" as a name for a set of arithmetic expressions, namely, (a) = {(), (())}, taking the equality sign in the appropriate sense.
We had been contemplating the penultimately simple algebraic expression "(a)" as a name for a set of arithmetic expressions, namely, (a) = {(), (())}, taking the equality sign in the appropriate sense.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o
a |
o o o
| | |
@ = { @ , @ }
</pre>
</pre>
|}
|}
Clearly, a variation between the absence and the presence of the operator "(_)" in the algebraic expression "(a)" refers to a variation between the algebraic expressions "a" and "(a)", respectively, somewhat as pictured here:
Clearly, a variation between the absence and the presence of the operator "(_)" in the algebraic expression "(a)" refers to a variation between the algebraic expressions "a" and "(a)", respectively, somewhat as pictured here:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
a a
o o
? a |
@ = { @ , @ }
</pre>
</pre>
|}
|}
Here is how we might suggest an algebraic expression of the form "(q)" where the absence or presence of the operator "(_)" depends on the value of the algebraic expression "p", the operator "(_)" being absent whenever p is unmarked and present when whenever p is marked.
Here is how we might suggest an algebraic expression of the form "(q)" where the absence or presence of the operator "(_)" depends on the value of the algebraic expression "p", the operator "(_)" being absent whenever p is unmarked and present when whenever p is marked.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
o---o
| q |
o---o = { q , (q) }
|
|
o
</pre>
</pre>
|}
|}
One of the other tactics of syntax that I tried at this time — somewhere in the 70's ... when did we quit using punchcards? — by way of porting operator variables into logical graphs and the laws of form, was to hollow out a leg of Spencer-Brown's crosses, gnomons, markers, whatever you call them, like this:
One of the other tactics of syntax that I tried at this time — somewhere in the 70's ... when did we quit using punchcards? — by way of porting operator variables into logical graphs and the laws of form, was to hollow out a leg of Spencer-Brown's crosses, gnomons, markers, whatever you call them, like this:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
----------o---o
| |
q | p | = { q , (q) }
| |
</pre>
</pre>
|}
|}
A funny thing just happened. Let's see if we can tell where. We started with the algebraic expression "(a)", in which the operand "a" suggests the contemplated absence or presence of any arithmetic expression or its value, then we contemplated the absence of presence of the operator "(_)" in "(a)" to be indicated by a cross or a space, respectively, for the value of a newly introduced variable, "b", placed in a new slot of a newly extended operator form, as suggested by this picture:
A funny thing just happened. Let's see if we can tell where. We started with the algebraic expression "(a)", in which the operand "a" suggests the contemplated absence or presence of any arithmetic expression or its value, then we contemplated the absence of presence of the operator "(_)" in "(a)" to be indicated by a cross or a space, respectively, for the value of a newly introduced variable, "b", placed in a new slot of a newly extended operator form, as suggested by this picture:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
----------o---o
| |
a | b |
| |
</pre>
</pre>
|}
|}
Writing out a formal operation table yields the following summary:
Writing out a formal operation table yields the following summary:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
|}
|}
* En, for which blank = false and cross = true, calls this "equivalence".
* <math>\mathrm{En},</math> for which blank = false and cross = true, calls this "equivalence".
* Ex, for which blank = true and cross = false, calls this "distinction".
* <math>\mathrm{Ex},</math> for which blank = true and cross = false, calls this "distinction".
The step of controlled reflection that we just took can be iterated just as far as we wish to take it, as suggested by the following set:
The step of controlled reflection that we just took can be iterated just as far as we wish to take it, as suggested by the following set:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
----------o
|
a |
|
----------o---o
| |
a | b |
| |
----------o---o---o
| | |
a | b | c |
| | |
----------o---o---o---o
| | | |
a | b | c | d |
| | | |
</pre>
</pre>
|}
|}
The following Table will suffice to suggest the syntactic correspondences among the "streamer-cross" forms that Peirce used in his essay on "Qualitative Logic" and Spencer Brown used in his book ''Laws of Form'', as they become extended by successive steps of controlled reflection, the plaintext string syntax, and the rooted cactus graphs:
The following Table will suffice to suggest the syntactic correspondences among the "streamer-cross" forms that Peirce used in his essay on "Qualitative Logic" and Spencer Brown used in his book ''Laws of Form'', as they become extended by successive steps of controlled reflection, the plaintext string syntax, and the rooted cactus graphs:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Let us examine the formal operation table for the next in our series of reflective operations to see if we can elicit the general pattern.
Let us examine the formal operation table for the next in our series of reflective operations to see if we can elicit the general pattern.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Or, thinking in terms of the graphic equivalents, writing "o" for a blank node and "|" for an edge:
Or, thinking in terms of the graphic equivalents, writing "o" for a blank node and "|" for an edge:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
The formal rule of evaluation for a "''k''-lobe" or "''k''-operator" is:
The formal rule of evaluation for a "''k''-lobe" or "''k''-operator" is:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
The interpretation of these operators, read as assertions about the values of their listed arguments, is as follows:
The interpretation of these operators, read as assertions about the values of their listed arguments, is as follows:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
==Case analysis-synthesis theorem==
==Case analysis-synthesis theorem==
===Discusssion===
The substance of this principle was known to Boole a sesquicentury ago, tantamount to the ''Boolean Expansion'' that he uncovered while nameless. So the only novelty here will rest in a certain manner of presentation, in which I will prove the basic principle from the axioms given before. One name for this rule is the ''Case Analysis-Synthesis Theorem'' (CAST).
The task at hand is build a bridge between model-theoretic and proof-theoretic perspectives on logical procedure, though for now we join them at a point so close to their common source that it may not seem worth the candle at all. The substance of this principle was known to Boole a sesquicentury ago, tantamount to the ''boolean expansion'' that he uncovered while nameless. So the only novelty here will rest in a certain manner of presentation, in which I will prove the basic principle from the axioms given before. One name for this rule is the ''Case Analysis-Synthesis Theorem'' (CAST).
The preparatory materials that we need are these:
The preparatory materials that we need are these:
I think that I am at long last ready to state the following:
I think that I am at long last ready to state the following:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
In order to think of tackling even the roughest sketch toward a proof of this theorem, we need to add a number of axioms and axiom schemata. Because I abandoned proof-theoretic purity somewhere in the middle of grinding this calculus into computational form, I never got around to finding the most elegant and minimal, or anything near a complete set of axioms for the ''cactus language'', so what I list here are just the slimmest rudiments of the hodge-podge of rules of thumb that I have found over time to be necessary and useful in most working settings. Some of these special precepts are probably provable from genuine axioms, but I have yet to go looking for a more proper formulation.
In order to think of tackling even the roughest sketch toward a proof of this theorem, we need to add a number of axioms and axiom schemata. Because I abandoned proof-theoretic purity somewhere in the middle of grinding this calculus into computational form, I never got around to finding the most elegant and minimal, or anything near a complete set of axioms for the ''cactus language'', so what I list here are just the slimmest rudiments of the hodge-podge of rules of thumb that I have found over time to be necessary and useful in most working settings. Some of these special precepts are probably provable from genuine axioms, but I have yet to go looking for a more proper formulation.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
Here is a proof sketch for the ''Case Analysis-Synthesis Theorem'' (CAST):
Here is a proof sketch for the ''Case Analysis-Synthesis Theorem'' (CAST):
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="10"
|
|
<pre>
<pre>
|}
|}
===Example===
Some of the jobs that the CAST can be usefully put to work on are proving propositional theorems and establishing equations between propositions. Once again, let us turn to the example of Leibniz's Praeclarum Theorema as a way of illustrating how. It will suffice to work within the Existential interpretation.
Some of the jobs that the CAST can be usefully put to work on are proving propositional theorems and establishing equations between propositions. Once again, let us turn to the example of Leibniz's Praeclarum Theorema as a way of illustrating how.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
|
{| align="center" cellpadding="0" 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"
|-
| Praeclarum Theorema. Proof by CAST. |
| [[File:Proof Praeclarum Theorema CAST 00.jpg|500px]]
|-
| |
| [[File:Proof Praeclarum Theorema CAST 01.jpg|500px]]
| b o o c o bc |
|-
| | | | |
| [[File:Equational Inference Bar -- Cast A.jpg|500px]]
| a o o d o ad |
|-
| \ / | |
| [[File:Proof Praeclarum Theorema CAST 02.jpg|500px]]
| o---------o |
|-
| | |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| | |
|-
| @ |
| [[File:Proof Praeclarum Theorema CAST 03.jpg|500px]]
| |
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| |
|-
| bc |
| [[File:Proof Praeclarum Theorema CAST 04.jpg|500px]]
| b o o c o bc b o o c o o |
|-
| | | | | | |/ |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| o o d o d o--o o d o d |
|-
| \ / | \ / | |
| [[File:Proof Praeclarum Theorema CAST 05.jpg|500px]]
| o-------o o-------o |
|-
| | | |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| | | |
|-
| a o-----------------------------o---o a |
| [[File:Proof Praeclarum Theorema CAST 06.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Cast D.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Proof Praeclarum Theorema CAST 07.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Proof Praeclarum Theorema CAST 08.jpg|500px]]
| @ |
|-
| |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| |
| [[File:Proof Praeclarum Theorema CAST 09.jpg|500px]]
| b o o c o bc o c o |
|-
| | | | | / |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| o o d o d o--o o d o |
|-
| \ / | \ / | |
| [[File:Proof Praeclarum Theorema CAST 10.jpg|500px]]
| o-------o o-------o |
|-
| | | |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| | | |
|-
| a o-----------------------------o---o a |
| [[File:Proof Praeclarum Theorema CAST 11.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Cast B.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Proof Praeclarum Theorema CAST 12.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Proof Praeclarum Theorema CAST 13.jpg|500px]]
| @ |
|-
| |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
|-
| |
| [[File:Proof Praeclarum Theorema CAST 14.jpg|500px]]
| b o o c o bc o c |
|-
| | | | | |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| o o d o d o d |
|-
| \ / | / |
| [[File:Proof Praeclarum Theorema CAST 15.jpg|500px]]
| o-------o o-------o |
|-
| | | |
| [[File:Equational Inference Bar -- Cast C ISW.jpg|500px]]
|-
| a o-----------------------------o---o a |
| [[File:Proof Praeclarum Theorema CAST 16.jpg|500px]]
| \ / |
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| \ / |
| [[File:Proof Praeclarum Theorema CAST 17.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof Praeclarum Theorema CAST 18.jpg|500px]]
|-
| |
| [[File:Equational Inference Bar -- QED.jpg|500px]]
|}
|}
The following Figure provides an animated recap of the graphical transformations that occur in the above proof:
{| align="center" cellpadding="8"
|
{| align="center" cellpadding="0" 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"
|-
| [[File:Praeclarum Theorema CAST 500 x 389 Animation.gif]]
|}
|}
What we have harvested is the succulent equivalent of a ''disjunctive normal form'' (DNF) for the proposition with which we started.
{| align="center" cellpadding="8"
| [[File:Praeclarum Theorema DNF.jpg|500px]]
|}
Remembering that a blank node is the graphical equivalent of a logical value <math>\mathrm{true},</math> the resulting DNF may be read as follows:
{| align="center" cellpadding="10" style="text-align:center; width:60%"
|
<pre>
o-----------------------------------------------------------o
| |
| |
| Either not 'a' and thus 'true' |
| Or 'a' and thus |
| Either not 'd' and thus 'true' |
| Or 'd' and thus |
| Either not 'b' and thus 'true' |
| Or 'b' and thus |
| Either not 'c' and thus 'true' |
| Or 'c' and thus true. |
| |
| |
o-----------------------------------------------------------o
</pre>
|}
That is tantamount to saying that the proposition being submitted for analysis is true in every case. Thus we are justified in awarding it the title of a ''Theorem''.
==Logic as sign transformation==
We have been looking at various ways of transforming propositional expressions, expressed in the parallel formats of character strings and graphical structures, all the while preserving certain aspects of their "meaning" — and here I risk using that vaguest of all possible words, but only as a promissory note, hopefully to be cached out in a more meaningful species of currency as the discussion develops.
I cannot pretend to be acquainted with or to comprehend every form of intension that others might find of interest in a given form of expression, nor can I speak for every form of meaning that another might find in a given form of syntax. The best that I can hope to do is to specify what my object is in using these expressions, and to say what aspects of their syntax are meant to serve this object, lending these properties the interest I have in preserving them as I put the expressions through the paces of their transformations.
On behalf of this object I have been spinning in the form of this thread a developing example base of propositional expressions, in the data structures of graphs and strings, along with many examples of step-wise transformations on these expressions that preserve something of significant logical import, something that might be referred to as their ''logical equivalence class'' (LEC), and that we could as well call the ''constraint information'' or the ''denotative object'' of the expression in view.
To focus still more, let's return to that ''Splendid Theorem'' noted by Leibniz, and let's look more carefully at the two distinct ways of transforming its initial expression that were used to arrive at an equivalent expression, each of which, in its own way, made its tautologous character, or its theorematic nature, as evident as it could be.
Just to remind you, here is the ''Splendid Theorem'' again:
{| align="center" cellpadding="10"
| [[File:Logical_Graph_Figure_33.jpg|500px]]
|}
{| align="center" cellpadding="10" width="90%"
| [[#Praeclarum theorema|The first way of transforming the expression]] that appears on the left hand side of the equation can be described as ''proof-theoretic'' in character.
|-
| [[#Praeclarum theorema : Proof by CAST|The second way of transforming the expression]] that appears on the left hand side of the equation can be described as ''model-theoretic'' in character.
|}
What we have here amounts to a couple of different styles of communicative conduct, that is, two sequences of signs of the form <math>e_1, e_2, \ldots, e_n,~\!</math> each one beginning with a problematic expression and eventually ending with a clear expression of the ''logical equivalence class'' to which every sign or expression in the sequence belongs. Ordinarily, any orbit through a locus of signs can be taken to reflect an underlying sign-process, a case of ''semiosis''. So what we have here are two very special cases of semiosis, and what we may find it useful to contemplate is how to characterize them as two species of a very general class. Ordinarily, any orbit through a locus of signs can be taken to reflect an underlying sign-process, a case of ''semiosis''. So what we have here are two very special cases of semiosis, and what we might just find it useful to contemplate is how to characterize them as two species of a very general class.
| \ / |
We are starting to delve into some fairly picayune details of a particular sign system, non-trivial enough in its own right but still rather simple compared to the types of our ultimate interest, and though I believe that this exercise will be worth the effort in prospect of understanding more complicated sign systems, I feel that I ought to say a few words about the larger reasons for going through this work.
My broader interest lies in the theory of inquiry as a special application or a special case of the theory of signs. Another name for the theory of inquiry is ''logic'' and another name for the theory of signs is ''semiotics''. So I might as well have said that I am interested in logic as a special application or a special case of semiotics. But what sort of a special application? What sort of a special case? Well, I think of logic as ''formal semiotics'' — though, of course, I am not the first to have said such a thing — and by ''formal'' we say, in our etymological way, that logic is concerned with the ''form'', indeed, with the ''animate beauty'' and the very ''life force'' of signs and sign actions. Yes, perhaps that is far too Latin a way of understanding logic, but it's all I've got.
Now, if you think about these things just a little more, I know that you will find them just a little suspicious, for what besides logic would I use to do this theory of signs that I would apply to this theory of inquiry that I'm also calling ''logic''? But that is precisely one of the things signified by the word ''formal'', for what I'd be required to use would have to be some brand of logic, that is, some sort of innate or inured skill at inquiry, but a style of logic that is casual, catch-as-catch-can, formative, incipient, inchoate, unformalized, a work in progress, partially built into our natural language and partially more primitive than our most artless language. In so far as I use it more than mention it, mention it more than describe it, and describe it more than fully formalize it, then to that extent it must be consigned to the realm of unformalized and unreflective logic, where some say "there be oracles", but I don't know.
Still, one of the aims of formalizing what acts of reasoning that we can is to draw them into an arena where we can examine them more carefully, perhaps to get better at their performance than we can unreflectively, and thus to live, to formalize again another day. Formalization is not the be-all end-all of human life, not by a long shot, but it has its uses on that behalf.
| |
| |
| b o o c o bc |
| | |
| |
| o o |
| | | |
| \ / |
What we have harvested is the succulent equivalent of a ''disjunctive normal form'' (DNF) for the proposition with which we started. Remembering that a blank node is the graphical equivalent of a logical value ''true'', we can read this brand of DNF in the following manner:
This looks like a good place to pause and take stock. The question arises: What's really going on here? There's all these signs, but what's the object? One object worth the candle is simply to study a non-trivial example of a syntactic system, simple in design but not entirely a toy, just to see how similar systems tick. More than that, we would like to understand how sign systems come to exist or come to be placed in relation to object systems, especially those types of object systems that give us compelling cause or independent reason to focus thought on. What is the utility of setting up sets of strings and sets of graphs, and sorting them according to their ''semiotic equivalence class'' (SEC) based on this or that abstract notion of transformational equivalence?
{| align="center" style="text-align:center; width:90%"
Good questions.
|
I can only begin to tackle these questions in the present frame of work, and I can't hope to answer them in anything like a satisfactory fashion. Still, it will serve to guide the work if we keep them in mind as we go.
If you will excuse the bits of autobio-graphical anecdotage, it will help me to reconstruct the steps that I actually took in my thinking as I worked through these problems about logical graphs late in the last millennium. By 1980 my logical graphs were becoming too large and complex to keep within the bounds of 2-dimensional manifolds of paper, and so I started to think once again, with extreme reluctance — given earlier traumatic experiences trying to use Fortran and a CDC 3600 mainframe to do my chem and physics lab work in an era when "turn-around time" was counted in days not microsecs — of representing logical graphs and logical transformations in the computer medium. By a bit of serendipity that still amazes me, it happened that my earlier work on Peirce's use of operator variables, that led in its turn to my discovery of the cactus language, also turned out to provide workable solutions for several problems that arose in the process of trying to find efficient implementations for logical graphs and their logical transformations.
For example, consider the existential graph for <math>p \Leftrightarrow q</math> that is shown below:
{| align="center" cellpadding="10"
|
<pre>
<pre>
o-----------------------------------------------------------o
| |
o-----------------o o-----------------o
| o-------o | | o-------o |
| \ / |
| | | | | | | |
| p | q | | | q | p | |
| | | | | | | |
| o-------o | | o-------o |
| \ / |
o-----------------o o-----------------o
| a o---o---o a |
| \ / |
| @ |
| |
| |
| Or 'a' and thus |
| Either not 'd' and thus 'true' |
| Or 'd' and thus |
| Either not 'b' and thus 'true' |
| Or 'b' and thus |
| Or 'c' and thus true. |
| |
o-----------------------------------------------------------o
</pre>
</pre>
|}
|}
This is tantamount to saying that the proposition being submitted for analysis is true in each case. Ergo we are justly entitled to title it ''Theorem''.
This can be read as <math>{}^{\backprime\backprime} \mathrm{not}~ p ~\mathrm{without}~ q ~\mathrm{and~not}~ q ~\mathrm{without}~ p {}^{\prime\prime},</math> in symbols, <math>(p \Rightarrow q) \land (q \Rightarrow p).</math>
Graphing the topological dual form, one obtains the following rooted tree:
{| align="center" cellpadding="10"
|
<pre>
q o o p
| |
p o o q
\ /
@
(p (q)) (q (p))
</pre>
|}
Now it is not the sort of thing that I ever noticed until it came time to program a theorem prover for logical graphs at Peirce's alpha level, but expressions like these, that mention each variable twice simply in order to express a basic 2-variate operator, are extremely inefficient forms of representation, and their use is enough to bog down a routine logical modeler or an automatic theorem prover in a slough of despond.
However, the cactus graph expression for equivalence works much better:
{| align="center" cellpadding="10"
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_33.jpg|500px]]
|
<pre>
p o---o q
\ /
o
|
@
((p , q))
</pre>
|}
|}
The first way of transforming the expression that appears on the left hand side of the equation can be described as ''proof-theoretic'' in character. This appeared in Note 35.
The cactus language syntax also improves the ''reflective capacities'' of the logical calculus, in particular, it facilitates our ability to use the calculus to reflect on the process of proof, that is, the process of establishing equivalences between expressions.
==Analysis of contingent propositions==
For all of the reasons mentioned above, and for the sake of a more compact illustration of the ins and outs of a typical propositional equation reasoning system, let's now take up a much simpler example of a contingent proposition:
{| align="center" cellpadding="8"
| [[File:Logical Graph (P (Q)) (P (R)).jpg|500px]] || (26)
|}
For the sake of simplicity in discussing this example, let's stick with the existential interpretation (<math>\mathrm{Ex}~\!</math>) of logical graphs and their corresponding parse strings. Under <math>\mathrm{Ex}~\!</math> the formal expression <math>{\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}}~\!</math> translates into the vernacular expression <math>{}^{\backprime\backprime} p ~\mathrm{implies}~ q ~\mathrm{and}~ p ~\mathrm{implies}~ r {}^{\prime\prime},</math> in symbols, <math>(p \Rightarrow q) \land (p \Rightarrow r),</math> so this is the reading that we'll want to keep in mind for the present. Where brevity is required, we may refer to the propositional expression <math>{\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}}~\!</math> under the name <math>f~\!</math> by making use of the following definition:
{| align="center" cellpadding="8"
| <math>f ~=~ \texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}~\!</math>
|}
Since the expression <math>{\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}}~\!</math> involves just three variables, it may be worth the trouble to draw a venn diagram of the situation. There are in fact two different ways to execute the picture.
Figure 27 indicates the points of the universe of discourse <math>X~\!</math> for which the proposition <math>f : X \to \mathbb{B}</math> has the value 1, here interpreted as the logical value <math>\mathrm{true}.</math> In this ''paint by numbers'' style of picture, one simply paints over the cells of a generic template for the universe <math>X,~\!</math> going according to some previously adopted convention, for instance: Let the cells that get the value 0 under <math>f~\!</math> remain untinted and let the cells that get the value 1 under <math>f~\!</math> be painted or shaded. In doing this, it may be good to remind ourselves that the value of the picture as a whole is not in the ''paints'', in other words, the <math>0, 1~\!</math> in <math>\mathbb{B},</math> but in the pattern of regions that they indicate.
{| align="center" cellpadding="8" style="text-align:center"
| [[File:Venn Diagram (P (Q)) (P (R)).jpg|500px]] || (27)
|-
| <math>\text{Venn Diagram for}~ \texttt{(} p \texttt{~(} q \texttt{))~(} p \texttt{~(} r \texttt{))}</math>
|}
There are a number of standard ways in mathematics and statistics for talking about the subset <math>W~\!</math> of the functional domain <math>X~\!</math> that gets painted with the value <math>z \in \mathbb{B}</math> by the indicator function <math>f : X \to \mathbb{B}.</math> The region <math>W \subseteq X</math> is called by a variety of names in different settings, for example, the ''antecedent'', the ''fiber'', the ''inverse image'', the ''level set'', or the ''pre-image'' in <math>X~\!</math> of <math>z~\!</math> under <math>f.~\!</math> It is notated and defined as <math>W = f^{-1}(z).~\!</math> Here, <math>f^{-1}~\!</math> is called the ''converse relation'' or the ''inverse relation'' — it is not in general an inverse function — corresponding to the function <math>f.~\!</math> Whenever possible in simple examples, we use lower case letters for functions <math>f : X \to \mathbb{B},</math> and it is sometimes useful to employ capital letters for subsets of <math>X,~\!</math> if possible, in such a way that <math>F~\!</math> is the fiber of 1 under <math>f,~\!</math> in other words, <math>F = f^{-1}(1).~\!</math>
The easiest way to see the sense of the venn diagram is to notice that the expression <math>\texttt{(} p \texttt{(} q \texttt{))},</math> read as <math>p \Rightarrow q,</math> can also be read as <math>{}^{\backprime\backprime} \mathrm{not}~ p ~\mathrm{without}~ q {}^{\prime\prime}.</math> Its assertion effectively excludes any tincture of truth from the region of <math>P~\!</math> that lies outside the region <math>Q.~\!</math> In a similar manner, the expression <math>\texttt{(} p \texttt{(} r \texttt{))},</math> read as <math>p \Rightarrow r,</math> can also be read as <math>{}^{\backprime\backprime} \mathrm{not}~ p ~\mathrm{without}~ r {}^{\prime\prime}.</math> Asserting it effectively excludes any tincture of truth from the region of <math>P~\!</math> that lies outside the region <math>R.~\!</math>
Figure 28 shows the other standard way of drawing a venn diagram for such a proposition. In this ''punctured soap film'' style of picture — others may elect to give it the more dignified title of a ''logical quotient topology'' — one begins with Figure 27 and then proceeds to collapse the fiber of 0 under <math>X~\!</math> down to the point of vanishing utterly from the realm of active contemplation, arriving at the following picture:
{| align="center" cellpadding="8" style="text-align:center"
| [[File:Venn Diagram (P (Q R)).jpg|500px]] || (28)
|-
| <math>\text{Venn Diagram for}~ \texttt{(} p \texttt{~(} q ~ r \texttt{))}</math>
|}
This diagram indicates that the region where <math>p~\!</math> is true is wholly contained in the region where both <math>q~\!</math> and <math>r~\!</math> are true. Since only the regions that are painted true in the previous figure show up at all in this one, it is no longer necessary to distinguish the fiber of 1 under <math>f~\!</math> by means of any shading.
In sum, it is immediately obvious from the venn diagram that in drawing a representation of the following propositional expression:
{| align="center" cellpadding="8"
| <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))},</math>
|}
in other words,
{| align="center" cellpadding="8"
| <math>(p \Rightarrow q) \land (p \Rightarrow r),</math>
|}
we are also looking at a picture of:
{| align="center" cellpadding="8"
| <math>\texttt{(} p \texttt{(} q r \texttt{))},</math>
|}
in other words,
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
| <math>p \Rightarrow (q \land r).</math>
<pre>
</pre>
|}
|}
Let us now examine the following propositional equation:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
| [[File:Logical Graph (P (Q)) (P (R)) = (P (Q R)).jpg|500px]] || (29)
|}
|}
There are three distinct ways that I can think of right off as to how we might go about formally proving or systematically checking the proposed equivalence, the evidence of whose truth we already have before us clearly enough, and in a visually intuitive form, from the venn diagrams that we examined above.
While we go through each of these ways let us keep one eye out for the character and the conduct of each type of proceeding as a semiotic process, that is, as an orbit, in this case discrete, through a locus of signs, in this case propositional expressions, and as it happens in this case, a sequence of transformations that perseveres in the denotative objective of each expression, that is, in the abstract proposition that it expresses, while it preserves the informed constraint on the universe of discourse that gives us one viable candidate for the informational content of each expression in the interpretive chain of sign metamorphoses.
{| align="center" style="text-align:center; width:90%"
A ''sign relation'' <math>L~\!</math> is a subset of a cartesian product <math>O \times S \times I,</math> where <math>{O, S, I}~\!</math> are sets known as the ''object'', ''sign'', and ''interpretant sign'' domains, respectively. These facts are symbolized by writing <math>L \subseteq O \times S \times I.</math> Accordingly, a sign relation <math>L~\!</math> consists of ordered triples of the form <math>(o, s, i),~\!</math> where <math>o, s, i~\!</math> belong to the domains <math>{O, S, I},~\!</math> respectively. An ordered triple of the form <math>(o, s, i) \in L</math> is referred to as a ''sign triple'' or an ''elementary sign relation''.
<pre>
</pre>
The cactus language syntax also improves the ''reflective capacities'' of the logical calculus, in particular, it facilitates our ability to use the calculus to reflect on the process of proof, that is, the process of establishing equivalences between expressions.
The ''syntactic domain'' of a sign relation <math>L \subseteq O \times S \times I</math> is defined as the set-theoretic union <math>S \cup I</math> of its sign domain <math>S~\!</math> and its interpretant domain <math>I.~\!</math> It is not uncommon, especially in formal examples, for the sign domain and the interpretant domain to be equal as sets, in short, to have <math>S = I.~\!</math>
Sign relations may contain any number of sign triples, finite or infinite. Finite sign relations do arise in applications and can be very instructive as expository examples, but most of the sign relations of significance in logic have infinite sign and interpretant domains, and usually infinite object domains, in the long run, at least, though one frequently works up to infinite domains by a series of finite approximations and gradual stages.
With that preamble behind us, let us turn to consider the case of semiosis, or sign transformation process, that is generated by our first proof of the propositional equation <math>E_1.~\!</math>
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
| [[File:Logical Graph (P (Q)) (P (R)) = (P (Q R)) Proof 1.jpg|500px]]
| (30)
| |
|}
|}
For the sake of simplicity in discussing this example, I will revert to the ''existential interpretation'' (''Ex'') of logical graphs and their corresponding parse strings.
For some reason I always think of this as the way that our DNA would prove it.
We are in the process of examining various proofs of the propositional equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))},</math> and viewing these proofs in the light of their character as semiotic processes, in essence, as sign-theoretic transformations.
The second way of establishing the truth of this equation is one that I see, rather loosely, as ''model-theoretic'', for no better reason than the sense of its ending with a pattern of expression, a variant of the ''disjunctive normal form'' (DNF), that is commonly recognized to be the form that one extracts from a truth table by pulling out the rows of the table that evaluate to true and constructing the disjunctive expression that sums up the senses of the corresponding interpretations.
In order to apply this model-theoretic method to an equation between a couple of contingent expressions, one must transform each expression into its associated DNF and then compare those to see if they are equal. In the current setting, these DNF's may indeed end up as identical expressions, but it is possible, also, for them to turn out slightly off-kilter from each other, and so the ultimate comparison may not be absolutely immediate. The explanation of this is that, for the sake of computational efficiency, it is useful to tailor the DNF that gets developed as the output of a DNF algorithm to the particular form of the propositional expression that is given as input.
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
|
{| align="center" cellpadding="0" 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"
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-0.jpg|500px]]
| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` ` ` ` `o-------------o` ` ` ` ` ` ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-1.jpg|500px]]
| ` ` ` ` ` ` ` ` ` ` / \ ` ` ` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` ` ` `/ \` ` ` ` ` ` ` ` ` ` |
| [[File:Equational Inference Bar -- Cast P.jpg|500px]]
| ` ` ` ` ` ` ` ` ` / \ ` ` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` ` `/ \` ` ` ` ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-2.jpg|500px]]
| ` ` ` ` ` ` ` ` / \ ` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` `o o` ` ` ` ` ` ` ` |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| ` ` ` ` ` ` ` `| |` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` `| P |` ` ` ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-3.jpg|500px]]
| ` ` ` ` ` ` ` `| |` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` `| |` ` ` ` ` ` ` ` |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| ` ` ` ` ` ` ` `| |` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` o--o----------o o----------o--o ` ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-4.jpg|500px]]
| ` ` ` ` ` `/` ` \ \ / / ` `\` ` ` ` ` ` |
|-
| ` ` ` ` ` / ` ` `\ o /` ` ` \ ` ` ` ` ` |
| [[File:Equational Inference Bar -- Cast Q.jpg|500px]]
| ` ` ` ` `/` ` ` ` \ /`\ / ` ` ` `\` ` ` ` ` |
|-
| ` ` ` ` / ` ` ` ` `\ / ` \ /` ` ` ` ` \ ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-5.jpg|500px]]
| ` ` ` `/` ` ` ` ` ` \ /` ` `\ / ` ` ` ` ` `\` ` ` ` |
|-
| ` ` ` o ` ` ` ` ` ` `o--o-------o--o` ` ` ` ` ` ` o ` ` ` |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` |
|-
| ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-6.jpg|500px]]
| ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` |
|-
| ` ` ` | ` ` ` Q ` ` ` ` | ` ` ` | ` ` ` ` R ` ` ` | ` ` ` |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` | ` ` ` ` ` ` ` ` | ` ` ` |
|-
| ` ` ` o ` ` ` ` ` ` ` ` o ` ` ` o ` ` ` ` ` ` ` ` o ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-7.jpg|500px]]
| ` ` ` `\` ` ` ` ` ` ` ` `\` ` `/` ` ` ` ` ` ` ` `/` ` ` ` |
|-
| ` ` ` ` \ ` ` ` ` ` ` ` ` \ ` / ` ` ` ` ` ` ` ` / ` ` ` ` |
| [[File:Equational Inference Bar -- Cast R.jpg|500px]]
| ` ` ` ` `\` ` ` ` ` ` ` ` `\`/` ` ` ` ` ` ` ` `/` ` ` ` ` |
|-
| ` ` ` ` ` \ ` ` ` ` ` ` ` ` o ` ` ` ` ` ` ` ` / ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-8.jpg|500px]]
| ` ` ` ` ` `\` ` ` ` ` ` ` `/`\` ` ` ` ` ` ` `/` ` ` ` ` ` |
|-
| ` ` ` ` ` ` o-------------o ` o-------------o ` ` ` ` ` ` |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
|-
| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-1-9.jpg|500px]]
|-
| [[File:Equational Inference Bar -- DNF.jpg|500px]]
|}
| (31)
|}
|}
The final graph in the sequence of equivalents is a disjunctive normal form (DNF) for the proposition on the left hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}.</math>
{| align="center" cellpadding="8"
| [[File:Logical Graph (P (Q)) (P (R)) DNF.jpg|500px]]
| (32)
|}
Remembering that a blank node is the graphical equivalent of a logical value <math>\mathrm{true},</math> the resulting DNF may be read as follows:
{| align="center" cellpadding="8" style="text-align:center; width:60%"
{| align="center" style="text-align:center; width:90%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
| |
| Either not 'p' and thus 'true' |
| o-------------o o-------------o |
| Or 'p' and thus |
| / \ / \ |
| Either not 'q' and thus 'false' |
| Or 'q' and thus |
| Either not 'r' and thus 'false' |
| Or 'r' and thus 'true'. |
| o o-------o o |
| \ \ / / |
| o-------------o o-------------o |
| |
| |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
</pre>
</pre>
|}
|}
It remains to show that the right hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}</math> is logically equivalent to the DNF just obtained. The needed chain of equations is as follows:
{| align="center" cellpadding="8"
|
{| align="center" cellpadding="0" 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"
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-0.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-1.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cast P.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-2 ISW.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-3.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-4.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cast Q.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-5.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-6 ISW.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-7.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cast R.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-8.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 2-2-9.jpg|500px]]
|-
| [[File:Equational Inference Bar -- DNF.jpg|500px]]
|}
| (33)
|}
This is not only a logically equivalent DNF but exactly the same DNF expression that we obtained before, so we have established the given equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}.</math> Incidentally, one may wish to note that this DNF expression quickly folds into the following form:
{| align="center" cellpadding="8"
| [[File:Logical Graph (P Q R , (P)).jpg|500px]] || (34)
|}
This can be read to say <math>{}^{\backprime\backprime} \mathrm{either}~ p q r ~\mathrm{or}~ \mathrm{not}~ p {}^{\prime\prime},</math> which gives us yet another equivalent for the expression <math>{\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}}~\!</math> and the expression <math>\texttt{(} p \texttt{(} q r \texttt{))}.</math> Still another way of writing the same thing would be as follows:
{| align="center" cellpadding="8"
| [[File:Logical Graph ((P , P Q R)).jpg|500px]] || (35)
: (p (q r)),
|}
In other words, <math>{}^{\backprime\backprime} p ~\mathrm{is~equivalent~to}~ p ~\mathrm{and}~ q ~\mathrm{and}~ r {}^{\prime\prime}.</math>
One lemma that suggests itself at this point is a principle that may be canonized as the ''Emptiness Rule''. It says that a bare lobe expression like <math>\texttt{( \_, \_, \ldots )},</math> with any number of places for arguments but nothing but blanks as filler, is logically tantamount to the proto-typical expression of its type, namely, the constant expression <math>\texttt{(~)}</math> that <math>\mathrm{Ex}~\!</math> interprets as denoting the logical value <math>\mathrm{false}.</math> To depict the rule in graphical form, we have the continuing sequence of equations:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8" style="text-align:center; width:60%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| Equation E_1 |
| Emptiness Rule |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
| q r |
| o o---o o-o-o |
| | \ / \ / |
| @ = @ = @ = ... |
| \ / | |
| @ = @ |
| |
| |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
</pre>
</pre>
| (36)
|}
|}
Yet another rule that we'll need is the following:
{| align="center" cellpadding="8" style="text-align:center; width:60%"
{| align="center" style="text-align:center; width:90%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| Equation E_1. Proof 1. |
| Indistinctness Rule |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
| a a a a a |
| o o---o o-o-o |
| | \ / \ / |
| @ = @ = @ = ... |
| |
| |
o-----------------------------------------------------------o
</pre>
</pre>
| (37)
|}
|}
This one is easy enough to derive from rules that are already known, but just for the sake of ready reference it is useful to canonize it as the ''Indistinctness Rule''. Finally, let me introduce a rule-of-thumb that is a bit more suited to routine computation, and that serves to replace the indistinctness rule in many cases where we actually have to call on it. This is actually just a special case of the evaluation rule listed above:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8" style="text-align:center; width:60%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| Equation E_1 |
| Evaluation Rule |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
| q r |
| o |
| q o o r o |
| | x_2 ... x_k |
| | | | |
| o---o-...-o---o |
| p o o p p o |
| \ / |
| \ / | |
| \ / |
| @ = @ |
| \ / |
| |
| \ / |
| \ / |
| \ / x_2 ... x_k |
| @ = @ |
| |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
| (p (q)) (p (r)) = (p (q r)) |
| ((), x_2, ..., x_k) = x_2 ... x_k |
| |
| |
o-----------------------------------------------------------o
| Setup <---- | ----> Spike |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
</pre>
</pre>
| (38)
|}
|}
To continue with the beating of this still-kicking horse in the form of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))},</math> let's now take up the third way that I mentioned for examining propositional equations, even if it is literally a third way only at the very outset, almost immediately breaking up according to whether one proceeds by way of the more routine model-theoretic path or else by way of the more strategic proof-theoretic path.
Let's convert the equation between propositions:
{| align="center" cellpadding="8"
|
<math>\begin{matrix}
\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))}
& = &
\texttt{(} p \texttt{(} q r \texttt{))}
\end{matrix}</math>
|}
into the corresponding equational proposition:
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
|
<pre>
<math>\begin{matrix}
\texttt{((}
&
\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \text{))}
& \texttt{,} &
\texttt{(} p \texttt{(} q r \texttt{))}
&
\texttt{))}
\end{matrix}</math>
|}
If you're like me, you'd rather see it in pictures:
{| align="center" cellpadding="8"
| [[File:Logical Graph (( (P (Q)) (P (R)) , (P (Q R)) )).jpg|500px]]
| (39)
| |
| p o-------o---o p |
| |
| @ |
|}
|}
We may now interrogate the alleged equation for the third time, working by way of the ''case analysis-synthesis theorem'' (CAST).
{| align="center" style="text-align:center; width:90%"
{| align="center" cellpadding="8"
|
|
{| align="center" cellpadding="0" 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"
|-
| DNF of "(p (q))(p (r))" |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-00.jpg|500px]]
|-
| |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-01.jpg|500px]]
| o |
|-
| | |
| [[File:Equational Inference Bar -- Cast P.jpg|500px]]
| r o-------o---o r |
|-
| \ / |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-02.jpg|500px]]
| \ / o |
|-
| \ / | |
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
| q o-------o---o q |
|-
| \ / |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-03.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| p o-------o---o p |
|-
| \ / |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-04.jpg|500px]]
| \ / |
|-
| \ / |
| [[File:Equational Inference Bar -- Emptiness.jpg|500px]]
| @ |
|-
| |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-05.jpg|500px]]
|-
| |
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
| Either not 'p' and thus 'true' |
|-
| Or 'p' and thus |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-06.jpg|500px]]
| Either not 'q' and thus 'false' |
|-
| Or 'q' and thus |
| [[File:Equational Inference Bar -- Cast Q.jpg|500px]]
| Either not 'r' and thus 'false' |
|-
| Or 'r' and thus 'true'. |
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-07.jpg|500px]]
| |
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-08.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Domination ISW.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-09.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-10.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Spike.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-11.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-12.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cast R.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-13.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-14 ISW.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Emptiness.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-15.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Spike.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-16.jpg|500px]]
|-
| [[File:Equational Inference Bar -- Cancellation.jpg|500px]]
|-
| [[File:Proof (P (Q)) (P (R)) = (P (Q R)) 3-17.jpg|500px]]
|-
| [[File:Equational Inference Bar -- QED.jpg|500px]]
|}
| (40)
|}
|}
And that, of course, is the DNF of a theorem.
==Proof as semiosis==
We have been looking at several different ways of proving one particular example of a propositional equation, and along the way we have been exemplifying the species of sign transforming process that is commonly known as a ''proof'', more specifically, an equational proof of the propositional equation in question.
Let us now draw out these semiotic features of the business of proof and place them in relief.
Our syntactic domain !S! contains an infinite number of signs or expressions, any of which we may choose to view in either a string form or a graphic form, glossing over for now the many details of their particular correspondence.
Here are some of the expressions that we find salient enough to single out and confer an epithetic nickname on:
: ''e''<sub>0</sub> = "()"
: ''e''<sub>1</sub> = " "
: ''e''<sub>2</sub> = "(p (q))(p (r))"
<pre>
: ''e''<sub>3</sub> = "(p (q r))"
: ''e''<sub>4</sub> = "(p q r, (p))"
: ''e''<sub>5</sub> = "(( (p (q))(p (r)) , (p (q r)) ))"
<pre>
Under <math>\mathrm{Ex}~\!</math> we have the following interpretations:
: ''e''<sub>0</sub> expresses the logical constant "false"
</pre>
: ''e''<sub>1</sub> expresses the logical constant "true"
: ''e''<sub>2</sub> says "not p without q, and not p without r"
: ''e''<sub>3</sub> says "not p without q and r"
<pre>
: ''e''<sub>4</sub> says "p and q and r, or else not p"
: ''e''<sub>5</sub> says that e_2 and e_3 say the same thing
We took up the Equation ''E''<sub>1</sub> that reads as follows:
<pre>
</pre>
: (p (q))(p (r)) = (p (q r)).
Each of our proofs is a finite sequence of signs, and thus, for a finite integer n, takes the form:
: ''s''<sub>1</sub>, ''s''<sub>2</sub>, ''s''<sub>3</sub>, …, ''s''<sub>''n''</sub>.
Proof 1 proceeded by the straightforward approach, starting with ''e''<sub>2</sub> as ''s''<sub>1</sub> and ending with ''e''<sub>3</sub> as ''s''<sub>''n''</sub>. That is, it commenced from the sign "(p (q))(p (r))" and ended up at the sign "(p (q r))" by legal moves.
Proof 2 lit on by burning the candle at both ends, changing ''e''<sub>2</sub> into a normal form that reduced to ''e''<sub>4</sub>, changing ''e''<sub>3</sub> into a normal form that reduced to e_4, in this way tethering ''e''<sub>2</sub> and ''e''<sub>3</sub> to a common point. We got that (p (q))(p (r)) is equal to (p q r, (p)), then we got that (p (q r)) is equal to (p q r, (p)), so we got that (p (q))(p (r)) is equal to (p (q r)).
<pre>
Proof 3 took the path of reflection, expressing the meta-equation between ''e''<sub>2</sub> and ''e''<sub>3</sub> via the object equation ''e''<sub>5</sub>, then taking ''e''<sub>5</sub> as ''s''<sub>1</sub> and exchanging it by dint of value preserving steps for ''e''<sub>1</sub> as ''s''<sub>''n''</sub>. Thus we went from "(( (p (q))(p (r)) , (p (q r)) ))" to the blank expression that <math>\mathrm{Ex}~\!</math> recognizes as true.
I need to say something about the concept of ''reflection'' that I've been using according to my informal intuitions about it at numerous points in this discussion. This is, of course, distinct from the use of the word "reflection" to license an application of the double negation theorem.
Generally speaking, I think of reflection in connection with any sort of system that has any sort of order relation defined on it, and I think of the system in question as manifesting "reflection" in proportion to the extent that statements about that order can be found to be reflected in elements of that order. Accordingly, it must be possible to interpret certain elements of the ordered system as making statements about the order in which they reside.
More on that later, as many delightful distractions take their precedence in the order of the day.
Still speaking generally, the hermeneutic hedge about reflection that runs, "it must be possible to interpret certain elements of the ordered system as making statements about the order in which they reside", should serve to remind us of the hidden catch that the forms of interpretation that manifest reflection of an order on itself may not be obvious at first sight, but will in general have to be sought out by abductive reason, "by hook or by crook".
But speaking more specifically about orders of systems so simple as alpha graphs, propositional calculus, zeroth order logic, and their ilk, we find at least some modes of reflection that strike the mind's eye right off as being manifestly natural and obvious.
For instance, propositions over a finitary universe of discourse, of the order that we see illustrated in euler-venn diagrams, are ordered by the relation of implication, making "⇒" analogous to the generic order relation "less than or equal to", notated "<u><</u>".
But those statements about the implicational order relation that take the form "p ⇒ q" are themselves statements that have their place within that very same implicational order relation. Hence, propositional logic has a moderate degree of reflective capacity.
Viewing relations of distinction and equivalence as special cases of order relations, a measure of reflection with respect to these types of relation is a way of turning some of the statements that we might make about difference or equality of elements in a given ordered system into elements residing within that very same order.
Ordinary propositional calculus, in whatever brand of syntax is adequate to its tasks, will enjoy this type of reflection, since statements about equivalence or inequivalence, taking the shapes "p ⇔ q" or "p <≠> q", respectively, will themselves be statements that fall within the purview of its propositional order.
Ordinary propositional calculus, in whatever brand of syntax is adequate to its tasks, will enjoy this type of reflection, since statements about equivalence or inequivalence, taking the shapes "p ⇔ q" or "p <≠> q", respectively, will themselves be statements that fall within the purview of its propositional order.
In the light of this reflection on distinction and equivalence, however, we have already observed that some styles of syntactic calculi are more direct, efficient, flexible, and succinct than others in the expression of logical differences and equations, and it's a curious fact that both Peirce's alpha graphs and Spencer-Brown's primary algebra, in which the roles of distinctions and equational inferences are so paramount, don't afford us better expressions of logical difference and logical equality.
In the light of this reflection on distinction and equivalence, however, we have already observed that some styles of syntactic calculi are more direct, efficient, flexible, and succinct than others in the expression of logical differences and equations, and it's a curious fact that both Peirce's alpha graphs and Spencer-Brown's primary algebra, in which the roles of distinctions and equational inferences are so paramount, don't afford us better expressions of logical difference and logical equality.
* [[Charles Sanders Peirce|Peirce, C.S.]], [[Charles Sanders Peirce (Bibliography)|Bibliography]].
* [[Charles Sanders Peirce|Peirce, C.S.]], [[Charles Sanders Peirce (Bibliography)|Bibliography]].
* Peirce, C.S. (1902), [Application to the Carnegie Institution] (L 75), pp. 13–73 in ''The New Elements of Mathematics by Charles S. Peirce, Volume 4, Mathematical Philosophy'', Carolyn Eisele (ed.), Mouton, The Hague, 1976. [http://www.cspeirce.com/menu/library/bycsp/l75/l75.htm Eprint].
* Peirce, C.S. (1902), [Application to the Carnegie Institution] (L 75), pp. 13–73 in ''The New Elements of Mathematics by Charles S. Peirce, Volume 4, Mathematical Philosophy'', Carolyn Eisele (ed.), Mouton, The Hague, 1976. [http://www.cspeirce.com/menu/library/bycsp/l75/l75.htm Online].
* Peirce, C.S. (c. 1903), "Logical Tracts, No. 2", in ''Collected Papers'', CP 4.418–509. [http://www.existentialgraphs.com/peirceoneg/existentialgraphs4.418-529.htm Eprint].
* Peirce, C.S. (c. 1903), “Logical Tracts, No. 2”, in ''Collected Papers'', CP 4.418–509. [http://www.existentialgraphs.com/peirceoneg/existentialgraphs4.418-529.htm Online].
==See also==
==See also==
===Related essays and projects===
===Related essays and projects===
* [[Information Equals Comprehension Times Extension|Information = Comprehension × Extension]]
{{col-begin}}
* [[Inquiry Driven Systems]]
{{col-break}}
* [[Cactus Language]]
* [[Semiotic Information]]
* [[Peirce's Logic Of Information]]
* [[Peirce's 1870 Logic Of Relatives]]
* [[Information = Comprehension × Extension]]
{{col-break}}
* [[Introduction to Inquiry Driven Systems]]
* [[Introduction to Inquiry Driven Systems]]
* [[Peirce’s Logic Of Information]]
* [[Prospects for Inquiry Driven Systems]]
* [[Inquiry Driven Systems|Inquiry Driven Systems : Inquiry Into Inquiry]]
* [[Propositional Equation Reasoning Systems]]
* [[Propositional Equation Reasoning Systems]]
* [[Semiotic Theory Of Information]]
* [[Differential Logic : Introduction]]
{{col-end}}
===Related concepts and topics===
===Related concepts and topics===
==Document history==
==Document history==
===Futures Of Logical Graphs (2005)===
===2005 • Inquiry List • Futures Of Logical Graphs • Exposition===
* http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104
* http://web.archive.org/web/20150224133200/http://stderr.org/pipermail/inquiry/2005-October/thread.html#3104
* http://web.archive.org/web/20140930152003/http://stderr.org/pipermail/inquiry/2005-November/thread.html#3165
# http://stderr.org/pipermail/inquiry/2005-October/003105.html
# http://stderr.org/pipermail/inquiry/2005-November/003170.html
# http://web.archive.org/web/20120204201818/http://stderr.org/pipermail/inquiry/2005-October/003104.html
# http://web.archive.org/web/20120204201435/http://stderr.org/pipermail/inquiry/2005-October/003105.html
# http://web.archive.org/web/20120204201443/http://stderr.org/pipermail/inquiry/2005-October/003106.html
# http://web.archive.org/web/20120204201301/http://stderr.org/pipermail/inquiry/2005-October/003107.html
# http://web.archive.org/web/20120206123011/http://stderr.org/pipermail/inquiry/2005-October/003113.html
# http://web.archive.org/web/20120206122552/http://stderr.org/pipermail/inquiry/2005-October/003114.html
# http://web.archive.org/web/20120206122844/http://stderr.org/pipermail/inquiry/2005-October/003115.html
# http://web.archive.org/web/20120206122814/http://stderr.org/pipermail/inquiry/2005-October/003118.html
# http://web.archive.org/web/20120204201627/http://stderr.org/pipermail/inquiry/2005-October/003119.html
# http://web.archive.org/web/20120206122723/http://stderr.org/pipermail/inquiry/2005-October/003120.html
# http://web.archive.org/web/20120204201412/http://stderr.org/pipermail/inquiry/2005-October/003121.html
# http://web.archive.org/web/20120206122546/http://stderr.org/pipermail/inquiry/2005-October/003131.html
# http://web.archive.org/web/20120204201617/http://stderr.org/pipermail/inquiry/2005-October/003132.html
# http://web.archive.org/web/20120204201603/http://stderr.org/pipermail/inquiry/2005-October/003133.html
# http://web.archive.org/web/20120206122820/http://stderr.org/pipermail/inquiry/2005-October/003134.html
# http://web.archive.org/web/20120206122831/http://stderr.org/pipermail/inquiry/2005-October/003141.html
# http://web.archive.org/web/20120206122929/http://stderr.org/pipermail/inquiry/2005-October/003144.html
# http://web.archive.org/web/20120206122619/http://stderr.org/pipermail/inquiry/2005-October/003149.html
# http://web.archive.org/web/20120204201609/http://stderr.org/pipermail/inquiry/2005-October/003153.html
# http://web.archive.org/web/20120204201750/http://stderr.org/pipermail/inquiry/2005-October/003157.html
# http://web.archive.org/web/20120204201806/http://stderr.org/pipermail/inquiry/2005-October/003160.html
# http://web.archive.org/web/20140930153001/http://stderr.org/pipermail/inquiry/2005-November/003165.html
# http://web.archive.org/web/20140930153026/http://stderr.org/pipermail/inquiry/2005-November/003170.html
# http://web.archive.org/web/20140930153404/http://stderr.org/pipermail/inquiry/2005-November/003171.html
# http://web.archive.org/web/20140930153429/http://stderr.org/pipermail/inquiry/2005-November/003181.html
# http://web.archive.org/web/20140930153454/http://stderr.org/pipermail/inquiry/2005-November/003197.html
# http://web.archive.org/web/20140930153517/http://stderr.org/pipermail/inquiry/2005-November/003199.html
# http://web.archive.org/web/20140930153602/http://stderr.org/pipermail/inquiry/2005-November/003200.html
# http://web.archive.org/web/20120210073504/http://stderr.org/pipermail/inquiry/2005-November/003203.html
# http://web.archive.org/web/20070816114430/http://stderr.org/pipermail/inquiry/2005-November/003204.html
# http://web.archive.org/web/20120229142056/http://stderr.org/pipermail/inquiry/2005-November/003205.html
# http://web.archive.org/web/20081121105842/http://stderr.org/pipermail/inquiry/2005-November/003206.html
# http://web.archive.org/web/20061014003447/http://stderr.org/pipermail/inquiry/2005-November/003210.html
# http://web.archive.org/web/20120229142342/http://stderr.org/pipermail/inquiry/2005-November/003212.html
# http://web.archive.org/web/20061014002842/http://stderr.org/pipermail/inquiry/2005-November/003214.html
# http://web.archive.org/web/20061014002810/http://stderr.org/pipermail/inquiry/2005-November/003217.html
# http://web.archive.org/web/20081202113911/http://stderr.org/pipermail/inquiry/2005-November/003220.html
# http://web.archive.org/web/20081202125655/http://stderr.org/pipermail/inquiry/2005-November/003221.html
# http://web.archive.org/web/20081202124413/http://stderr.org/pipermail/inquiry/2005-November/003224.html
# http://web.archive.org/web/20081202114349/http://stderr.org/pipermail/inquiry/2005-November/003226.html
# http://web.archive.org/web/20081202125124/http://stderr.org/pipermail/inquiry/2005-November/003227.html
# http://web.archive.org/web/20081202123733/http://stderr.org/pipermail/inquiry/2005-November/003228.html
# http://web.archive.org/web/20081202110401/http://stderr.org/pipermail/inquiry/2005-November/003229.html
# http://web.archive.org/web/20081202115438/http://stderr.org/pipermail/inquiry/2005-November/003230.html
# http://web.archive.org/web/20120210072838/http://stderr.org/pipermail/inquiry/2005-November/003231.html
# http://web.archive.org/web/20120210073210/http://stderr.org/pipermail/inquiry/2005-November/003233.html
# http://web.archive.org/web/20120229141918/http://stderr.org/pipermail/inquiry/2005-November/003235.html
# http://web.archive.org/web/20081202120104/http://stderr.org/pipermail/inquiry/2005-November/003236.html
# http://web.archive.org/web/20120229142553/http://stderr.org/pipermail/inquiry/2005-November/003237.html
# http://web.archive.org/web/20081202102732/http://stderr.org/pipermail/inquiry/2005-November/003238.html
# http://web.archive.org/web/20120210072952/http://stderr.org/pipermail/inquiry/2005-November/003240.html
# http://web.archive.org/web/20081202105534/http://stderr.org/pipermail/inquiry/2005-November/003241.html
# http://web.archive.org/web/20120210073248/http://stderr.org/pipermail/inquiry/2005-November/003242.html
# http://web.archive.org/web/20081202111211/http://stderr.org/pipermail/inquiry/2005-November/003244.html
# http://web.archive.org/web/20120210073012/http://stderr.org/pipermail/inquiry/2005-November/003245.html
# http://web.archive.org/web/20120210073004/http://stderr.org/pipermail/inquiry/2005-November/003246.html
# http://web.archive.org/web/20120229142033/http://stderr.org/pipermail/inquiry/2005-November/003247.html
# http://web.archive.org/web/20081202113551/http://stderr.org/pipermail/inquiry/2005-November/003248.html
# http://web.archive.org/web/20120210073525/http://stderr.org/pipermail/inquiry/2005-November/003249.html
# http://web.archive.org/web/20120210073158/http://stderr.org/pipermail/inquiry/2005-November/003250.html
# http://web.archive.org/web/20081202121026/http://stderr.org/pipermail/inquiry/2005-November/003251.html
# http://web.archive.org/web/20120229142259/http://stderr.org/pipermail/inquiry/2005-November/003256.html
# http://web.archive.org/web/20120210072947/http://stderr.org/pipermail/inquiry/2005-November/003257.html
# http://web.archive.org/web/20081202115048/http://stderr.org/pipermail/inquiry/2005-November/003258.html
===2005 • Inquiry List • Futures Of Logical Graphs • Discussion===
* http://web.archive.org/web/20150224133200/http://stderr.org/pipermail/inquiry/2005-October/thread.html#3135
* http://web.archive.org/web/20140930152003/http://stderr.org/pipermail/inquiry/2005-November/thread.html#3167
# http://web.archive.org/web/20120206122610/http://stderr.org/pipermail/inquiry/2005-October/003135.html
# http://web.archive.org/web/20120206122736/http://stderr.org/pipermail/inquiry/2005-October/003136.html
# http://web.archive.org/web/20120206122558/http://stderr.org/pipermail/inquiry/2005-October/003137.html
# http://web.archive.org/web/20120204201759/http://stderr.org/pipermail/inquiry/2005-October/003138.html
# http://web.archive.org/web/20120204201250/http://stderr.org/pipermail/inquiry/2005-October/003139.html
# http://web.archive.org/web/20120204201707/http://stderr.org/pipermail/inquiry/2005-October/003140.html
# http://web.archive.org/web/20120204201402/http://stderr.org/pipermail/inquiry/2005-October/003143.html
# http://web.archive.org/web/20120206122741/http://stderr.org/pipermail/inquiry/2005-October/003145.html
# http://web.archive.org/web/20120204201613/http://stderr.org/pipermail/inquiry/2005-October/003148.html
# http://web.archive.org/web/20120206122424/http://stderr.org/pipermail/inquiry/2005-October/003154.html
# http://web.archive.org/web/20120206122836/http://stderr.org/pipermail/inquiry/2005-October/003155.html
# http://web.archive.org/web/20120206122411/http://stderr.org/pipermail/inquiry/2005-October/003159.html
# http://web.archive.org/web/20120210072437/http://stderr.org/pipermail/inquiry/2005-October/003161.html
# http://web.archive.org/web/20120204201227/http://stderr.org/pipermail/inquiry/2005-October/003162.html
# http://web.archive.org/web/20120204201622/http://stderr.org/pipermail/inquiry/2005-October/003163.html
# http://web.archive.org/web/20120206122645/http://stderr.org/pipermail/inquiry/2005-October/003164.html
# http://web.archive.org/web/20140927152303/http://stderr.org/pipermail/inquiry/2005-November/003167.html
# http://web.archive.org/web/20140927152304/http://stderr.org/pipermail/inquiry/2005-November/003169.html
# http://web.archive.org/web/20081121134834/http://stderr.org/pipermail/inquiry/2005-November/003173.html
# http://web.archive.org/web/20120229142649/http://stderr.org/pipermail/inquiry/2005-November/003174.html
# http://web.archive.org/web/20120229141910/http://stderr.org/pipermail/inquiry/2005-November/003175.html
# http://web.archive.org/web/20120210073029/http://stderr.org/pipermail/inquiry/2005-November/003176.html
# http://web.archive.org/web/20061014003121/http://stderr.org/pipermail/inquiry/2005-November/003177.html
# http://web.archive.org/web/20070816114610/http://stderr.org/pipermail/inquiry/2005-November/003178.html
# http://web.archive.org/web/20061014003025/http://stderr.org/pipermail/inquiry/2005-November/003179.html
# http://web.archive.org/web/20081121100932/http://stderr.org/pipermail/inquiry/2005-November/003180.html
# http://web.archive.org/web/20120229142345/http://stderr.org/pipermail/inquiry/2005-November/003182.html
# http://web.archive.org/web/20120229142721/http://stderr.org/pipermail/inquiry/2005-November/003184.html
# http://web.archive.org/web/20120210073024/http://stderr.org/pipermail/inquiry/2005-November/003185.html
# http://web.archive.org/web/20120210073220/http://stderr.org/pipermail/inquiry/2005-November/003188.html
# http://web.archive.org/web/20120229142632/http://stderr.org/pipermail/inquiry/2005-November/003194.html
# http://web.archive.org/web/20061014003514/http://stderr.org/pipermail/inquiry/2005-November/003195.html
# http://web.archive.org/web/20061014003559/http://stderr.org/pipermail/inquiry/2005-November/003196.html
# http://web.archive.org/web/20120210073020/http://stderr.org/pipermail/inquiry/2005-November/003202.html
# http://web.archive.org/web/20120229142412/http://stderr.org/pipermail/inquiry/2005-November/003209.html
# http://web.archive.org/web/20061014003356/http://stderr.org/pipermail/inquiry/2005-November/003211.html
# http://web.archive.org/web/20120210072552/http://stderr.org/pipermail/inquiry/2005-November/003213.html
# http://web.archive.org/web/20061014002959/http://stderr.org/pipermail/inquiry/2005-November/003215.html
# http://web.archive.org/web/20120229142436/http://stderr.org/pipermail/inquiry/2005-November/003216.html
# http://web.archive.org/web/20120229142316/http://stderr.org/pipermail/inquiry/2005-November/003218.html
# http://web.archive.org/web/20070816114643/http://stderr.org/pipermail/inquiry/2005-November/003219.html
[[Category:Adaptive Systems]]
[[Category:Artificial Intelligence]]
[[Category:Automated Reasoning]]
[[Category:Boolean Algebra]]
[[Category:Boolean Functions]]
[[Category:Charles Sanders Peirce]]
[[Category:Combinatorics]]
[[Category:Combinatorics]]
[[Category:Computational Complexity]]
[[Category:Computer Science]]
[[Category:Computer Science]]
[[Category:Constraint Satisfaction]]
[[Category:Cybernetics]]
[[Category:Cybernetics]]
[[Category:Declarative Programming]]
[[Category:Differential Logic]]
[[Category:Equational Reasoning]]
[[Category:Formal Languages]]
[[Category:Formal Languages]]
[[Category:Formal Systems]]
[[Category:Formal Systems]]
[[Category:Functional Logic]]
[[Category:George Spencer Brown]]
[[Category:Graph Theory]]
[[Category:Graph Theory]]
[[Category:History of Logic]]
[[Category:History of Logic]]
[[Category:History of Mathematics]]
[[Category:History of Mathematics]]
[[Category:Inquiry]]
[[Category:Inquiry Driven Systems]]
[[Category:Intelligent Systems]]
[[Category:Knowledge Representation]]
[[Category:Laws Of Form]]
[[Category:Learning Systems]]
[[Category:Learning Theory]]
[[Category:Logic]]
[[Category:Logic]]
[[Category:Logical Graphs]]
[[Category:Logical Modeling]]
[[Category:Machine Learning]]
[[Category:Mathematics]]
[[Category:Mathematics]]
[[Category:Model Theory]]
[[Category:Philosophy]]
[[Category:Philosophy]]
[[Category:Programming]]
[[Category:Proof Theory]]
[[Category:Propositional Calculus]]
[[Category:Scientific Method]]
[[Category:Semiotics]]
[[Category:Semiotics]]
[[Category:Sign Relations]]
[[Category:Systems Engineering]]
[[Category:Systems Theory]]
[[Category:Visualization]]
[[Category:Visualization]]