| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4663054 | Journal of Applied Logic | 2012 | 14 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Philippe Balbiani,