Term rewrite systems for Boolean rings

Article View: sci.logic

Article #744

#744

From: Matthew Spinks
Date: Wed, 10 Sep 1997 00:00

18 lines
988 bytes

Hi All,

Can anyone point me to the literature for a confluent and terminating rewrite
system for Boolean rings?   Also, can anyone point me to a result that states
a confluent and terminating rewrite system does not exist for Boolean algebras?

Thanks,

- Matthew.

--
Matthew Spinks      |
PhD grad. slave     | 'I bet the human brain is a kludge.'
GSCIT Research Ctr. |
Monash University   | - Marvin Minsky
Churchill, Victoria |
Australia           |

Technical Details

Message-ID: <5v4sla$knp@mugca.cc.monash.edu.au>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10cc56,86e30b2218d9ff44,start
X-Google-Attributes: gid10cc56,public
X-Google-Thread: 10d67e,86e30b2218d9ff44,start
X-Google-Attributes: gid10d67e,public
From: mspinks@mugca.cc.monash.edu.au (Matthew Spinks)
Subject: Term rewrite systems for Boolean rings
Date: 1997/09/10
Message-ID: <5v4sla$knp@mugca.cc.monash.edu.au>
X-Deja-AN: 271128861
X-NNTP-Posting-User: 1073744368
Organization: Monash University
Newsgroups: sci.logic,aus.mathematics