Document Zbl 0519.03006

Unsolvability of the universal theory of finite groups. (English. Russian original) Zbl 0519.03006

Algebra Logic 20, 139-156 (1982); translation from Algebra Logika 20, 207-230 (1981).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0519.03006

MSC:

03B25	Decidability of theories and sets of sentences
20F10	Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
03D40	Word problems, etc. in computability and recursion theory
03D10	Turing machines and related notions

Keywords:

unsolvability; Minsky machine; universal theory of finite groups; finitely presented group

Cite Review PDF

Full Text: DOI EuDML

References:

[1]	Kourovska Notebook [in Russian], Novosibirsk (1973).
[2]	A. A. Markov, ”The theory of algorithms,” Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR,42, Moscow (1954). · Zbl 0056.24901
[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]	E. L. Post, ”Recursive unsolvability of a problem of Thue,” J. Symb. Logic,12, No. 1, 1–11 (1947). · Zbl 1263.03030 · doi:10.2307/2267170

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.