A lower bound of the number of rewrite rules obtained by homological methods
From MaRDI portal
Publication:5043598
DOI10.46298/LMCS-18(3:36)2022OpenAlexW3007940027MaRDI QIDQ5043598FDOQ5043598
Authors: 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
Recommendations
Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Ext and Tor, generalizations, Künneth formula (category-theoretic aspects) (18G15)
Cites Work
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- An introduction to homological algebra
- Advanced modern algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rings with several objects
- Combinatorial group theory.
- Title not available (Why is that?)
- Minimal resolutions for finite groups
- FINITE PRESENTATIONS OF GROUPS AND 3-MANIFOLDS
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Mining propositional simplification proofs for small validating clauses
- Multi-completion with Termination Tools (System Description)
- Title not available (Why is that?)
- Word problems and a homological finiteness condition for monoids
- Recursive unsolvability of group theoretic problems
- Another single law for groups
- Title not available (Why is that?)
- Single axioms for groups
- Homological computations for term rewriting systems
Cited In (1)
Uses Software
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)
