scientific article; zbMATH DE number 3110205
From MaRDI portal
Publication:5848908
zbMath0065.00901MaRDI QIDQ5848908
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finitely generated groupsalgorithmic undecidabilityisomorphy problemmeta-word problemrecognition of properties of groups
Related Items
New estimates of odd exponents of infinite Burnside groups. ⋮ A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods ⋮ On rigidity and the isomorphism problem for tree braid groups. ⋮ On some algorithmic problems for groups and monoids ⋮ Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1 ⋮ Unnamed Item ⋮ On the homeomorphism problem for 4-manifolds ⋮ Ends of Schreier graphs of hyperbolic groups ⋮ Topology through the centuries: Low dimensional manifolds ⋮ The triviality problem for profinite completions ⋮ On the consistency problem for modular lattices and related structures ⋮ On a lower bound for the connectivity of the independence complex of a graph ⋮ The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable ⋮ Two decidable Markov properties over a class of solvable groups ⋮ On the finiteness problem for classes of modular lattices ⋮ Markov-Type Properties ⋮ Thurston's vision and the virtual fibering theorem for 3-manifolds ⋮ On subsumption and semiunification in feature algebras ⋮ The B B Newman spelling theorem ⋮ Unnamed Item ⋮ The isomorphism problem for all hyperbolic groups. ⋮ Unrecognizability of manifolds ⋮ Cutting corners ⋮ On the group property recognition problem ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian ⋮ Computing simplicial representatives of homotopy group elements ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II ⋮ On one-relator groups and units of special one-relation inverse monoids
