English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Extending reduction orderings to ACU-compatible reduction orderings

MPS-Authors
/persons/resource/persons45689

Waldmann,  Uwe       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Waldmann, U. (1998). Extending reduction orderings to ACU-compatible reduction orderings. Information Processing Letters, 67(1), 43-49.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3837-B
Abstract
We show that every reduction ordering over terms not containing $+$ that is total on ground terms and for which $0$ is minimal can be extended to an ordering that is ACU-compatible (or AC-compatible) and has the multiset property.To construct the extension ordering we use a variant of the self-labelling technique of Middeldorp, Ohsaki, and Zantema.