Presentations of Bruck-Reilly extensions and decision problems (Q5930165)

Let \(S\) be an inverse semigroup, and \(A_j\) and \(B_j\) be isomorphic inverse subsemigroups of \(S\) for every \(j\in J\). Suppose that \(e_j\in A_j\subset e_jSe_j\) and \(f_j\in B_j\subset f_jSf_j\) for some idempotents \(e_j,f_j\) of \(S\). Let \(\phi\) be an isomorphism of \(A_j\) onto \(B_j\) for every \(j\in J\). The inverse semigroup \(S^*\) presented by \(\text{Inv}(S,t_j\;(j\in J)\mid t^{-1}_jt_j=f_j,\;t_jt^{-1}_j=e_j,\;t^{-1}_jat_j=\phi_j(a)\) for every \(a\in A_j\) and every \(j\in J)\) is called the HNN extension of \(S\) associated with \(\phi_j\) (\(j\in J\)). Let \(T\) be a monoid, and let \(U\) be its group of units. Let \(\theta\) be a homomorphism of \(T\) into \(U\). The Bruck-Reilly extension is the monoid \(\text{BR}(T,\theta)\) whose underlying set is the direct product \(N\times T\times N\) with the multiplication given by \((m,a,n)(p,b,q)=(m-n+r,\theta^{r-n}(a)\theta^{r-p}(b),q-p+r)\), where \(r=\max(n,p)\). Any Bruck-Reilly extension of an inverse monoid is an HNN extension of a certain inverse monoid. The word problem for a Bruck-Reilly extension \(\text{BR}(A,\theta)\) of an inverse monoid is solvable if \(A\) has solvable word problem and \(\theta\) is effectively computable. On the other hand, many algebraic properties for Bruck-Reilly extensions of an inverse monoid are undecidable.