Term rewrite systems for Boolean rings

Thread View: sci.logic

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Matthew Spinks Wed, 10 Sep 1997 00:00

#744

Author: 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           |

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads