Dummy elimination in equational rewriting

DOI10.1007/3-540-61464-8_44zbMATH Open1503.68105OpenAlexW1512440136MaRDI QIDQ5055853FDOQ5055853

Maria C. F. Ferreira

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61464-8_44

Recommendations

• Dummy elimination: Making termination easier
• scientific article; zbMATH DE number 1614705
• Elimination transformations for associative-commutative rewriting systems
• scientific article; zbMATH DE number 1670496
• Termination Modulo Combinations of Equational Theories

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Termination of term rewriting: Interpretation and type elimination
• Proving termination with multiset orderings
• A complete characterization of termination of 0p 1q→1r 0s
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination by completion
• Dummy elimination: Making termination easier

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination modulo equations by abstract commutation with an application to iteration
• Dummy elimination: Making termination easier

This page was built for publication: Dummy elimination in equational rewriting

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