Undecidable semiassociative relation algebras

Journal of Symbolic Logic 59 (2):398-418 (1994)
Abstract
If K is a class of semiassociative relation algebras and K contains the relation algebra of all binary relations on a denumerable set, then the word problem for the free algebra over K on one generator is unsolvable. This result implies that the set of sentences which are provable in the formalism Lwx is an undecidable theory. A stronger algebraic result shows that the set of logically valid sentences in Lwx forms a hereditarily undecidable theory in Lwx. These results generalize similar theorems, due to Tarski, concerning relation algebras and the formalism Lx
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275397
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,751
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Algebraic Logic, Where Does It Stand Today?Sayed Ahmed Tarek - 2005 - Bulletin of Symbolic Logic 11 (4):465-516.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

8 ( #476,549 of 2,146,883 )

Recent downloads (6 months)

1 ( #385,700 of 2,146,883 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums