Abstract
We show that in many cases the decision problems for varieties of cylindric algebras are much harder than those for the corresponding relation algebra reducts. We also give examples of varieties of cylindric and relation algebras which are algorithmically more complicated than the subvarieties of their representable algebras.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
