Granular hierarchical structures of finite naïve subsets and multisets based on free monoids and homomorphisms
by Tetsuya Murai; Sadaaki Miyamoto; Masahiro Inuiguchi; Seiki Akama
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 4, No. 3, 2012

Abstract: In this paper, we present granular hierarchical structures in which finite naïve subsets and multisets are formulated by means of free monoids and homomorphisms. Our motivation is the observation that we actually write a finite subset as a finite sequence, i.e., string, in the well-known extensive notation. Such correspondence from subsets to strings, however, is not one-to-one because the concept of subsets care neither order nor repetition of their elements. The reason is nothing but a straight consequence from the axiom of extensionality. Then we must represent subsets as equivalence classes of strings with respect to some appropriate equivalence relation based on a homomorphism. Then multisets are also similarly considered as we have granular hierarchal structures of 'strings-multisets-naïve subsets'. It should be noted that these formulations only require the numbers how many times each element occurs in every string. Finally the approach is shown to be able to describe every operations of finite subsets and multisets in the level of strings.

Online publication date: Fri, 16-Nov-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com