Kashima, Ryo; Komori, Yuichi The word problem for free BCI-algebras is decidable. (English) Zbl 0787.06018 Math. Jap. 37, No. 6, 1025-1029 (1992). Gentzen-type sequent calculi are used to show that the word problem for free BCI-algebras is decidable. Reviewer: M.Pałasiński (Ames) Cited in 1 ReviewCited in 1 Document 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 Keywords:Gentzen-type sequent calculi; word problem; free BCI-algebras PDFBibTeX XMLCite \textit{R. Kashima} and \textit{Y. Komori}, Math. Japon. 37, No. 6, 1025--1029 (1992; Zbl 0787.06018)