Applying term rewriting methods to finite groups

DOI10.1007/3-540-53162-9_49MaRDI QIDQ5096205zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Using groups for investigating rewrite systems
• scientific article; zbMATH DE number 3870642
• scientific article; zbMATH DE number 58292
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• scientific article; zbMATH DE number 3871338

Cites work

• A strong restriction of the inductive completion procedure
• Algebraic simplification
• Automatic proofs by induction in theories without constructors
• Computing ground reducibility and inductively complete positions
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 4041334 (Why is no real title available?)
• scientific article; zbMATH DE number 4047063 (Why is no real title available?)
• scientific article; zbMATH DE number 43246 (Why is no real title available?)
• scientific article; zbMATH DE number 44069 (Why is no real title available?)
• scientific article; zbMATH DE number 3563392 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Proofs by induction in equational theories with constructors
• Systems of reductions
• Termination of rewriting
• The complexity of linear problems in fields

Cited in

(6)

• scientific article; zbMATH DE number 1615231 (Why is no real title available?)
• scientific article; zbMATH DE number 3871338 (Why is no real title available?)
• Using groups for investigating rewrite systems
• scientific article; zbMATH DE number 5778575 (Why is no real title available?)
• A lower bound of the number of rewrite rules obtained by homological methods
• A case study of completion modulo distributivity and Abelian groups

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

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