Abstract

Kabzinski in [6] first introduced an extension of BCI-logic that is isomorphic to BCI-algebras. Kashima and Komori in [7] gave a Gentzen-style sequent calculus version of this logic as well as another sequent calculus which they proved to be equivalent. They used the second to prove decidability of the word problem for BCI-algebras. The decidability proof relies on cut elimination for the second system, this paper provides a fuller and simpler proof of this. Also supplied is a new decidability proof and proof finding algorithm for their second extension of BCI-logic and so for BCI-algebras.