Unsolvability of the universal theory of finite groups

DOI10.1007/BF01735740zbMath0519.03006MaRDI QIDQ1054715

A. M. Slobodskoj

Publication date: 1982

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187133

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items

Hereditary undecidability of some theories of finite structures, On the Universal Theory of Torsion and Lacunary Hyperbolic Groups, Reduction theorem for the type-II conjecture for finite monoids, Undecidable problems for completely 0-simple semigroups., Model-theoretic and algorithmic questions in group theory, Unsolvable algorithmic problems for semigroups, groups and rings, On subsumption and semiunification in feature algebras, Algorithmic problems for finite groups and finite \(0\)-simple semigroups, An undecidability theorem for lattices over group rings, The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups, Algorithmic problems for amalgams of finite semigroups, Decidable representations, Asymptotic invariants, complexity of groups and related problems, Use of computers in solving well-known algebra problems, The word problem for cancellation semigroups with zero

Cites Work

• Recursive Unsolvability of a problem of Thue
• Unnamed Item