×

The word problem for free BCI-algebras is decidable. (English) Zbl 0787.06018

Gentzen-type sequent calculi are used to show that the word problem for free BCI-algebras is decidable.

MSC:

06F35 BCK-algebras, BCI-algebras
03D40 Word problems, etc. in computability and recursion theory
03F05 Cut-elimination and normal-form theorems
08A50 Word problems (aspects of algebraic structures)
08B20 Free algebras
PDFBibTeX XMLCite