Applying term rewriting methods to finite groups

DOI10.1007/3-540-53162-9_49zbMath1493.68171OpenAlexW1527568628MaRDI QIDQ5096205

Reinhard Bündgen

Publication date: 16 August 2022

Published in: Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53162-9_49

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proofs by induction in equational theories with constructors
• Systems of reductions
• Termination of rewriting
• The complexity of linear problems in fields
• A strong restriction of the inductive completion procedure
• Automatic proofs by induction in theories without constructors
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Computing ground reducibility and inductively complete positions

This page was built for publication: Applying term rewriting methods to finite groups