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

DOI10.4230/LIPICS.FSCD.2019.24MaRDI QIDQ5089026zbMATH OpenOpenAlexFDO

Authors Mirai Ikebuchi

Publication date 18 July 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/10531/pdf/LIPIcs-FSCD-2019-24.pdf/

zbMATH Keywords

equational logichomological algebraterm rewriting systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• A lower bound of the number of rewrite rules obtained by homological methods
• Homological computations for term rewriting systems
• scientific article; zbMATH DE number 3890721
• scientific article; zbMATH DE number 4155899
• Using groups for investigating rewrite systems

Cites work

• Advanced modern algebra
• An introduction to homological algebra
• Another single law for groups
• FINITE PRESENTATIONS OF GROUPS AND 3-MANIFOLDS
• Homological computations for term rewriting systems
• Single axioms for groups
• Word problems and a homological finiteness condition for monoids
• Yet another single law for groups

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 Q5089026)