Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!seismo!hao!hplabs!sri-unix!crummer@AEROSPACE
From: crummer%AEROSPACE@sri-unix.UUCP
Newsgroups: net.ai
Subject: Laws of Form
Message-ID: <17231@sri-arpa.UUCP>
Date: Sat, 3-Mar-84 21:36:25 EST
Article-I.D.: sri-arpa.17231
Posted: Sat Mar  3 21:36:25 1984
Date-Received: Fri, 9-Mar-84 01:23:49 EST
Lines: 17

From:  Charlie Crummer 

I don't pretend to be an expert on LoF but I think there are at least two
interesting aspects to it.  One is that it provides a calculus that can be used
to "compile" a set of syllogisms (page 124 of the Dutton 1979 edition).  A
second is that it does away with Russell and Whitehead's cumbersome Theory
of Types.  All orders of self-referential sets of statements can be evaluated
within the set of "imaginary" values.

You can argue that the compilation of syllogism sets (rule sets) can already
be done using truth tables.  I think that the benefit of Spencer-Brown's
calculus is that it is much more efficient and should run much faster.

Those who are really interested should loosen up and plow through the book
a few times with an open mind.  It is really very thought-provoking.

  --Charlie