Re: Differential Analytic Turing Automata

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

DATA.  Note 2

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

I will be making use of the "cactus language" extension of
Peirce's Alpha Graphs, so called because it uses a species
of graphs that are usually called "cacti" in graph theory.
The last exposition of the cactus syntax that I've written
can be found here:

Jon Awbrey, "Propositional Equation Reasoning Systems" (PERS)
http://stderr.org/pipermail/inquiry/2003-March/thread.html#126

The representational and computational efficiency of the
cactus language for the tasks that are usually associated
with boolean algebra and propositional calculus makes it
possible to entertain a further extension, to what we may
call "differential logic", because it develops this basic
level of logic in the same way that differential calculus
augments analytic geometry to handle change and diversity.
There are several different intros to differential logic
that I have written and distributed across the internet.
You might start with the following couple of treatments:

DLOG A.  http://stderr.org/pipermail/inquiry/2004-February/thread.html#1132
DLOG B.  http://stderr.org/pipermail/inquiry/2004-February/thread.html#1160

I am continually rewriting these presentations
in hopes of making them as clear as they can be,
so please let me know if you have any questions.

Jon Awbrey

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o