scientific article; zbMATH DE number 3110205

zbMATH Open0065.00901MaRDI QIDQ5848908FDOQ5848908

Authors: Sergey I. Adian 

Publication date: 1955

Title of this publication is not available (Why is that?)

zbMATH Keywords

finitely generated groupsalgorithmic undecidabilityisomorphy problemmeta-word problemrecognition of properties of groups

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (37)

• UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
• A lower bound of the number of rewrite rules obtained by homological methods
• Computing simplicial representatives of homotopy group elements
• On a lower bound for the connectivity of the independence complex of a graph
• Undecidability of automorphism groups
• Topology through the centuries: low dimensional manifolds
• On the consistency problem for modular lattices and related structures
• New estimates of odd exponents of infinite Burnside groups.
• Small sets without unique products in torsion-free groups
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• Researches of semigroups with planar Cayley graphs: results and problems
• Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
• Title not available (Why is that?)
• On isomorphisms to a free group and beyond
• Rich intervals in subgroup lattices
• Model-theoretic and algorithmic questions in group theory
• Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1
• On the finiteness problem for classes of modular lattices
• Title not available (Why is that?)
• The isomorphism problem for all hyperbolic groups.
• Cutting corners
• The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable
• On rigidity and the isomorphism problem for tree braid groups.
• On some algorithmic problems for groups and monoids
• Title not available (Why is that?)
• Distinguishability of a Semi-Group by a Machine
• The B B Newman spelling theorem
• Ends of Schreier graphs of hyperbolic groups
• Unrecognizability of manifolds
• Thurston's vision and the virtual fibering theorem for 3-manifolds
• The triviality problem for profinite completions
• On one-relator groups and units of special one-relation inverse monoids
• On subsumption and semiunification in feature algebras
• Markov-Type Properties
• Two decidable Markov properties over a class of solvable groups
• On the group property recognition problem
• On the homeomorphism problem for 4-manifolds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5848908)