A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods

DOI10.46298/lmcs-18(3:36)2022OpenAlexW3007940027MaRDI QIDQ5043598

Mirai Ikebuchi

Publication date: 6 October 2022

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11942

zbMATH Keywords

algebraic theoriesterm rewriting systemshomological algebra

Mathematics Subject Classification ID

Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Ext and Tor, generalizations, Künneth formula (category-theoretic aspects) (18G15)

Uses Software

• mkbTT
• Slothrop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single axioms for groups
• Recursive unsolvability of group theoretic problems
• An introduction to homological algebra
• Word problems and a homological finiteness condition for monoids
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Combinatorial group theory.
• Minimal resolutions for finite groups
• Rings with several objects
• Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
• Multi-completion with Termination Tools (System Description)
• Another single law for groups
• FINITE PRESENTATIONS OF GROUPS AND 3-MANIFOLDS

This page was built for publication: A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods