HyperUncertain, SuperUncertain, and SuperHyperUncertain Sets/Logics/Probabilities/Statistics
HyperUncertain, SuperUncertain, and SuperHyperUncertain Sets/Logics/Probabilities/Statistics
HyperUncertain, SuperUncertain,
and SuperHyperUncertain
Sets/Logics/Probabilities/Statistics
Florentin Smarandache 1
Abstract
In this paper, we define for the first time the HyperUncertain, SuperUncertain, and
SuperHyperUncertain Sets/Logics/Probabilities/Statistics, the classical case (when the
appurtenance degree of a generic element belongs to the unit interval [0, 1]), and the non-
classical case (when the appurtenance degree of a generic element is outside on the interval
[0, 1]; such theories are called Over/Under/Off-Sets/Logics/Probabilities/Statistics).
We prove that the Unary SuperHyperFunction is a generalization of all Uncertain
Sets/Logics/Probabilities.
Keywords
SuperHyperStructure, Unary SuperHyperFunction, (h-ary, k-ary) SuperHyperFunction,
HyperUncertain Sets, HyperUncertain Logics, HyperUncertain Probabilities, HyperUncertain
Statistics, SuperUncertain Sets, SuperUncertain Logics, SuperUncertain Probabilities,
SuperUncertain Statistics, SuperHyperUncertain Sets, SuperHyperUncertain Logics,
SuperHyperUncertain Probabilities, SuperHyperUncertain Statistics.
2. Definition of SuperHyperStructure
5. Unary SuperHyperFunction
6. Theorem:
The Unary SuperHyperFunction is a generalization of all classical and non-classical
Uncertain Sets/Logics/Probabilities/Statistics.
By “classical” we mean those theories whose codomain is the unit interval,
B = [0, 1].
By “non-classical” we mean the theories whose codomain is different from [0, 1], i.e.
B = [, ] [0,1] , where 0 1 ,
as in Over/Under/Off-Sets/Logics/Probability/Statistics {Smarandache, [2, 3]}.
Proof:
7. Number of Degree-Types
Let τ: A → N, where A is the domain of a given Uncertain Theory, while N is the set of natural
(positive integer) numbers, with 𝜏(𝑥) = the number of degree types of this given Uncertain Theory
(i.e. Uncertain Set/Logic/Probability/Statistics).
Let 𝜏(𝑥) = r ≥ 1 be the number of degree types ( d1, d2, …, dr ) of some Uncertain Theory,
for example, if r = 4 one may have:
d1 = degree of membership/truth/chance_of_occuring,
d2 = degree of nonmembership/falsehood/chance_of_not_occuring
d3 = degree of indeterminacy/neutrality
d4 = degree of contradiction.
Then:
d1 , d 2 ,..., dr : P m ( A) → P n ([0,1]) , for classical Uncertain Theories.
Or:
d1 , d 2 ,..., dr : P m ( A) → P n ([ , ]) , 0 1 , for un-classical Uncertain Theories.
As theories, we especially refer to "Set" and "Logic" and “Probability” (since “Statistics” is
just characterization of the Probability events), which are the most used ones with respect
to uncertain(ty).
(i) For several Uncertain Theories, for any x A, 𝜏(𝑥) is a single degree – degree of
membership (or truth, or chance of occurring), normally denoted by 𝑡(𝑥),
therefore 𝜏(𝑥) = 𝑡(𝑥),
or 𝜏: 𝐴 → [0,1], especially in classical fuzzy set/logic/probability.
(ii) For other Uncertain Theories, 𝜏(𝑥) is a double degree: degree of membership (or
truth), denoted by 𝑡(𝑥), and degree of nonmembership (or falsehood), denoted by 𝑓(𝑥).
Therefore: 𝜏(𝑥) = (𝑡(𝑥), 𝑓(𝑥)), or 𝜏: 𝐴 → [0,1]2 .
As an example: for intuitionistic fuzzy set/logic/probability and its derivatives.
(iii) For Neutrosophic Set/Logic/Probability and some of its derivatives, τ(x) is a triple
degree:
• degree of membership (or truth), 𝑡(𝑥);
• degree of indeterminacy (or neutrality), 𝑖(𝑥);
• and degree of nonmembership (or falsehood), 𝑓(𝑥).
As such, 𝜏(𝑥) = (𝑡(𝑥), 𝑖(𝑥), 𝑓(𝑥)), or 𝜏: 𝐴 → [0,1]3 .
(iv) For Refined Neutrosophic Set/Logic/Probability, and its derivatives, τ(x) is an q-tuple
degree ( q 1 ):
𝜏(𝑥) = (𝑡₁(𝑥), 𝑡₂(𝑥), . . . , 𝑡𝑝 (𝑥); 𝑖₁(𝑥), 𝑖₂(𝑥), . . . , 𝑖𝑟 (𝑥); 𝑓₁(𝑥), 𝑓₂(𝑥), . . . , 𝑓𝑠 (𝑥))
where 𝑡𝑗 (𝑥), 1 ≤ 𝑗 ≤ 𝑝, is type-𝑗 of membership (truth);
𝑖𝑘 (𝑥), 1 ≤ 𝑘 ≤ 𝑟, is type-𝑘 of indeterminacy (neutrality);
𝑓𝑙 (𝑥), 1 ≤ 𝑙 ≤ 𝑠, is type-𝑙 of nonmembership (falsehood),
with 𝑝 + 𝑟 + 𝑠 = 𝑞,
or 𝜏: 𝐴 → [0,1]𝑞 .
: A → Pn ([0,1]r )
: Pm ( A) → [0,1]r
: Pm ( A) → Pn ([0,1]r )
*
For non-classical Uncertain Theories, the unit interval [0, 1] is replaced by the non-unit interval
[ , ], where 0 1 .
: A → Pn ([ , ]r )
: Pm ( A) → [, ]r
: Pm ( A) → Pn ([, ]r )
: A → Pn ([0,1]r )
For example:
𝑡(𝑎1 ) = {0.2, 0.3, 0.4},
𝑓(𝑎1 ) = {0.1, 0.7}.
When 𝑡(𝑎), 𝑖(𝑎), 𝑓(𝑎) are any types of subsets of [0, 1]. For example:
𝑡(𝑎1 ) = [01. , 0.2] ∪ (0.5, 0.6),
𝑖(𝑎1 ) = {0.6, 0.7, 0.9},
𝑓(𝑎1 ) = [03. , 0.4] ∪ {0.50, 0.51, 0.52}.
This was the general definition [1995] of the Standard Neutrosophic Set. (The Non-
Standard Neutrosophic Set is not the subject of this paper.)
where 𝑡(𝑎), 𝑖(𝑎), 𝑓(𝑎) are intervals included in [0,1], for all 𝑎 ∈ 𝐴.
For example: 𝑡(𝑎₁) = [0.6, 0.7], 𝑖(𝑎₁) = [0.5, 0.6], 𝑓(𝑎₁) = [0.8, 1.0].
When 𝑡(𝑎), 𝑖(𝑎), 𝑓(𝑎) are hesitant discrete subsets of [0, 1]. For example:
𝑡(𝑎1 ) = {0.2, 0.3, 0.4},
𝑖(𝑎1 ) = {0.70, 0.75},
𝑓(𝑎1 ) = {0.5, 0.6, 0.7, 0.8}.
: Pm ( A) → [0,1]r
“Super” means that one considers the degree of a subset (not of a single element) of A.
- SuperFuzzy Set/Logic/Probability
τ: P(A) → [0,1]
but τ({a₁, a₂}) = t({a₁, a₂}) = 0.9, for example, which means that the membership/truth
degree of the whole subset {a₁, a₂} together being as a team is 0.9.
𝜏: 𝑃(𝐴) → [0,1]2 )
τ({𝑎1 , 𝑎2 }) = {t({𝑎1 , 𝑎2 }), f ({𝑎1 , 𝑎2 })} = { 0.5, 0.7 }, for example.
Or, t({𝑎1 , 𝑎2 }) = 0.5, and f({𝑎1 , 𝑎2 }) = 0.7.
- SuperNeutrosophic Set/Logic/Probability
: Pm ( A) → Pn ([0,1]r )
“Super” means that one considers the degree of a subset (not of a single element) of A.
While “Hyper” means that that the degree is a subset (not of a single element) of [0, 1].
- SuperHyperFuzzy Set/Logic/Probability
τ: P(A) → P([0,1])
but τ({a₁, a₂}) = t({a₁, a₂}) = [0.7, 0.8], for example.
𝜏: 𝑃(𝐴) → 𝑃([0,1]2 )
τ({𝑎1 , 𝑎2 }) = {t({𝑎1 , 𝑎2 }), f ({𝑎1 , 𝑎2 })} = { [0.7, 0.8], [0.9, 1.0] }, for example.
- SuperHyperNeutrosophic Set/Logic/Probability
𝜏: 𝐴 → 𝑃([−0.2, 1])
𝜏(𝑎₁) = 𝑡(𝑎₁) = [−0.1, 0.3], for example.
19. Conclusion
We have defined all Classical (and Non-Classical) HyperUncertain, SuperUncertain, and
References