Dehn’s decision problems in group theory

Target entity: Dehn’s decision problems in group theory
Context triple: [Max Dehn, notableWork, Dehn’s decision problems in group theory]

• A. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• B. The Poincaré-Birkhoff-Witt theorem in ring theory
  "The Poincaré-Birkhoff-Witt theorem in ring theory" is a mathematical work, attributed here to N. G. de Bruijn, that studies and applies the Poincaré–Birkhoff–Witt theorem in the context of associative and Lie-theoretic ring structures.
• C. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• D. Entscheidungsproblem
  The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
• E. Hilbert’s fourteenth problem
  Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Dehn’s decision problems in group theory
Target entity description: Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.

• A. Knuth–Bendix completion algorithm
  The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
• B. The Poincaré-Birkhoff-Witt theorem in ring theory
  "The Poincaré-Birkhoff-Witt theorem in ring theory" is a mathematical work, attributed here to N. G. de Bruijn, that studies and applies the Poincaré–Birkhoff–Witt theorem in the context of associative and Lie-theoretic ring structures.
• C. Hilbert’s tenth problem
  Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
• D. Entscheidungsproblem
  The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
• E. Hilbert’s fourteenth problem
  Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
• F. None of above. chosen