Theme One Program • Exposition • Logical Cacti
 Theme One Program • Exposition • Logical Cacti
 http://web.archive.org/web/20150109155110/http://stderr.org/pipermail/inquiry/2005February/thread.html#2348
 http://web.archive.org/web/20150109155110/http://stderr.org/pipermail/inquiry/2005February/thread.html#2360
 http://web.archive.org/web/20150109152359/http://stderr.org/pipermail/inquiry/2005February/002360.html
 http://web.archive.org/web/20150109152401/http://stderr.org/pipermail/inquiry/2005February/002361.html
Contents
Original Version
Up till now we've been working to hammer out a twoedged sword of syntax, honing the syntax of painted and rooted cacti and expressions (PARCAE), and turning it to use in taming the syntax of twolevel formal languages.
But the purpose of a logical syntax is to support a logical semantics, which means, for starters, to bear interpretation as sentential signs that can denote objective propositions about some universe of objects.
One of the difficulties that we face in this discussion is that the words interpretation, meaning, semantics, and so on will have so many different meanings from one moment to the next of their use. A dedicated neologician might be able to think up distinctive names for all of the aspects of meaning and all of the approaches to them that will concern us here, but I will just have to do the best that I can with the common lot of ambiguous terms, leaving it to context and the intelligent interpreter to sort it out as much as possible.
As it happens, the language of cacti is so abstract that it can bear at least two different interpretations as logical sentences denoting logical propositions. The two interpretations that I know about are descended from the ones that Charles Sanders Peirce called the entitative and the existential interpretations of his systems of graphical logics. For our present aims, I shall briefly introduce the alternatives and then quickly move to the existential interpretation of logical cacti.
Table A illustrates the existential interpretation of cactus graphs and cactus expressions by providing English translations for a few of the most basic and commonly occurring forms.
 
 
 
 
 
 
 
 

Table B illustrates the entitative interpretation of cactus graphs and cactus expressions by providing English translations for a few of the most basic and commonly occurring forms.
 
 
 
 
 
 
 
 

