SET-BASED ORDERING ON SIMPLE MULTISETS OF INCOMPARABLE OBJECTS
Abstract
It is convincing that there exists an ordering on simple multisets of incomparable objects by means of the Jouannaud-Lascanne set-based multiset ordering. A successful attempt to show that a singleton multiset is dominated by a simple pair multiset despite the incomparability of their objects is made with respect to the ordering. Furthermore, an existence of the ordering among simple multisets of higher cardinalities where the cardinality of the preceding multiset is a unit or more less than that of the succeeding multiset is observed. Thus, we obtain an extension of the ordering to simple multisets of incomparable objects. No stronger set-based multiset ordering may be found to exist.
References
Dershowitz, N. and Manna, Z, (1979), Proving Termination with Multiset Ordering, Comm. ACM, Vol. 22, 465-476.
Huet, G. and Oppen, D. C. (1980). Equations and rewrite rules. Formal language theory: perspectives and open problems, 349-405.
Jouannaud, J. and Lescanne (1982), P., On multiset ordering, Information processing letters, Volume 15, Number 2, 57-63.
Peter, C. and Singh, D. (2013), Grid ramification of set-based multiset ordering, Asian Journal of Fuzzy and Applied Mathematics (ISSN: 2321 – 564X), Volume 01- Issue 03, October, 51-60.
Singh, D., Ibrahim, A., Yohanna, T., and Singh, J. (2007). An overview of the applications of multisets. Novi Sad Journal of Mathematics, 37(3):73- 92.
Copyright (c) 2023 FUDMA JOURNAL OF SCIENCES
This work is licensed under a Creative Commons Attribution 4.0 International License.
FUDMA Journal of Sciences