Skip to main content
SpringerLink
Log in

An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra

  • Published:
algebra universalis Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. W. W. Boone andG. Higman,An algebraic characterization of groups with soluble word problem, J. Australian Math. Soc. (Hanna Neumann memorial volume)2, 41–53.

  2. T. Evans, K. I. Mandelberg andM. F. Neff,Embedding algebras with solvable word problems in simple algebras. Some Boone-Higman type theorems, Proc. of Logic Colloquium, Univ. of Bristol, July 1973, North-Holland Publ. Co., (1975), 259–277.

  3. T. Evans,On multiplicative systems defined by generators and relations, I. Normal form theorems, Proc. Cambr. Phil. Soc., vol.47 (1951), 637–649.

    Article  MATH  Google Scholar 

  4. G. Higman,Subgroups of finitely presented groups, Proc. Royal Soc., A, vol.262 (1961), 455–475.

    MATH  MathSciNet  Google Scholar 

  5. A. V. Kuznecov, Usphemat. Nauk., 3rd issue (1958), 240.

  6. A. I. Malcev,The Metamathematics of Algebraic Systems, Collected Papers: 1936–1967, North-Holland Publ. Co., 1971.

  7. V. L. Murskii,Isomorphic embedding of a semi-group with an enumerable set of defining relations in a finitely presented semi-group, Matem. Sametki, vol.1 (1967), 217–224.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Emory University, Atlanta, Georgia, USA

    Trevor Evans

Authors
  1. Trevor Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by NSF Grant GP-37506X

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evans, T. An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra. Algebra Universalis 8, 197–204 (1978). https://doi.org/10.1007/BF02485389

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02485389

Keywords

Search

Navigation