A lower bound of the number of rewrite rules obtained by homological methods

DOI10.46298/LMCS-18(3:36)2022MaRDI QIDQ5043598zbMATH OpenOpenAlexFDO

Authors Mirai Ikebuchi

Publication date 6 October 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

homological algebraterm rewriting systemsalgebraic theories

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)

Recommendations

• Homological computations for term rewriting systems
• Using groups for investigating rewrite systems
• Applying term rewriting methods to finite groups
• Complete rewriting systems and homology of monoid algebras
• scientific article; zbMATH DE number 3870642

Cites work

• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 812874 (Why is no real title available?)
• scientific article; zbMATH DE number 3332449 (Why is no real title available?)
• scientific article; zbMATH DE number 3079597 (Why is no real title available?)
• scientific article; zbMATH DE number 3110205 (Why is no real title available?)
• Advanced modern algebra
• An introduction to homological algebra
• Another single law for groups
• Combinatorial group theory.
• FINITE PRESENTATIONS OF GROUPS AND 3-MANIFOLDS
• Homological computations for term rewriting systems
• Minimal resolutions for finite groups
• Mining propositional simplification proofs for small validating clauses
• Multi-completion with Termination Tools (System Description)
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Recursive unsolvability of group theoretic problems
• Rings with several objects
• Single axioms for groups
• Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
• Word problems and a homological finiteness condition for monoids

Cited in

(1)

• Homological computations for term rewriting systems

Describes a project that uses

Uses Software

• Slothrop
• mkbTT

This page was built for publication: A lower bound of the number of rewrite rules obtained by homological methods

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