We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Unsolvability of the universal theory of finite groups | SpringerLink

Unsolvability of the universal theory of finite groups

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

Literature Cited

  1. 1.

    Kourovska Notebook [in Russian], Novosibirsk (1973).

  2. 2.

    A. A. Markov, "The theory of algorithms," Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR,42, Moscow (1954).

  3. 3.

    P. S. Novikov, "On the algorithmic unsolvability of the word problem in theory of groups," Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR,44, Moscow (1955).

  4. 4.

    E. L. Post, "Recursive unsolvability of a problem of Thue," J. Symb. Logic,12, No. 1, 1–11 (1947).

    MathSciNet  Article  MATH  Google Scholar 

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 20, No. 2, pp. 207–230, March–April, 1981.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Slobodskoi, A.M. Unsolvability of the universal theory of finite groups. Algebra and Logic 20, 139–156 (1981). https://doi.org/10.1007/BF01735740

Download citation

Keywords

  • Induction Hypothesis
  • Finite Group
  • Infinite Number
  • Word Problem
  • Periodic Group