For the time being, the main things to take away from Tables A and B are the ideas that the compositional structure of cactus graphs and expressions can be articulated in terms of two different kinds of connective operations, and that there are two distinct ways of mapping this compositional structure into the compositional structure of propositional sentences, say, in English:
1.  The node connective joins a number of component cacti at a node: 
C_1 ... C_k @  
2.  The lobe connective joins a number of component cacti to a lobe: 
C_1 C_2 C_k oo...o \ / \ / \ / \ / @ 
Table 15 summarizes the existential and entitative interpretations of the primitive cactus structures, in effect, the graphical constants and connectives.
Table 15. Existential & Entitative Interpretations of Cactus Structures ooooo  Cactus Graph  Cactus String  Existential  Entitative     Interpretation  Interpretation  ooooo       @  " "  true  false       ooooo       o            @  ( )  false  true       ooooo       C_1 ... C_k      @  C_1 ... C_k  C_1 & ... & C_k  C_1 v ... v C_k       ooooo       C_1 C_2 C_k   Just one  Not just one   oo...o      \ /   of the C_j,  of the C_j,   \ /      \ /   j = 1 to k,  j = 1 to k,   \ /      @  (C_1, ..., C_k)  is not true.  is true.       ooooo 
It is possible to specify abstract rules of equivalence (AROEs) between cacti, rules for transforming one cactus into another that are formal in the sense of being indifferent to the above choices for logical or semantic interpretations, and that partition the set of cacti into formal equivalence classes.
A reduction is an equivalence transformation that is applied in the direction of decreasing graphical complexity.
A basic reduction is a reduction that applies to one of the two families of basic connectives.
Table 16 schematizes the two types of basic reductions in a purely formal, interpretationindependent fashion.
Table 16. Basic Reductions oo    C_1 ... C_k   @ = @     if and only if     C_j = @ for all j = 1 to k    oo    C_1 C_2 C_k   oo...o   \ /   \ /   \ /   \ /   @ = @     if and only if     o      C_j = @ for exactly one j in [1, k]    oo 
The careful reader will have noticed that we have begun to use graphical paints like "a", "b", "c" and schematic proxies like "C_1", "C_j", "C_k" in a variety of novel and unjustified ways.
The careful writer would have already introduced a whole bevy of technical concepts and proved a whole crew of formal theorems to justify their use before contemplating this stage of development, but I have been hurrying to proceed with the informal exposition, and this expedition must leave steps to the reader's imagination.
Of course I mean the active imagination. So let me assist the prospective exercise with a few hints of what it would take to guarantee that these practices make sense.
Partial Rewrites
Table 13 illustrates the existential interpretation of cactus graphs and cactus expressions by providing English translations for a few of the most basic and commonly occurring forms.
Even though I do most of my thinking in the existential interpretation, I will continue to speak of these forms as logical graphs, because I think it is an important fact about them that the formal validity of the axioms and theorems is not dependent on the choice between the entitative and the existential interpretations.
The first extension is the reflective extension of logical graphs (RefLog). It is obtained by generalizing the negation operator "" in a certain way, calling "" the controlled, moderated, or reflective negation operator of order 1, then adding another such operator for each finite
In sum, these operators are symbolized by bracketed argument lists as follows: "", "", "", …, where the number of slots is the order of the reflective negation operator in question.
The cactus graph and the cactus expression shown here are both described as a spike.
oo    o      @    oo  ( )  oo 
The rule of reduction for a lobe is:
oo    x_1 x_2 ... x_k   oo ... o   \ /   \ /   \ /   \ /   \ /   \ /   \ /   \ /   @ = @    oo 
if and only if exactly one of the is a spike.
In Ref Log, an expression of the form expresses the fact that exactly one of the is true. Expressions of this form are called universal partition expressions, and they parse into a type of graph called a painted and rooted cactus (PARC):
oo    e_1 e_2 ... e_k   o o o        oo ... o   \ /   \ /   \ /   \ /   \ /   \ /   \ /   \ /   @    oo 
oo    ( x1, x2, ..., xk ) = [blank]     iff     Just one of the arguments   x1, x2, ..., xk = ()    oo 
The interpretation of these operators, read as assertions about the values of their listed arguments, is as follows:
Existential Interpretation:  Just one of the k argument is false. 
Entitative Interpretation:  Not just one of the k arguments is true. 
Tables
Table 1. Syntax and Semantics of a Calculus for Propositional Logic



 

 

 

 

 


Table A. Existential Interpretation
Table A illustrates the existential interpretation of cactus graphs and cactus expressions by providing English translations for a few of the most basic and commonly occurring forms.
 
 
 
 
 
 
 
 

Table B. Entitative Interpretation
Table B illustrates the entitative interpretation of cactus graphs and cactus expressions by providing English translations for a few of the most basic and commonly occurring forms.
 
 
 
 
 
 
 
 

For the time being, the main things to take away from Tables A and B are the ideas that the compositional structure of cactus graphs and expressions can be articulated in terms of two different kinds of connective operations, and that there are two distinct ways of mapping this compositional structure into the compositional structure of propositional sentences.
Table C. Dualing Interpretations

 

 

 

 



 Adaptive Systems
 Artificial Intelligence
 Automated Reasoning
 Boolean Functions
 Charles Sanders Peirce
 Computational Complexity
 Constraint Satisfaction
 Cybernetics
 Declarative Programming
 Formal Languages
 Functional Logic
 George Spencer Brown
 Graph Theory
 Inquiry
 Inquiry Driven Systems
 Intelligent Systems
 Knowledge Representation
 Laws Of Form
 Learning Systems
 Learning Theory
 Logic
 Logical Graphs
 Logical Modeling
 Machine Learning
 Mathematics
 Model Theory
 Programming
 Proof Theory
 Propositional Calculus
 Scientific Method
 Semiotics
 Sign Relations
 Systems Engineering
 Systems Theory