[Tutor] Re: How different is math logic from computer logic?

[Derrick 'dman' Hudson]

--neYutvxvOLaeuPCA
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

On Mon, Dec 09, 2002 at 01:03:25AM +0100, Magnus Lycka wrote:

| In the 19th century, british mathematician George Boole introduced
| symbolic logic or Boolean Algebra as we call it today. Basically,
| he made a simple and a complete algebraic system containing only two
| "digits": True and False, and three operations, AND, OR and NOT. If
| we use the following symbols:

Just out of curiosity, did Boole come up with "nand" or did that come
later?

For those unfamiliar with it, the nand operator is functionally
complete.  With just nand you can write any logic expression.  The
combination of and, or and not is also functionally complete.  (it's
more natural too, but require 3 operators instead of 1)

IIRC the nand truth table looks like

      | 0  1
    --|-----
    0 | 1  1
    1 | 1  0


If you're really interested in logic or rule based programming, check
out Prolog.  (I've only heard about it but never used it)

-D

--=20
If we claim we have not sinned, we make Him out to be a liar and His
Word has no place in our lives.
        I John 1:10
=20
http://dman.ddts.net/~dman/

--neYutvxvOLaeuPCA
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iEYEARECAAYFAj31fQoACgkQO8l8XBKTpRR2SwCfWB0kl8w3PtzW2tgB1n7fOAQA
t5gAnjmfMe5RjrElKAQkpxt9j6D/s9Gu
=JJhX
-----END PGP SIGNATURE-----

--neYutvxvOLaeuPCA--