Redefined Submultiset-based Multiset Ordering via Grid

Authors

  • Chinedu Peter Federal University, Dutsin-ma, Nigeria
  • Dasharath Singh Ahmadu Bello University, Zaria Nigeria

Keywords:

submultiset-based multiset ordering, grid, difference grid, reference

Abstract

We present a grid form of the Jouannaud-Lescanne submultiset-based multiset ordering. A flexible definition of the multiset ordering is hereby presented. The grid approach has been used in this paper to prove some assertions. Our such result is the submultiset-based pair-wise equality theorem for multisets.

Author Biographies

Chinedu Peter, Federal University, Dutsin-ma, Nigeria

Mathematical Sciences & IT department.

Assistant Lecturer

Dasharath Singh, Ahmadu Bello University, Zaria Nigeria

Former professor, Indian Institute of Technology, Bombay

References

Dershowitz, N. and Manna, Z. (1979). Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476.

Huet, G. and Oppen, D. C. (1980). Equations and rewrite rules. Formal language theory: perspectives and open problems, pages 349–405.

Jouannaud, Jean, P. and Lescanne, P. (1982). On multiset orderings. Information Processing Letters, 15(2):57–63.

Martin, U. (1989). A geometrical approach to multiset orderings. Theoretical Computer Science, 67(1):37–54.

Peter, C. and Singh, D. (2013). Grid ramification of set-based multiset ordering. Asian Journal of Fuzzy and Applied Mathematics, 1(3):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.

Singh, D. and Peter, C. (2011). Multiset-based tree model for membrane computing. Computer Science, 19(1):55.

Downloads

Published

2016-01-05

How to Cite

Peter, C., & Singh, D. (2016). Redefined Submultiset-based Multiset Ordering via Grid. Asian Journal of Fuzzy and Applied Mathematics, 3(6). Retrieved from https://ajouronline.com/index.php/AJFAM/article/view/3241