On properties of the free BCI-algebra with one generator (Q2836159)

A BCI-algebra is a type \((2,0)\) algebra on the language \((*,0)\) satisfying the axioms: NEWLINE\begin{itemize}NEWLINE\item[1.] \(x*0 = x\),NEWLINE\item[2.] \(\bigl ((x*y)*(x*z)\bigl)*(z*y) = 0\),NEWLINE\item[3.] \(x*y = 0\) and \(y*x = 0\) \(\Rightarrow \) \(x = y\).NEWLINE\end{itemize}NEWLINEA BCI-algebra is partially ordered by the relation \(x \leq y\) if and only if \(x*y = 0\). The constant 0 is a minimal element with respect to this order and the branch of all elements above 0 forms a subalgebra of the BCI-algebra; in fact, a BCK-subalgebra. There may exist more minimal elements with respect to the partial order and the set of elements above each minimal element forms a branch that is disjoint from each other branch. Thus, elements in different branches are incomparable. The set of all minimal elements forms an abelian group under the operation \(x+y := x*(0*y)\).NEWLINENEWLINEThis article considers the free BCI-algebra generated by a single free generator \(x\). It is shown that this algebra is (countably) infinite and has infinitely many minimal elements and hence infinitely many branches. In addition, each branch is shown to contain both an infinite chain, without least element, and an infinite antichain.