Abstract
An example is given to show that even in a variety whose free word problem (identity problem) is solvable, the free product of two recursive presentations with solvable word problems may have unsolvable word problem. Under some extra conditions on the syntax of the identities defining the variety however, the free product is shown to preserve solvability of the word problem for recursive presentations. The conditions can be checked mechanically, and common varieties such as semigroups and groups satisfy them, as well as many less familiar varieties. The results are obtained by using rewrite-completion techniques.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
