Extension orderings

DOI10.1007/3-540-60084-1_101zbMATH Open1412.68117OpenAlexW2912586246MaRDI QIDQ4645205FDOQ4645205

Authors: Albert Rubio 

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_101

Recommendations

• Extensions and comparison of simplification orderings
• A termination ordering for higher order rewrite systems
• Extending reduction orderings to ACU-compatible reduction orderings
• Maximal extensions of simplification orderings
• Path orderings for termination of associative-commutative rewriting

zbMATH Keywords

equational theoryconstructive proofreduction orderingground termfunction symbol

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Termination of rewriting
• Title not available (Why is that?)
• Modular properties of composable term rewriting systems
• Modular properties of conditional term rewriting systems
• Counterexamples to termination for the direct sum of term rewriting systems
• Title not available (Why is that?)
• On termination of the direct sum of term-rewriting systems
• Modularity of simple termination of term rewriting systems with shared constructors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total termination of term rewriting

Cited In (6)

• Simple termination of rewrite systems
• More on the order of prolongations and restrictions
• Title not available (Why is that?)
• Extension functions for multiset orderings
• Equational rules for rewriting logic
• Signature extensions preserve termination. An alternative proof via dependency pairs

This page was built for publication: Extension orderings

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