Subject Areas: Mathematical Analysis
It is well known that any concept in classical mathematics is established on a crisp set (i.e., Cantor set). Suppose a concept Q is defined by a non-empty set D, then we say the statement that a is Q, is true (or its truth value is 1) if; or else, it is false (or its truth value is 0). In other words, classical mathematics is established on classical logic or two-valued logic. However, for some propositions we cannot judge that they are true or false, such as the following propositions are not all classical propositions:
1) A coin tossed will be heads;
2) John will be in New York tomorrow;
3) John with 30 hairs is a bandicoot;
4) John is a bandicoot.
There are various nonclassical propositions in real life. Lukasiewicz is first extended classical logic to three- valued logic as early as 1920. In 1933, A.N. Kolmogoroff presented the probability theory for dealing with a type of uncertainty called randomness  (such as the above nonclassical propositions (1) and (2)). Following that, probabilistic logic for dealing with random proposition was proposed by Nilsson  based on probability theory in 1986. The theory of fuzzy set was initialized by Zadeh via membership function in 1965  -  for fuzzy concepts (such as concept of bandicoot in the above propositions (3) and (4)). Following that, many types of many-valued logic and fuzzy logic were presented, respectively, such as Lukasiewicz fuzzy logic  product fuzzy logic, L logic   , possibilistic logic  , BL logic  , and MTL logic  .
Although multi-valued logics, fuzzy logic  -  and probabilistic logic are well developed in theory aspect, an actual interpretation of truth value of proposition is controversial. For example, Elkan and Watkins oppose fuzzy logics  -  , and claim that fuzzy logics have some disadvantages, e.g., it does not hold the law of excluded middle (i.e.,) in classical logic, where denotes a proposition; denotes its negation of proposition; denotes disjunction; and denotes the truth value of proposition. Recently, the author of paper also discussed this problem  .
In fact, Zadeh’s approach is the extension of a concept by a fuzzy set which has a graded characteristic or membership function with values between 0 and 1. This allows for intermediate membership (values in (0, 1)) in vague concepts resulting in intermediate truth values for propositions involving vague concepts (fuzzy logic). The calculus for fuzzy set theory is truth-functional which means that the full complement of Boolean laws cannot all be satisfied  . Furthermore, fuzzy set theory and fuzzy logic adopt an epistemic view of vagueness. Considering the shortcoming of fuzzy logic, it was proposed to the probabilistic logic holding the law of excluded middle dealing with fuzzy (or vague) concepts from a point of view in these papers  -  . In 2004, Lawry also provided a framework for linguistic modelling for dealing with vague (i.e. fuzzy) concepts based on label semantics using probability theory and random set  . At present it has been well developed  -  which was called uncertainty modelling for vague concepts in the paper  . In the theory, the appropriateness measure of label expressions is a basal concept. Given the label expression, a pivotal step of calculating the appropriateness measures is to seek a set of subsets of label corresponding to the label expression. Note that it is complicated to the approach of calculating the appropriateness measures of label expression provided in these papers  -  . Therefore the paper will discuss this problem.
The rest of this paper is organized as follows. Some basic concepts on uncertainty modelling for vague concepts are recalled in Section 2. In Section 3, the concept of disjunctive normal forms is first presented; then it is proved that each label expression is semantic equivalent to a disjunctive normal form; finally, a new method of calculating the appropriateness measure of label expression is provided. At the end of this paper, a brief summary is given.
Definition 1 (Label expressions). Given a finite set of labels LA the corresponding set of label expressions LE is defined recursively as follows:
・ If, then;
・ If then
The mass function on sets of labels then quantifies the agent’s belief that any particular subset of labels contains all and only the labels with which it is appropriate to describe x i.e. is the agent's subjective probability that.
Definition 2 (Mass function on labels). a mass function on labels is a function such that.
Definition 3 (λ-mapping). is defined recursively as follows:
Based on the λ mapping we then define as the sum of over those set of labels in. The sum of over those set of labels in.
Definition 4 (Appropriateness measure). The appropriateness measure defined by mass function is a function satisfying
Let Val be the set of valuation functions where for means that is appropriate in the current context. In particular, the epistemic stance dictates that for each there would be a corresponding valuation (partially unknown to the agent) determining which labels are appropriate to describe x. A valuation naturally determines an extension defined recursively as follows: For and We can now define and as follows:
・ if then.
・ θ is a tautology, if.
・ θ is a contradiction, if.
Theorem 6 (General properties of appropriateness measures). the following properties hold:
・ If then
・ If θ is a tautology, then
・ If θ is a contradiction, then
・ If is a contradiction, then
・ For, let then.
We not find the proof of last property in Theorem 6 in these papers  -  . Therefore, now we provide it.
Proof. Without loss of generality, suppose. Since it follows from Definition 3 that
Thus we only need to prove that
We first prove that
Since for each, , also, , and not holds, it follows that, and,. Therefore
Thus the formula (3) is true.
Now we prove that for any, if, then not holds. In fact, if E not contain, then not hold; if E contain then, not hold. In a word, not holds.
Therefore is true. It follows that
The theorem is proved.
3. Calculating of the appropriateness Measures
In the Section we first discuss the properties of valuation functions.
For convenience, we call each element in Label as atomic label expression. Let θ be a label expression containing atomic label expressions, then we can be denoted by. Although it not contains atomic label expressions, we also can write it as. The mapping is denoted by, and write For example, if, and then is regard as a vector in.
Note that is a subset of LA, and a relation of one to one from the set val of all this mapping to is gained, and the valuation function, of θ is a Boolean function. Such function f is denoted by. Where can be considered a random variable, a n-dimensional random variable, and a function of n random vari- ables.
Definition 7. A label expression θ is said to be a disjunctive normal form, if its form is
where is or, for and are all different.
Let, each is called a conjoint atomic label expression.
Lemma 8. For each, then where satis- fy that if if and for we have
On the one hand, if it follows from that if Thus
On the other hand, let then there exists or is contained in and it is not contained in w. Suppose is contained in and it is not contained in w. Thus is contained in w and Thus
Lemma 9. Let label expression θ be a non-contradiction, and it contains atomic label expressions. Then it is semantically equivalent to a disjunctive normal form as follows:
where for each
satisfies that is if; is if, for
as disjunctive normal form of θ, and it is denoted by.
Proof. From Definition 5 we need to prove
It is evident that we only need to prove iff
For suppose then by Lemma 8 we have It follows from conjoint atomic label expression is contained in
Contrarily, for suppose
By Lemma 8 we known that if. Thus is contain in
The theorem is proved.
By Lemma 9 and Definition 3 we easily gained the following Lemma.
Lemma 10. Let a mass function on labels LA is a function such that Then
where for each
satisfies that is if; is if, for
Theorem 11. Let a mass function on labels LA is a function such that For any
Proof. By Lemma 10 we have
It follows from Theorem 6 and the meaning of mapping, foe each, , thus the theorem is true.
Exempla 12. Suppose, , and is a mass function on labels LA satisfying:
For note that
It we write then
Thus we have
The paper manly provided a new method for calculating the appropriateness measures of label expressions. Based on the fact, each label expression is semantic equivalent to a disjunctive normal form.
This work was supported by national natural science foundation of China grant No.11471152 and No.61273044.
 Zadeh, L.A. (1973) Outline of a New Approach to the Analysis of Complex Systems and Decision Processes. IEEE Transactions on Systems, Man and Cybernetics, 3, 28.
 Doubois, D. and Prade, H. (2001) Possibility Theory, Probability Theory and Multiple-Valued Logic. Annals of Mathematics and Artificial Intelligence, 32, 35-66.
 Dubois, D. and Prade, H. (1988) An Introduction to Possibility and Fuzzy Logics. In: Smets, P., Mamdani, A., Dubois, D. and Prade, H., Eds., Non-Standard Logics for Automated Reasoning, Academic Press, London, 742-755.
 Dubois, D. and Prade, H. (1990) Measuring Properties of Fuzzy Sets: A General Technique and Its Use in Fuzzy Query Evaluation. Fuzzy Sets and Systems, 38, 137-152.
 Dubois, D., Godo, L., Prade, H. and Esteva, F. (2005) An Information-Based Discussion of Vagueness. In: Cohen, H. and Lefebre, C., Eds., Handbook of Categorization in Cognitive Science, Elsevier Science, Amsterdam, 891-909.
 Li, L. and Zhang, J. (2010) Attribute Reduction in Fuzzy Concept Lattices Based on the T Implication Original Research Article Pages. Knowledge-Based Systems, 23, 497-503.
 Miller, S. and John, R. (2010) An Interval Type-2 Fuzzy Multiple Echelon Supply Chain Model Original Research Article Pages. Knowledge-Based Systems, 23, 363-368.
 Egemen, A. and Telatar, Y.Z. (2010) Note-against-Note Two-Voice Counterpoint by Means of Fuzzy Logic Original Research Article. Knowledge-Based Systems, 23, 256-266.
 Lawry, J. (2008) An Overview of Computing with Words Using Label Semantics. In: Bustince, H., Herrera, F. and Montero, J., Eds., Fuzzy Sets and Their Extensions: Representation, Aggregation and Models, Springer, Berlin, 65-87.
 Tang, Y. and Zheng, J. (2006) Linguistic Modelling Based on Semantic Similarity Relation amongst Linguistic Labels. Fuzzy Sets and Systems, 157, 1662-1673.