Leanest quasi-orderings

DOI10.1016/J.IC.2006.10.007zbMATH Open1112.68075OpenAlexW1986175866MaRDI QIDQ876045FDOQ876045

Nachum Dershowitz, E. Castedo Ellerman

Publication date: 16 April 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.10.007

zbMATH Keywords

well-quasi-orderingquasi-orderinglexicographic path ordering

Mathematics Subject Classification ID

Partial orders, general (06A06) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving termination with multiset orderings
• Orderings for term-rewriting systems
• Termination of rewriting
• Extension functions for multiset orderings
• A geometrical approach to multiset orderings
• On multiset orderings
• On termination of meta-programs
• The order types of termination orderings on monadic terms, strings and multisets

Cited In (1)

• Well rewrite orderings and well quasi-orderings

This page was built for publication: Leanest quasi-orderings

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