Metadata language
Książka = Book ; KS/6/2013/T1P11
Creator:Kosiński, Witold ; Starosta, Bartłomiej
Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:[5], 139-165 pages ; 21 cm ; Bibliography p. 164-165
Type of object: Abstract:Metaset is a new concept of set with partial membership relation. It is directed towards computer implementations and applications. The degrees of membership for metasets are expressed as nodes of the binary tree and they may be evaluated as real numbers too. The forcing mechanism discussed in this paper is used to assign certainty degrees to sentences involving metasets, and to define basic relations like partial membership or partial equality. We thoroughly investigate here the class of metasets with finite deep ranges which are especially suitable for computer representations because of their finite structure. It turns out, that for sentences involving such metasets it is always possible to assign the degrees of certainty that the sentence is either true or false or both at the same time. Moreover, such sentences do not allow for any hesitancy degree what implies no hesitancy in membership and other basic relations. This property does not hold for sentences involving arbitrary metasets, what is illustrated by the examples.
Relation: Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use:Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: