Deciding the word problem in pure double Boolean algebras

Pure double Boolean algebras have attracted interest both for their theoretical merits and for their practical relevance. The aim of this article is to investigate the decidability and the complexity of the word problem in pure double Boolean algebras.