Article Search
닫기

Original Article

Split Viewer

International Journal of Fuzzy Logic and Intelligent Systems 2024; 24(4): 387-398

Published online December 25, 2024

https://doi.org/10.5391/IJFIS.2024.24.4.387

© The Korean Institute of Intelligent Systems

Time-Shadow Soft Set: Concepts and Applications

Ayman A. Hazaymeh

Department of Mathematics, Faculty of Science, Jadara University, Irbid, Jordan

Correspondence to :
Ayman Hazaymeh (aymanha@jadara.edu.jo)

Received: March 8, 2023; Revised: August 20, 2024; Accepted: September 30, 2024

This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

In this study, we investigate the effect of the time component affects the application of fuzzy soft sets by extending the theory of soft sets to introduce the notion of time-shadow soft sets (Tsh − SS). In addition, we define and examine the characteristics of the fundamental operations-complement, union intersection, “AND,” and “OR.” Finally, we extend this idea to decision-making issues.

Keywords: Soft sets, Fuzzy soft sets, Time fuzzy soft sets, Shadow soft sets, Time-shadow soft sets

Most problems in different fields, such as engineering, medical science, economics, and the environment, involve various uncertainties. Molodtsov [1] defined soft set theory as a mathematical tool for addressing such uncertainties. Afterward, applications and soft-set operations were studied by Chen et al. [2], Maji et al. [3] and Maji et al. [4]. The concept of a fuzzy soft set, was introduced by Maji et al. [5] as a more general concept and as a combination of a fuzzy set and soft set, where they studied its properties. Furthermore, it exhibits control over factors that might affect membership values after application. Recently, researchers have begun researching the properties and applications of soft set theory. Several topics in the fuzzy relations of soft set theory that deal with uncertainties have also been studied in more detail by Shakhatreh and Qawasmeh [6]. Hazaymeh et al. [7] provided an overview of a fuzzy parameterized fuzzy soft expert set, which provides a membership value for each parameter in a set of parameters, and generalizes the fuzzy soft expert set. By integrating our research into different disciplines, we identified novel and significant subjects. For instance, we may incorporate the study of fuzzy soft sets into the findings of scholars such as [812]. The concept of soft and fuzzy soft expert sets, allows the user to know the opinions of all experts in a single model, as defined by [13] and [14]. The idea of a generalized fuzzy soft expert set with two and multiple opinions (four views) was presented by Hazaymeh et al. [15] as a generalization of fuzzy soft expert sets, which is more beneficial and effective. In addition, the authors of [16] presented the concepts of bipolar fuzzy soft sets and a domain of complex numbers. Bipolar complex fuzzy soft sets can translate bipolar fuzzy soft information into a mathematical formula while retaining the importance of information that may originate from different phases. To address decision-making issues, the notion of n-valued refined neutrosophic soft sets and their characteristics has been presented [17]. Roy and Maji [18] utilized this theory to solve decision-making problems. Furthermore, Hazaymeh [19] introduced the concept of a time-fuzzy soft set, which means that we take the component time value of the information into consideration when making decisions.

Hazaymeh [20] presented the concept of time-effective fuzzy soft sets as extensions of fuzzy soft sets. They also went over its basic workings and provided two examples of how this concept may be used in decision-making scenarios, and the second use that neurosophic membership provides. Subsequently, several scholars combined the idea of time fuzziness with fuzzy soft sets to create new concepts, as in [21] and [22]. The notation of the shadow soft set introduced in [23] is used to study its properties. In addition, they provided an example of the significance of shadow soft sets. This study introduces the notation of the time-shadow soft set, emphasizing its effectiveness in enhancing decision-making precision by incorporating the component time value of information. Furthermore, we define its basic operations, namely complement, union, and intersection, and investigate their properties. Finally, an application of this concept to decision-making problems is presented.

In this section, some basic concepts of soft set theory are introduced. Molodtsov [?] defined soft set over U in the following way. Let U be a universe set, E be a set of parameters, P(U) denote the power sets of U and AE.

Definition 2.1 [?]. Let us consider the mapping

F:VP(U).

Then any a pair (F, V ) is called a soft set over U. In other words, a soft set over U is a parameterized family of subsets of the universal set U. Therefore, for ɛV, F (ɛ) may be considered as the set of ɛ approximate elements of soft set (F, V ).

Definition 2.2 [5]. Let U be an initial universal set and E be a set of parameters. Let IU denote the power set of all fuzzy subsets of U. Let VE and F be mappings

F:VIU.

A pair (F,E) is called a fuzzy soft set over U.

Definition 2.3 [5]. For two fuzzy soft sets (F, V ) and (G,W) over U, (F, V ) is called a fuzzy soft subset of (G,W) if

  • 1. VW and

  • 2. ∀ɛV, F (ɛ) is fuzzy subset of G(ɛ).

This relationship is denoted as (F, V ) ⊆̃ (G,W). Here, (G,W) is called the fuzzy soft superset of (F, V ).

Definition 2.4 [5]. The complement of a fuzzy soft set (F, V ) is denoted by (F, V )c and is defined by (F, V )c = (Fc, ⌉V ) where Fc : ⌉VP(U) is a mapping given by

Fc(α)=c(F(α))αV,

where c denotes a fuzzy complement.

Definition 2.5 [5]. If (F, V ) and (G,W) are two fuzzy soft sets then “(F, V ) AND (G,W)” denoted by (F, V ) ∧ (G,W) is defined by

(F,V)(G,W)=(H,V×W),

such that H (α, β) = t (F (α) ,G(β)), ∀ (α, β) ∈ V × W, where t is any t-norm.

Definition 2.6 [5]. If (F, V ) and (G,W) are two fuzzy soft sets then “(F, V ) OR (G,W)” denoted by (F, V ) ∨ (G,W) is defined by

(F,V)(G,W)=(O,V×W),

such that O (α, β) = s (F (α) ,G(β)), ∀ (α, β) ∈ V × W, where s represents the s-norm.

Definition 2.7 [5]. The union of two fuzzy soft sets (F, V ) and (G,W) over a common universe U is the fuzzy soft set (H,Z) where Z = VW, and ∀ɛZ,

H(ɛ)={F(ɛ),if ɛV-W,G(ɛ),if ɛW-V,s(F(ɛ),G(ɛ)),if ɛVW,

where s is any s-norm.

Definition 2.8 [5]. The intersection of two fuzzy soft sets (F, V ) and (G,W) over a common universe U is the fuzzy soft set (Z,C) where Z = VW, and ∀ɛZ,

H(ɛ)={F(ɛ),if ɛV-W,G(ɛ),if ɛW-V,s(F(ɛ),G(ɛ)),if ɛVW.

Definition 2.9 [19]. Let U be an initial universal set and let E be a set of parameters. Let IU denote the power set of all fuzzy subsets of U, VE, and T be a set of times, where T = {t1, t2, ..., tn}. V collection of pairs (F,E)ttT is called a time-fuzzy soft set (T-FSS) over U where F is the mapping given by

Ft:VIU.

Definition 2.10 [19]. A time-fuzzy soft set (F, V )t over U is said to be a semi-null T-FSS denoted by Tφ if ∀tT and Ft (e) = φ for at least one e.

Definition 2.11 [19]. A time-fuzzy soft set (F, V )t over U is considered a null T-FSS denoted by Tφ if ∀tT, Ft (e) = φ ∀e.

Definition 2.12 [19]. A time-fuzzy soft set (F, V )t over U is considered a semi-absolute T-FSS denoted by TV if ∀tT and Ft (e) = 1̄ for at least one e.

Definition 2.13 [19]/ A time-fuzzy soft set (F, V )t over U is considered an absolute T-FSS denoted by TV if ∀tT and Ft (e) = 1̄ ∀e.

Definition 2.14 [19]. The complement of T-FSS (F, V )t is denoted by (F, V )ttT where is a fuzzy soft complement.

Definition 2.15 [23]. Let U = {x1, x2, ..., xn} be the universal set of elements, (F,E) is a fuzzy soft set over U, where F is a mapping given by F : EIU, E = {e1, e2, ..., em} be the set of parameters, and let shdw = {(α1, β1), (α2, β2), ..., (αm, βm)} be the shadow parameters set that is related to E. Let shdw(U) is the set of all shadow subsets on U. A pair (F,E)shdw is called a shadow soft set over U, where F is a mapping F(αii) : Eshdw(U), ∀i = 1, 2, ..., m. Thus, we define F(αii) as follows:

F(αi,βi)(ei)={xjfj(xj)},

i = 1, 2, ..., m, j = 1, 2, ..., n, where

fj(xj)={0,if μj(xj)α,1,if μj(xj)β,a,α<μj(xj)<β.

Definition 2.16 [23]. Let (F, V )shdw and (G,W)shdw be the two soft shadow sets over common universe U. (F, V )shdw is considered a shadow-soft subset of (G,W)shdw if AB; and F(e)shdw(x) ≤ G(e)shdw(x); ∀eA, xU. This is denoted as (F, V )shdw ⊆ (F, V )shdw, where 0 < [0, 1] < 1.

Definition 2.17 [23]. A null shadow soft set (φ,E)shdw over the common universe U is a shadow soft set with φ(e)shdw(x) = 0, ∀eE; xU.

Definition 2.18 [23]. An absolute shadow soft set (Φ,E)shdw over an the common universe U is a shadow soft set with Φ(e)shdw(x) = 1, ∀eE; xU.

Definition 2.19 [23]. A completely shadowed soft set (Ω, E)shdw over common universe U is a shadow soft set with Ω(e)shdw(x) = [0, 1], ∀eE; xU.

This section defines a time-shadow soft set and describes its basic properties. Parameters may include time values from previous information, which must be considered in decision-making. The concept of time-fuzzy shadow sets is introduced for each fuzzy shadow set, with operations, properties, and illustrative examples discussed.

Definition 3.1. Let U be a universe, E be a set of parameters, IU denote the power set of all fuzzy subsets of U, and T be a set of times, where T = {t1, t2, ..., tn}. Then, the pairs (Fti,Z) ∀tT are called time-fuzzy soft sets where

Fti(σ)={ujμF(ujti)},ujtiU,μFti[0,1],

tT and σZ = E × T, i = 1, 2, ..., m, j = 1, 2, ..., n.

Let (αi, βi) be given by an expert and define the time-shadow soft set (Tsh-ss in short) as a mapping

Fsh(αi,βi)ti:Z{0,1,[0,1]},

tT and σE × T, i = 1, 2, ..., m, j = 1, 2, ..., n. Here,

Fsh(αi,βi)ti(σ)={0,if μF(ujti)(σ)αi,1,if μF(ujti)(σ)βi,[0,1],αi<μF(ujti)(σ)<βi.

Example 3.1. Let U = {u1, u2, u3, u4} be a set of universe, E = {e1, e2, e3} is a set of parameters, and T = {t1, t2, t3} is a set of times. Define a function

Ft:AIU,

as follows:

F1(e1)={u1t10.6,u2t10.3,u3t10.2,u4t10.4},F1(e2)={u1t10.5,u2t10.3,u3t10.2,u4t10.7},F1(e3)={u1t10.3,u2t10.6,u3t10.8,u4t10.9},F2(e1)={u1t20.7,u2t20.4,u3t20.1,u4t20.3},F2(e2)={u1t20.5,u2t20.3,u3t20.2,u4t20.7},F2(e3)={u1t20.7,u2t20.8,u3t20.6,u4t20.4},F3(e1)={u1t30.7,u2t30.8,u3t30.6,u4t30.4},F3(e2)={u1t30.7,u2t30.5,u3t30.6,u4t30.7},F3(e3)={u1t30.3,u2t30.6,u3t30.8,u4t30.9}.

Let shdw = {(0.3, 0.8), (0.4, 0.9), (0.2, 0.6)} be the shadow parameter set related to Z. Define a function

Ftsh:AIU.

Subsequently, we can find the time-shadow soft sets (Fsh(αi,βi),Z) consisting of the following collection of approximations:

(Fsh(αi,βi),Z)={(e1,{u1[0,1],u20,u30,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u20,u30,u4[0,1]})(0.4,0.9)t1,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t1,(e1,{u1[0,1],u2[0,1],u30,u40})(0.3,0.8)t2,(e2,{u1[0,1],u20,u30,u4[0,1]})(0.4,0.9)t2,(e3,{u11,u21,u31,u4[0,1]})(0.2,0.6)t2,(e1,{u1[0,1],u21,u3[0,1],u4[0,1]})(0.3,0.8)t3,(e2,{u1[0,1],u2[0,1],u3[0,1],u4[0,1]})(0.4,0.9)t3,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t3}.

Here, a = [0, 1]

Definition 3.2. ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over U and shdw(U) = {(α1, β1), (α2, β2), ..., (αm, βm)}, ((F,A)sh(αi,βi),Z), is called the Tsh-SS subset of ((G,B)sh(αi,βi),Z) if

  • AB,

  • tT, εA, Ft (ε) is fuzzy soft subset of Gt (ε).

Definition 3.3. Two TshSSs, ((F,A)sh(αi,βi),Z]) and ((G,B)sh(αi,βi),Z) over U is said to be equal if ((F,A)sh(αi,βi),Z) is a TshSS subset of ((G,B)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) is a TshSS subset of ((F,A)sh(αi,βi),Z).

Example 3.2. Consider Example 3.1 and suppose that

((F,A)sh(αi,βi),Z)={(e1,{u11,u2[0,1],u30,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u2[0,1],u30,u41})(0.4,0.9)t1,(e2,{u1[0,1],u20,u3[0,1],u4[0,1]})(0.4,0.9)t2,(e3,{u11,u21,u31,u41})(0.2,0.6)t2,(e1,{u1[0,1],u21,u3[0,1],u41})(0.3,0.8)t3,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t3},((G,B)sh(αi,βi),Z)={(e2,{u1t10,u2t10,u3t10,u4t1[0,1]})(0.4,0.9)t1,(e3,{u1t21,u221,u3t21,u4t21})(0.2,0.6)t2,(e1,{u1t3[0,1],u2t31,u3t3[0,1],u4t30})(0.3,0.8)t3}.

Therefore ((G,B)sh(αi,βi),Z)((F,A)sh(αi,βi),Z).

Definition 3.4. A time-shadow soft set (F,A)tsh(αi,βi) over U is said to be semi-null TshSS denoted by Tshφ, if ∀tT, Ftsh (e) = φ for at least one e.

Definition 3.5. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered null TshSS denoted by Tshφ, if ∀tT, Ftsh(e) = φ ∀e.

Definition 3.6. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered semi-absolute TshSS denoted by TshA, if ∀tT, Ftsh (e) = 1̄ for at least one e.

Definition 3.7. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered absolute TshSS denoted by TshA, if ∀tT, Ftsh (e) = 1̄∀e.

Example 3.3. Consider Example 3.1. Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{Φ}t1),(e2(0.4,0.9),{u1t10,u2t1[0,1],u3t10,u4t1[0,1]}),(e3(0.2,0.6),{u1t10,u2t1[0,1],u3t1[0,1],u4t1[0,1]}),(e1(0.3,0.8),{Φ}t2),(e2(0.4,0.9),{u1t2[0,1],u2t2[0,1],u3t2[0,1],u4t20.3})(e3(0.4,0.9),{u1t20,u2t20,u3t20,u4t2[0,1]}),(e1(0.3,0.8),{Φ}t3),(e2(0.4,0.9),{u1t30,u2t3[0,1],u3t30,u4t30}),(e3(0.2,0.6),{u1t31,u2t3[0,1],u3t30,u4t30})}.

Then (F,A)tsh(αi,βi)=Tsh~φ.

Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{Φ}t1),(e2(0.4,0.9),{Φ}t1),(e3(0.2,0.8),{Φ}t1),(e1(0.3,0.8),{Φ}t2),(e2(0.4,0.9),{Φ}t2),(e3(0.2,0.6),{Φ}t2),(e1(0.3,0.8),{Φ}t3),(e2(0.4,0.9),{Φ}t3),(e3(0.2,0.6),{Φ}t3)}.

Then (F,A)tsh(αi,βi)=Tshφ.

(F,A)tsh   (αi,βi)={(e1(0.3,0.8),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t11,u2t11,u3t11,u4t11}),(e3(0.2,0.6),{u1t11,u2t11,u3t11,u4t11}),(e1(0.3,0.8),{u1t21,u2t21,u3t21,u4t21}),(e2(0.4,0.9),{u1t21,u2t21,u3t21,u4t21}),(e3(0.2,0.6),{u1t21,u2t21,u3t21,u4t21}),(e1(0.3,0.8),{u1t3[0,1],u2t31,u3t31,u4t3[0,1]}),(e2(0.4,0.9),{u1t30,u2t3[0,1],u3t30,u4t30}),(e3(0.2,0.6),{u1t3[0,1],u2t3[0,1],u3t30.2,u4t30})}.

Then (F,A)tsh(αi,βi)=Tsh~A.

Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t21,u2t21,u3t21,u4t21}),(e3(0.2,0.6),{u1t21,u2t21,u3t21,u4t21}),(e1(0.3,0.8),{u1t31,u2t31,u3t31,u4t31}),(e3(0.2,0.6),{u1t31,u2t31,u3t31,u4t31})}.

Then (F,A)tsh(αi,βi)=TshA.

3.1 Basic Operations

Here, we introduce some basic operations on the time-shadow soft set, namely complement, union, and intersection, and provide some properties related to these operations.

Definition 3.8. Let (Fsh(αi,βi),Z) be a time-shadowed soft set over U. Then the complement of (Fsh(αi,βi),Z), denoted by (Fsh(αi,βi),Z)c and is defined by (Fsh(αi,βi),Z)c=c(Fsh(αi,βi),Z), where c denotes a time-shadow soft complement.

Example 3.4. Consider a time-shadow soft set (Fsh(αi,βi),Z) over U as in Example 3.1. Subsequently, we can find the complement of (Fsh(αi,βi),Z) as follows:

(Fsh(αi,βi),Z)c={(e1,{u1[0,1],u21,u31,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u21,u31,u4[0,1]})(0.4,0.9)t1,(e3,{u1[0,1],u20,u30,u40})(0.2,0.8)t1,(e1,{u1[0,1],u2[0,1],u31,u41})(0.3,0.8)t2,(e2,{u1[0,1],u21,u31,u4[0,1]})(0.4,0.9)t2,(e3,{u10,u20,u30,u4[0,1]})(0.2,0.6)t2,(e1,{u1[0,1],u20,u3[0,1],u4[0,1]})(0.3,0.8)t3,(e2,{u1[0,1],u2[0,1],u3[0,1],u4[0,1]})(0.4,0.9)t3,(e3,{u1[0,1],u20,u31,u40})(0.2,0.6)t3}.

Proposition 3.1. Let (F,E)tsh(αi,βi) be a time-shadow soft set over U. Thus, the following holds.

((F,E)tsh(αi,βi)c)c=(F,E)tsh(αi,βi).

Proof. The proof of this is straightforward.

Definition 3.9. The union of two time-shadow soft sets ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over a common universe U and a time-shadow parameters set is a time-shadow soft set ((H,C)sh(αi,βi),Z), denoted by ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z), such that C = ABZ and defined as follows:

((H,C)sh(αi,βi),Z)(ɛ)={Ftsh(αi,βi)(ɛ),if ɛA-B,Gtsh(αi,βi)(ɛ),if ɛB-A,Ftsh(αi,βi)(ɛ)˜Gtsh(αi,βi)(ɛ),if ɛAB,

where Ũ denotes the time-shadow of the soft union.

Example 3.5. Consider Example 3.1. Suppose (F,A)tshand (G,B)tshare two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)=(e1(0.3,0.8),{u1t1[0,1]u2t10u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1]u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1]u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1]u2t31u3t31,u4t31})},(G,B)t(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t10}),(e3(0.2,0.6),{u1t2[0,1],u2t21,u3t21,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t30})},(H,C)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t20.5,u2t20.6,u3t20.9,u4t20.4}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.

Proposition 3.2. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TtshSSs over U. Subsequently, the following results hold.

  • 1. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z))=((F,A)tsh(αt,βt)˜(G,B)tsh(αi,βi))˜(H,C)tsh(αi,βi),

  • 2. ((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)=((F,A)sh(αi,βi),Z).

  • 3. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)=((G,B)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z).

  • 4. ((F,A)sh(αi,βi),Z)φtsh=((F,A)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Definition 3.10. The intersection of two time-shadow soft sets ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over a common universe U and a time-shadow parameters set is a time-shadow soft set ((H,C)sh(αi,βi),Z), denoted by ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z), such that C = ABZ and defined as follows:

((H,C)sh(αi,βi),Z)(ɛ)={Ftsh(αi,βi)(ɛ),if ɛA-B,Gtsh(αi,βi)(ɛ),if ɛB-A,Ftsh(αi,βi)(ɛ)˜Gtsh(αi,βi)(ɛ),if ɛAB,

where ∩̃ denotes the time-shadow of the soft union.

Example 3.6. Consider Example 3.1. Suppose (F,A)tsh and (G,B)tsh are two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})},(G,B)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t10}),(e3(0.2,0.6),{u1t2[0,1],u2t21,u3t21,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.(H,C)tsh={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t20.5,u2t20.6,u3t20.9,u4t20.4}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.

Proposition 3.3. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TtshSSs over U. Then, the following results hold.

  • 1. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z))=((F,A)tsh˜(G,B)tsh)˜(H,C)tsh.

  • 2. ((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)=((F,A)sh(αi,βi),Z).

  • 3. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)=((G,B)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z).

  • 4. ((F,A)sh(αi,βi),Z)φtsh((F,A)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Proposition 3.4. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TshSSs over U, then

  • 1. ((F,A)sh(αi,βi),Z)˜(((G,B)sh(αi,βi),Z)˜(H,C)tsh(αi,βi),Z)=((F,A)sh(αi,βi),Z)˜(˜((F,A)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z).

  • 2. ((F,A)sh(αi,βi),Z)˜(((G,B)sh(αi,βi),Z)˜(H,C)tsh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Proposition 3.5. If ((F,A)sh(αi,βi),Z) and ((G,)sh(αi,βi),Z) are two TshSSs over U, then

  • 1. ((F,A)tsh(αi,βi),Z)˜((G,B)tsh(αi,βi),Z)c=((F,A)tshc(αi,βi),Z)˜((G,B)tshc(αi,βi),Z).

  • 2. ((F,A)tsh(αi,βi),Z)˜((G,B)tsh(αi,βi),Z)c=((F,A)tshc(αi,βi),Z)˜((G,B)tshc(αi,βi),Z).

Proof. The proof of this is straightforward.

In this section, we introduce the definitions of “AND and OR” operations for TshSSs, derive their properties, and provide some examples.

Definition 4.1. If ((F,A)sh(αi,βi),Z)and ((G,B)sh(αi,βi),Z) are two TshSS values over the U then “ ((F,A)sh(αi,βi),Z) AND ((G,B)sh(αi,βi),Z) is denoted by ((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z) is defined as follows:

((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)=(H,A×B)tsh(αi,βi),Z))

such that H(α,β)tsh(αi,βi)=F(α)tsh(αi,βi)˜G(β)tsh(αi,βi), ∀(αi, βi) ∈ A × B, where ∩̃ is a time-shadow soft intersection.

Example 4.1. Consider Example 3.1. Suppose (F,A)tsh(αi,βi) and (G,B)tsh(αi,βi) are two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.7),{u1t1[0,1],u2t10,u3t10,u4t11}),(e2(0.4,0.7),{u1t20,u2t2[0,1],u3t21,u4t20}),e3(0.2,0.9),{u1t3[0,1],u2t3[0,1],u3t3[0,1],u4t31})},(G,B)tsh(αi,βi)=(e1(0.3,0.8),{u1t11,u2t1[0,1],andu3t10,u4t10}),(e3(0.2,0.9),{u1t2[0,1],u2t2[0,1],u3t2[0,1],u4t2[0,1]}),(e3(0.2,0.9),{u1t30,u2t2[0,1],u3t3[0,1],u4t31})}.

Then

(F,A)tsh(αi,βi)(G,B)tsh(αi,βi)=(H,A×B)tsh(αt,βt)={((e1t1,e1t1)(0.3,0.8),{u1t1,1[0,1],u2t1,10,u3t1,10,u4t1,10}),((e1t1,e3t2)(0.2,0.8),{u1t1,2[0,1],u2t1,2[0,1],u3t1,20,u4t1,2[0,1]}),((e1t1,e1t3)(0.2,0.8),{u1t1,30,u2t1,3[0,1],u3t1,30,u4t1,3[0,1]}),((e2t1,e1t1)(0.3,0.7),{u1t1,1[0,1],u2t1,10,u3t1,10,u4t1,10}),((e2t1,e3t2)(0.3,0.7),{u1t1,2[0,1],u2t1,20,u3t1,20,u4t1,21}),((e2t1,e3t3)(0.2,0.7),{u1t1,30,u2t1,3[0,1],u3t1,30,u4t1,31}),((e2t2,e1t1)(0.3,0.7),{u1t2,1[0,1],u2t2,1[0,1],u3t2,10,u4t2,10}),((e2t2,e3t2)(0.2,0.7),{u1t2,2[0,1],u2t2,2[0,1],u3t2,2[0,1],u4t2,2[0,1]}),((e2t2,e3t3)(0.2,0.7),{u1t2,30,u2t2,3[0,1],u3t2,31,u4t2,3[0,1]}),((e3t3,e1t1)(0.2,0.8),{u1t3,1[0,1],u2t3,1[0,1],u3t3,10,u4t3,10}),((e3t3,e3t2)(0.2,0.9),{u1t3,2[0,1],u2t3,20.6,u3t3,2[0,1],u4t3,2[0,1]}),((e3t3,e3t3)(0.2,0.3),{u1t3,30,u2t3,31,u3t3,31,u4t3,31})}.

Definition 4.2. If ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over U then “((F,A)sh(αi,βi),Z) OR ((G,B)sh(αi,βi),Z),” which is denoted by ((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z), is defined by

((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)=(H,A×B,)tsh(αi,βi,Z),

such that H(α,β)tsh(αi,βi)=F(α)tsh(αi,βi)˜G(β)tsh(αi,βi), ∀(αi, βi) ∈ A × B, where ũ is a time-shadow soft union.

Example 4.2. Consider Example 4.1 We have U then, “(F,A)sh(αi,βi) OR (G,B)sh(αi,βi)” denoted as (H,Csh(αi,βi))t=(F,A)sh(αi,βi)(G,B)sh(αi,βi) where

(H,C)sh(αi,βi)={((e1t1,e1t1)(0.3,0.8),{u1t1,11,u2t1,1[0,1],u3t1,10,u4t1,1[0,1]}),((e1t1,e3t2)(0.3,0.9),{u1t1,2[0,1],u2t1,2[0,1],u3t1,2[0,1],u4t1,2[0,1]})((e1t1,e3t3)(0.3,0.9),{u1t1,3[0,1],u2t1,3[0,1],u3t1,3[0,1],u4t1,31}),((e2t1,e1t1)(0.4,0.8),{u1t1,11,u2t1,1[0,1],u3t1,10,u4t1,1[0,1]}),((e2t1,e3t2)(0.4,0.9),{u1t1,2[0,1],u2t1,2[0,1],u3t1,2[0,1],u4t1,2[0,1]}),((e2t1,e3t3)(0.4,0.9),{u1t1,3[0,1],u2t1,3[0,1],u3t1,3[0,1],u4t1,31}),((e2t2,e1t1)(0.4,0.8),{u1t2,11,u2t2,1[0,1],u3t2,11,u4t2,10}),((e2t2,e3t2)(0.4,0.9),{u1t2,20,u2t2,2[0,1],u3t2,2[0,1],u4t2,2[0,1]}),((e2t2,e3t3)(0.4,0.9),{u1t2,30,u2t2,3[0,1],u3t2,3[0,1],u4t2,31}),((e3t3,e1t1)(0.3,0.9),{u1t3,1[0,1],u2t3,1[0,1],u3t3,1[0,1],u4t3,11}),((e3t3,e3t2)(0.2,0.9),{u1t3,2[0,1],u2t3,2[0,1],u3t3,2[0,1],u4t3,21}),((e3t3,e3t3)(0.2,0.9),{u1t3,30,u2t3,3[0,1],u3t3,3[0,1],u4t3,31})}.

Proposition 4.1. Let ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) be any two time-shadow soft sets. Subsequently, the following results hold.

  • 1. (((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z))c=((F,A)sh(αi,βi),Z)c((G,B)sh(αi,βi),Z)c.

  • 2. (((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z))c=((F,A)sh(αi,βi),Z)c((G,B)sh(αi,βi),Z)c.

Proof. Straightforward from Definitions 3.8, 4.1 and 4.2.

Proposition 4.2. Let ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) be any three shadow soft sets. Subsequently, the following results hold.

  • 1. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((H,C)sh(αi,βi)),Z).

  • 2. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((H,C)sh(αi,βi)),Z)).

  • 3. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((F,A)sh(αi,βi)),Z)((H,C)sh(αi,βi),Z).

  • 4. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((F,A)sh(αi,βi)),Z)((H,C)sh(αi,βi),Z)).

Proof. Straightforward from Definitions 4.1 and 4.2.

In this section, we apply the time-shadow soft set theory to a decision-making problem. Suppose that one of the broadcasting channels plans to invite experts to evaluate its show by discussing a controversial issue. The producers of the show used the following criteria to evaluate their findings: the four alternatives are U = {u1, u2, u3, u4}. Suppose there are five parameters E = {e1, e2, e3, e4, e5}, that choose the experts for the programs. For i = 1, 2, 3, 4, 5 the parameters ei (i = 1, 2, 3, 4, 5) stands for “this criteria to discriminate,” “this criterion is independent of the other criteria,” “this criteria measures one thing,” “the universal criteria,” and “the criteria that are important to some of the stakeholders.” T = {t1, t2, t3} is a set of previous time periods, and let shdw = {(0.3, 0.8), (0.4, 0.7), (0.3, 0.5), (0.4, 0.6), (0.3, 0.8)} be the shadow parameter set related to E. Based on these findings, we determined the most suitable choice. After extensive discussion, the committee constructed the following time-shadow soft set:

(F,E)t={(e1,{u1t10.6,u2t10.3,u3t10.2,u4t10.4}),(e2,{u1t10.5,u2t10.3,u3t10.2,u4t10.7}),(e3,{u1t10.3,u2t10.6,u3t10.8,u4t10.9}),(e4,{u1t10.5,u2t10.4,u3t10.6,u4t10.8}),(e5,{u1t10.9,u2t10.2,u3t10.4,u4t10.8}),(e1,{u1t20.7,u2t20.4,u3t20.1,u4t20.3}),(e2,{u1t20.3,u2t20.1,u3t20.2,u4t20.6}),(e3,{u1t20.7,u2t20.8,u3t20.6,u4t20.4}),(e4,{u1t20.9,u2t20.3,u3t20.4,u4t20.7}),(e5,{u1t20.2,u2t20.7,u3t20.8,u4t20.5}),(e1,{u1t30.7,u2t30.8,u3t30.6,u4t30.4}),(e2,{u1t30.7,u2t30.5,u3t30.6,u4t30.4}),(e3,{u1t30.6,u2t30.4,u3t30.5,u4t30.7}),(e4,{u1t30.6,u2t30.7,u3t30.5,u4t30.3}),(e5,{u1t30.7,u2t30.2,u3t30.6,u4t30.3}),},(F,E)sh(αt,βt)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.7),{u1t1[0,1],u2t10,u3t10,u4t11}),(e3(0.3,0.5),{u1t10,u2t11,u3t11,u4t11}),(e4(0.4,0.6),{u1t1[0,1],u2t10,u3t11,u4t11}),(e5(0.3,0.8),{u1t11,u2t10,u3t1[0,1],u4t11}),(e1(0.3,0.8),{u1t2[0,1],u2t2[0,1],u3t20,u4t20}),(e2(0.4,0.7),{u1t20,u2t20,u3t20,u4t2[0,1]}),(e3(0.3,0.5),{u1t21,u2t21,u3t21,u4t2[0]}),(e4(0.4,0.6),{u1t21,u2t20,u3t20,u4t21}),(e5(0.3,0.8),{u1t20,u2t2[0,1],u3t21,u4t2[0,1]}),(e1(0.3,0.8),{u1t3[0,1],u2t31,u3t3[0,1],u4t3[0,1]}),(e2(0.4,0.7),{u1t31,u2t3[0,1],u3t3[0,1],u4t30}),(e3(0.3,0.5),{u1t31,u2t3[0,1],u3t31,u4t31}),(e4(0.4,0.6),{u1t31,u2t31,u3t3[0,1],u4t30}),(e5(0.3,0.8),{u1t3[0,1],u2t30,u3t3[0,1],u4t30})}.

5.1 Algorithm

  • 1. Find the tabular representation of (F,E)t as in Table 1.

  • 2. Find the tabular representation of F (E) as in Table 2, where F (E) defined as follows:

    F(e)={ui=1ntiFt(e)\ni=1nFt(e):uU,eE}

    where n = |T|.

  • 3. Find the tabular representation of (F,E)tsh as in Table 3.

  • 4. Find the score of each element in U as in Table 4.

Table 4 shows that choice u3 has the highest acceptance score, whereas choice u4 has the highest waiting score, and there is no rejection choice.

This study introduced the time-shadow soft expert set concept and studied some of its properties. The complement, union, and intersection operations are defined on the time-fuzzy soft set. This theory is hypothetically applied to address decision-making problems.

Table. 1.

Table 1. Tabular representation of (F,E)t.

Uu1u2u3u4
(e1, t1)0.60.30.20.4
(e1, t2)0.70.40.10.3
(e1, t3)0.70.80.60.4
(e2, t1)0.50.30.20.7
(e2, t2)0.30.10.20.6
(e2, t3)0.70.50.60.4
(e3, t1)0.30.60.80.9
(e3, t2)0.70.80.60.4
(e3, t3)0.60.40.50.7
(e4, t1)0.50.40.60.8
(e4, t2)0.90.30.40.7
(e4, t3)0.60.70.50.3
(e5, t1)0.90.20.40.8
(e5, t2)0.20.70.80.5
(e5, t3)0.70.20.60.3

Table. 2.

Table 2. Tabular representation of F (E).

Uu1u2u3u4
e10.680.770.810.66
e20.510.660.800.60
e30.720.620.610.63
e40.680.930.640.49
e50.620.660.700.77

Table. 3.

Table 3. Tabular representation of (F,E)tsh.

Uu1u2u3u4
e1[0,1][0,1]1[0,1]
e2[0,1][0,1]1[0,1]
e31111
e4111[0,1]
e5[0,1][0,1][0,1][0,1]

Table. 4.

Table 4. Score table.

Ur1r[0,1]r0
u1230
u2230
u3410
u4140

  1. Molodtsov, D (1999). Soft set theory: first results. Computers & Mathematics with Applications. 37, 19-31. https://doi.org/10.1016/S0898-1221(99)00056-5
    CrossRef
  2. Chen, D, Tsang, ECC, Yeung, DS, and Wang, X (2005). The parameterization reduction of soft sets and its applications. Computers & Mathematics with Applications. 49, 757-763. https://doi.org/10.1016/j.camwa.2004.10.036
    CrossRef
  3. Maji, PK, Biswas, R, and Roy, AR (2003). Soft set theory. Computers & Mathematics with Applications. 45, 555-562. https://doi.org/10.1016/S0898-1221(03)00016-6
    CrossRef
  4. Maji, PK, Roy, AR, and Biswas, R (2022). An application of soft sets in a decision making problem. Computers & Mathematics with Applications. 44, 1077-1083. https://doi.org/10.1016/S0898-1221(02)00216-X
    CrossRef
  5. Maji, PK, Biswas, R, and Roy, AR (2001). Fuzzy soft sets. Journal of Fuzzy Mathematics. 9, 589-602.
  6. Shakhatreh, M, and Qawasmeh, T . Associativity of maxmin composition of three fuzzy relations., Proceedings of the 28th International Conference of The Jangion Mathematical Society (ICJMS), 2015, Antalya, Turkey.
  7. Hazaymeh, A, Abdullah, IB, Balkhi, Z, and Ibrahim, R (2012). Fuzzy parameterized fuzzy soft expert set. Applied Mathematical Sciences. 6, 5547-5564.
  8. Hazaymeh, A, Qazza, A, Hatamleh, R, Alomari, MW, and Saadeh, R (). On further refinements of numerical radius inequalities. Axioms. 12, 2023. article no 807
  9. Hazaymeh, A, Saadeh, R, Hatamleh, R, Alomari, MW, and Qazza, A (). A perturbed Milne’s quadrature rule for n-times differentiable functions with Lp-error estimates. Axioms. 12, 2023. article no 803
  10. Abuhijleh, EA, Massa’deh, M, Sheimat, A, and Alkouri, A (2021). Complex fuzzy groups based on Rosenfeld’s approach. WSEAS Transactions on Mathematics. 20, 368-377. https://doi.org/10.37394/23206.2021.20.38
    CrossRef
  11. Hazaymeh, AAM 2013. Fuzzy soft set and fuzzy soft expert set: some generalizations and hypothetical applications. Ph.D. dissertation. Universiti Sains Islam Malaysia, Negeri Sembilan. Malaysia. pp.397.
  12. Alsharo, D, Abuteen, E, Abd Ulazeez, MJS, Alkhasawneh, M, and Al-Zubi, FM (2024). Complex shadowed set theory and its application in decision-making problems. AIMS Mathematics. 9, 16810-16825. https://doi.org/10.3934/math.2024815
    CrossRef
  13. Alkhazaleh, S, and Salleh, AR (2011). Soft expert sets. Advances in Decision Sciences, 2011. article no 757868
  14. Alkhazaleh, S, and Salleh, AR (2014). Fuzzy soft expert set and its application. Applied Mathematics. 5, 1349-1368. https://doi.org/10.4236/am.2014.59127
    CrossRef
  15. Hazaymeh, AA, Abdullah, IB, Balkhi, ZT, and Ibrahim, RI (2012). Generalized fuzzy soft expert set. Journal of Applied Mathematics, 2012. article no 328195
  16. Alqaraleh, SM, Abd Ulazeez, MJS, Massa’deh, MO, Talafha, AG, and Bataihah, A (2022). Bipolar complex fuzzy soft sets and their application. International Journal of Fuzzy System Applications (IJFSA). 11, 1-23. https://doi.org/10.4018/IJFSA.285551
  17. Alkhazaleh, S, and Hazaymeh, AA (2018). N-valued refined neutrosophic soft sets and their applications in decision making problems and medical diagnosis. Journal of Artificial Intelligence and Soft Computing Research. 8, 79-86.
    CrossRef
  18. Roy, AR, and Maji, PK (2007). A fuzzy soft set theoretic approach to decision making problems. Journal of computational and Applied Mathematics. 203, 412-418. https://doi.org/10.1016/j.cam.2006.04.008
    CrossRef
  19. Hazaymeh, AA (2025). Time fuzzy soft sets and its application in design-making. International Journal of Neutrosophic Science. 25, 37-50. https://doi.org/10.54216/IJNS
    CrossRef
  20. Hazaymeh, A (2024). Time effective fuzzy soft set and its some applications with and without a neutrosophic. International Journal of Neutrosophic Science (IJNS). 23, 129-149. https://doi.org/10.54216/ijns.230211
    CrossRef
  21. Hazaymeh, AA (2025). Time factor’s impact on fuzzy soft expert sets. International Journal of Neutrosophic Science. 25, 155-176. https://doi.org/10.54216/ijns.250315
    CrossRef
  22. Alkhazaleh, S (2016). Time-neutrosophic soft set and its applications. Journal of Intelligent & Fuzzy Systems. 30, 1087-1098. https://doi.org/10.3233/IFS-151831
    CrossRef
  23. Alkhazaleh, S (2022). Shadow soft set theory. International Journal of Fuzzy Logic and Intelligent Systems. 22, 422-432. https://doi.org/10.5391/IJFIS.2022.22.4.422
    CrossRef

Ayman A. Hazaymeh is an associate professor of mathematics at Jadara University in Jordan. He received his M.A. degree from the Utara University of Malaysia (UUM) and his Ph.D. from the University Sains Islam Malaysia (USIM). He specializes in operation research, fuzzy sets, soft fuzzy sets, neutrosophic set, neutrosophic soft set; is interested in topics related to uncertainty; and has conducted extensive research in this field. He is currently working as a faculty member at the College of Science.

Article

Original Article

International Journal of Fuzzy Logic and Intelligent Systems 2024; 24(4): 387-398

Published online December 25, 2024 https://doi.org/10.5391/IJFIS.2024.24.4.387

Copyright © The Korean Institute of Intelligent Systems.

Time-Shadow Soft Set: Concepts and Applications

Ayman A. Hazaymeh

Department of Mathematics, Faculty of Science, Jadara University, Irbid, Jordan

Correspondence to:Ayman Hazaymeh (aymanha@jadara.edu.jo)

Received: March 8, 2023; Revised: August 20, 2024; Accepted: September 30, 2024

This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

In this study, we investigate the effect of the time component affects the application of fuzzy soft sets by extending the theory of soft sets to introduce the notion of time-shadow soft sets (Tsh − SS). In addition, we define and examine the characteristics of the fundamental operations-complement, union intersection, “AND,” and “OR.” Finally, we extend this idea to decision-making issues.

Keywords: Soft sets, Fuzzy soft sets, Time fuzzy soft sets, Shadow soft sets, Time-shadow soft sets

1. Introduction

Most problems in different fields, such as engineering, medical science, economics, and the environment, involve various uncertainties. Molodtsov [1] defined soft set theory as a mathematical tool for addressing such uncertainties. Afterward, applications and soft-set operations were studied by Chen et al. [2], Maji et al. [3] and Maji et al. [4]. The concept of a fuzzy soft set, was introduced by Maji et al. [5] as a more general concept and as a combination of a fuzzy set and soft set, where they studied its properties. Furthermore, it exhibits control over factors that might affect membership values after application. Recently, researchers have begun researching the properties and applications of soft set theory. Several topics in the fuzzy relations of soft set theory that deal with uncertainties have also been studied in more detail by Shakhatreh and Qawasmeh [6]. Hazaymeh et al. [7] provided an overview of a fuzzy parameterized fuzzy soft expert set, which provides a membership value for each parameter in a set of parameters, and generalizes the fuzzy soft expert set. By integrating our research into different disciplines, we identified novel and significant subjects. For instance, we may incorporate the study of fuzzy soft sets into the findings of scholars such as [812]. The concept of soft and fuzzy soft expert sets, allows the user to know the opinions of all experts in a single model, as defined by [13] and [14]. The idea of a generalized fuzzy soft expert set with two and multiple opinions (four views) was presented by Hazaymeh et al. [15] as a generalization of fuzzy soft expert sets, which is more beneficial and effective. In addition, the authors of [16] presented the concepts of bipolar fuzzy soft sets and a domain of complex numbers. Bipolar complex fuzzy soft sets can translate bipolar fuzzy soft information into a mathematical formula while retaining the importance of information that may originate from different phases. To address decision-making issues, the notion of n-valued refined neutrosophic soft sets and their characteristics has been presented [17]. Roy and Maji [18] utilized this theory to solve decision-making problems. Furthermore, Hazaymeh [19] introduced the concept of a time-fuzzy soft set, which means that we take the component time value of the information into consideration when making decisions.

Hazaymeh [20] presented the concept of time-effective fuzzy soft sets as extensions of fuzzy soft sets. They also went over its basic workings and provided two examples of how this concept may be used in decision-making scenarios, and the second use that neurosophic membership provides. Subsequently, several scholars combined the idea of time fuzziness with fuzzy soft sets to create new concepts, as in [21] and [22]. The notation of the shadow soft set introduced in [23] is used to study its properties. In addition, they provided an example of the significance of shadow soft sets. This study introduces the notation of the time-shadow soft set, emphasizing its effectiveness in enhancing decision-making precision by incorporating the component time value of information. Furthermore, we define its basic operations, namely complement, union, and intersection, and investigate their properties. Finally, an application of this concept to decision-making problems is presented.

2. Preliminaries

In this section, some basic concepts of soft set theory are introduced. Molodtsov [?] defined soft set over U in the following way. Let U be a universe set, E be a set of parameters, P(U) denote the power sets of U and AE.

Definition 2.1 [?]. Let us consider the mapping

F:VP(U).

Then any a pair (F, V ) is called a soft set over U. In other words, a soft set over U is a parameterized family of subsets of the universal set U. Therefore, for ɛV, F (ɛ) may be considered as the set of ɛ approximate elements of soft set (F, V ).

Definition 2.2 [5]. Let U be an initial universal set and E be a set of parameters. Let IU denote the power set of all fuzzy subsets of U. Let VE and F be mappings

F:VIU.

A pair (F,E) is called a fuzzy soft set over U.

Definition 2.3 [5]. For two fuzzy soft sets (F, V ) and (G,W) over U, (F, V ) is called a fuzzy soft subset of (G,W) if

  • 1. VW and

  • 2. ∀ɛV, F (ɛ) is fuzzy subset of G(ɛ).

This relationship is denoted as (F, V ) ⊆̃ (G,W). Here, (G,W) is called the fuzzy soft superset of (F, V ).

Definition 2.4 [5]. The complement of a fuzzy soft set (F, V ) is denoted by (F, V )c and is defined by (F, V )c = (Fc, ⌉V ) where Fc : ⌉VP(U) is a mapping given by

Fc(α)=c(F(α))αV,

where c denotes a fuzzy complement.

Definition 2.5 [5]. If (F, V ) and (G,W) are two fuzzy soft sets then “(F, V ) AND (G,W)” denoted by (F, V ) ∧ (G,W) is defined by

(F,V)(G,W)=(H,V×W),

such that H (α, β) = t (F (α) ,G(β)), ∀ (α, β) ∈ V × W, where t is any t-norm.

Definition 2.6 [5]. If (F, V ) and (G,W) are two fuzzy soft sets then “(F, V ) OR (G,W)” denoted by (F, V ) ∨ (G,W) is defined by

(F,V)(G,W)=(O,V×W),

such that O (α, β) = s (F (α) ,G(β)), ∀ (α, β) ∈ V × W, where s represents the s-norm.

Definition 2.7 [5]. The union of two fuzzy soft sets (F, V ) and (G,W) over a common universe U is the fuzzy soft set (H,Z) where Z = VW, and ∀ɛZ,

H(ɛ)={F(ɛ),if ɛV-W,G(ɛ),if ɛW-V,s(F(ɛ),G(ɛ)),if ɛVW,

where s is any s-norm.

Definition 2.8 [5]. The intersection of two fuzzy soft sets (F, V ) and (G,W) over a common universe U is the fuzzy soft set (Z,C) where Z = VW, and ∀ɛZ,

H(ɛ)={F(ɛ),if ɛV-W,G(ɛ),if ɛW-V,s(F(ɛ),G(ɛ)),if ɛVW.

Definition 2.9 [19]. Let U be an initial universal set and let E be a set of parameters. Let IU denote the power set of all fuzzy subsets of U, VE, and T be a set of times, where T = {t1, t2, ..., tn}. V collection of pairs (F,E)ttT is called a time-fuzzy soft set (T-FSS) over U where F is the mapping given by

Ft:VIU.

Definition 2.10 [19]. A time-fuzzy soft set (F, V )t over U is said to be a semi-null T-FSS denoted by Tφ if ∀tT and Ft (e) = φ for at least one e.

Definition 2.11 [19]. A time-fuzzy soft set (F, V )t over U is considered a null T-FSS denoted by Tφ if ∀tT, Ft (e) = φ ∀e.

Definition 2.12 [19]. A time-fuzzy soft set (F, V )t over U is considered a semi-absolute T-FSS denoted by TV if ∀tT and Ft (e) = 1̄ for at least one e.

Definition 2.13 [19]/ A time-fuzzy soft set (F, V )t over U is considered an absolute T-FSS denoted by TV if ∀tT and Ft (e) = 1̄ ∀e.

Definition 2.14 [19]. The complement of T-FSS (F, V )t is denoted by (F, V )ttT where is a fuzzy soft complement.

Definition 2.15 [23]. Let U = {x1, x2, ..., xn} be the universal set of elements, (F,E) is a fuzzy soft set over U, where F is a mapping given by F : EIU, E = {e1, e2, ..., em} be the set of parameters, and let shdw = {(α1, β1), (α2, β2), ..., (αm, βm)} be the shadow parameters set that is related to E. Let shdw(U) is the set of all shadow subsets on U. A pair (F,E)shdw is called a shadow soft set over U, where F is a mapping F(αii) : Eshdw(U), ∀i = 1, 2, ..., m. Thus, we define F(αii) as follows:

F(αi,βi)(ei)={xjfj(xj)},

i = 1, 2, ..., m, j = 1, 2, ..., n, where

fj(xj)={0,if μj(xj)α,1,if μj(xj)β,a,α<μj(xj)<β.

Definition 2.16 [23]. Let (F, V )shdw and (G,W)shdw be the two soft shadow sets over common universe U. (F, V )shdw is considered a shadow-soft subset of (G,W)shdw if AB; and F(e)shdw(x) ≤ G(e)shdw(x); ∀eA, xU. This is denoted as (F, V )shdw ⊆ (F, V )shdw, where 0 < [0, 1] < 1.

Definition 2.17 [23]. A null shadow soft set (φ,E)shdw over the common universe U is a shadow soft set with φ(e)shdw(x) = 0, ∀eE; xU.

Definition 2.18 [23]. An absolute shadow soft set (Φ,E)shdw over an the common universe U is a shadow soft set with Φ(e)shdw(x) = 1, ∀eE; xU.

Definition 2.19 [23]. A completely shadowed soft set (Ω, E)shdw over common universe U is a shadow soft set with Ω(e)shdw(x) = [0, 1], ∀eE; xU.

3. Time-Shadow Soft Set

This section defines a time-shadow soft set and describes its basic properties. Parameters may include time values from previous information, which must be considered in decision-making. The concept of time-fuzzy shadow sets is introduced for each fuzzy shadow set, with operations, properties, and illustrative examples discussed.

Definition 3.1. Let U be a universe, E be a set of parameters, IU denote the power set of all fuzzy subsets of U, and T be a set of times, where T = {t1, t2, ..., tn}. Then, the pairs (Fti,Z) ∀tT are called time-fuzzy soft sets where

Fti(σ)={ujμF(ujti)},ujtiU,μFti[0,1],

tT and σZ = E × T, i = 1, 2, ..., m, j = 1, 2, ..., n.

Let (αi, βi) be given by an expert and define the time-shadow soft set (Tsh-ss in short) as a mapping

Fsh(αi,βi)ti:Z{0,1,[0,1]},

tT and σE × T, i = 1, 2, ..., m, j = 1, 2, ..., n. Here,

Fsh(αi,βi)ti(σ)={0,if μF(ujti)(σ)αi,1,if μF(ujti)(σ)βi,[0,1],αi<μF(ujti)(σ)<βi.

Example 3.1. Let U = {u1, u2, u3, u4} be a set of universe, E = {e1, e2, e3} is a set of parameters, and T = {t1, t2, t3} is a set of times. Define a function

Ft:AIU,

as follows:

F1(e1)={u1t10.6,u2t10.3,u3t10.2,u4t10.4},F1(e2)={u1t10.5,u2t10.3,u3t10.2,u4t10.7},F1(e3)={u1t10.3,u2t10.6,u3t10.8,u4t10.9},F2(e1)={u1t20.7,u2t20.4,u3t20.1,u4t20.3},F2(e2)={u1t20.5,u2t20.3,u3t20.2,u4t20.7},F2(e3)={u1t20.7,u2t20.8,u3t20.6,u4t20.4},F3(e1)={u1t30.7,u2t30.8,u3t30.6,u4t30.4},F3(e2)={u1t30.7,u2t30.5,u3t30.6,u4t30.7},F3(e3)={u1t30.3,u2t30.6,u3t30.8,u4t30.9}.

Let shdw = {(0.3, 0.8), (0.4, 0.9), (0.2, 0.6)} be the shadow parameter set related to Z. Define a function

Ftsh:AIU.

Subsequently, we can find the time-shadow soft sets (Fsh(αi,βi),Z) consisting of the following collection of approximations:

(Fsh(αi,βi),Z)={(e1,{u1[0,1],u20,u30,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u20,u30,u4[0,1]})(0.4,0.9)t1,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t1,(e1,{u1[0,1],u2[0,1],u30,u40})(0.3,0.8)t2,(e2,{u1[0,1],u20,u30,u4[0,1]})(0.4,0.9)t2,(e3,{u11,u21,u31,u4[0,1]})(0.2,0.6)t2,(e1,{u1[0,1],u21,u3[0,1],u4[0,1]})(0.3,0.8)t3,(e2,{u1[0,1],u2[0,1],u3[0,1],u4[0,1]})(0.4,0.9)t3,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t3}.

Here, a = [0, 1]

Definition 3.2. ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over U and shdw(U) = {(α1, β1), (α2, β2), ..., (αm, βm)}, ((F,A)sh(αi,βi),Z), is called the Tsh-SS subset of ((G,B)sh(αi,βi),Z) if

  • AB,

  • tT, εA, Ft (ε) is fuzzy soft subset of Gt (ε).

Definition 3.3. Two TshSSs, ((F,A)sh(αi,βi),Z]) and ((G,B)sh(αi,βi),Z) over U is said to be equal if ((F,A)sh(αi,βi),Z) is a TshSS subset of ((G,B)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) is a TshSS subset of ((F,A)sh(αi,βi),Z).

Example 3.2. Consider Example 3.1 and suppose that

((F,A)sh(αi,βi),Z)={(e1,{u11,u2[0,1],u30,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u2[0,1],u30,u41})(0.4,0.9)t1,(e2,{u1[0,1],u20,u3[0,1],u4[0,1]})(0.4,0.9)t2,(e3,{u11,u21,u31,u41})(0.2,0.6)t2,(e1,{u1[0,1],u21,u3[0,1],u41})(0.3,0.8)t3,(e3,{u1[0,1],u21,u31,u41})(0.2,0.6)t3},((G,B)sh(αi,βi),Z)={(e2,{u1t10,u2t10,u3t10,u4t1[0,1]})(0.4,0.9)t1,(e3,{u1t21,u221,u3t21,u4t21})(0.2,0.6)t2,(e1,{u1t3[0,1],u2t31,u3t3[0,1],u4t30})(0.3,0.8)t3}.

Therefore ((G,B)sh(αi,βi),Z)((F,A)sh(αi,βi),Z).

Definition 3.4. A time-shadow soft set (F,A)tsh(αi,βi) over U is said to be semi-null TshSS denoted by Tshφ, if ∀tT, Ftsh (e) = φ for at least one e.

Definition 3.5. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered null TshSS denoted by Tshφ, if ∀tT, Ftsh(e) = φ ∀e.

Definition 3.6. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered semi-absolute TshSS denoted by TshA, if ∀tT, Ftsh (e) = 1̄ for at least one e.

Definition 3.7. A time-shadow soft set (F,A)tsh(αi,βi) over U is considered absolute TshSS denoted by TshA, if ∀tT, Ftsh (e) = 1̄∀e.

Example 3.3. Consider Example 3.1. Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{Φ}t1),(e2(0.4,0.9),{u1t10,u2t1[0,1],u3t10,u4t1[0,1]}),(e3(0.2,0.6),{u1t10,u2t1[0,1],u3t1[0,1],u4t1[0,1]}),(e1(0.3,0.8),{Φ}t2),(e2(0.4,0.9),{u1t2[0,1],u2t2[0,1],u3t2[0,1],u4t20.3})(e3(0.4,0.9),{u1t20,u2t20,u3t20,u4t2[0,1]}),(e1(0.3,0.8),{Φ}t3),(e2(0.4,0.9),{u1t30,u2t3[0,1],u3t30,u4t30}),(e3(0.2,0.6),{u1t31,u2t3[0,1],u3t30,u4t30})}.

Then (F,A)tsh(αi,βi)=Tsh~φ.

Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{Φ}t1),(e2(0.4,0.9),{Φ}t1),(e3(0.2,0.8),{Φ}t1),(e1(0.3,0.8),{Φ}t2),(e2(0.4,0.9),{Φ}t2),(e3(0.2,0.6),{Φ}t2),(e1(0.3,0.8),{Φ}t3),(e2(0.4,0.9),{Φ}t3),(e3(0.2,0.6),{Φ}t3)}.

Then (F,A)tsh(αi,βi)=Tshφ.

(F,A)tsh   (αi,βi)={(e1(0.3,0.8),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t11,u2t11,u3t11,u4t11}),(e3(0.2,0.6),{u1t11,u2t11,u3t11,u4t11}),(e1(0.3,0.8),{u1t21,u2t21,u3t21,u4t21}),(e2(0.4,0.9),{u1t21,u2t21,u3t21,u4t21}),(e3(0.2,0.6),{u1t21,u2t21,u3t21,u4t21}),(e1(0.3,0.8),{u1t3[0,1],u2t31,u3t31,u4t3[0,1]}),(e2(0.4,0.9),{u1t30,u2t3[0,1],u3t30,u4t30}),(e3(0.2,0.6),{u1t3[0,1],u2t3[0,1],u3t30.2,u4t30})}.

Then (F,A)tsh(αi,βi)=Tsh~A.

Let

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t11,u2t11,u3t11,u4t11}),(e2(0.4,0.9),{u1t21,u2t21,u3t21,u4t21}),(e3(0.2,0.6),{u1t21,u2t21,u3t21,u4t21}),(e1(0.3,0.8),{u1t31,u2t31,u3t31,u4t31}),(e3(0.2,0.6),{u1t31,u2t31,u3t31,u4t31})}.

Then (F,A)tsh(αi,βi)=TshA.

3.1 Basic Operations

Here, we introduce some basic operations on the time-shadow soft set, namely complement, union, and intersection, and provide some properties related to these operations.

Definition 3.8. Let (Fsh(αi,βi),Z) be a time-shadowed soft set over U. Then the complement of (Fsh(αi,βi),Z), denoted by (Fsh(αi,βi),Z)c and is defined by (Fsh(αi,βi),Z)c=c(Fsh(αi,βi),Z), where c denotes a time-shadow soft complement.

Example 3.4. Consider a time-shadow soft set (Fsh(αi,βi),Z) over U as in Example 3.1. Subsequently, we can find the complement of (Fsh(αi,βi),Z) as follows:

(Fsh(αi,βi),Z)c={(e1,{u1[0,1],u21,u31,u4[0,1]})(0.3,0.8)t1,(e2,{u1[0,1],u21,u31,u4[0,1]})(0.4,0.9)t1,(e3,{u1[0,1],u20,u30,u40})(0.2,0.8)t1,(e1,{u1[0,1],u2[0,1],u31,u41})(0.3,0.8)t2,(e2,{u1[0,1],u21,u31,u4[0,1]})(0.4,0.9)t2,(e3,{u10,u20,u30,u4[0,1]})(0.2,0.6)t2,(e1,{u1[0,1],u20,u3[0,1],u4[0,1]})(0.3,0.8)t3,(e2,{u1[0,1],u2[0,1],u3[0,1],u4[0,1]})(0.4,0.9)t3,(e3,{u1[0,1],u20,u31,u40})(0.2,0.6)t3}.

Proposition 3.1. Let (F,E)tsh(αi,βi) be a time-shadow soft set over U. Thus, the following holds.

((F,E)tsh(αi,βi)c)c=(F,E)tsh(αi,βi).

Proof. The proof of this is straightforward.

Definition 3.9. The union of two time-shadow soft sets ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over a common universe U and a time-shadow parameters set is a time-shadow soft set ((H,C)sh(αi,βi),Z), denoted by ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z), such that C = ABZ and defined as follows:

((H,C)sh(αi,βi),Z)(ɛ)={Ftsh(αi,βi)(ɛ),if ɛA-B,Gtsh(αi,βi)(ɛ),if ɛB-A,Ftsh(αi,βi)(ɛ)˜Gtsh(αi,βi)(ɛ),if ɛAB,

where Ũ denotes the time-shadow of the soft union.

Example 3.5. Consider Example 3.1. Suppose (F,A)tshand (G,B)tshare two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)=(e1(0.3,0.8),{u1t1[0,1]u2t10u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1]u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1]u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1]u2t31u3t31,u4t31})},(G,B)t(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t10}),(e3(0.2,0.6),{u1t2[0,1],u2t21,u3t21,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t30})},(H,C)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t20.5,u2t20.6,u3t20.9,u4t20.4}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.

Proposition 3.2. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TtshSSs over U. Subsequently, the following results hold.

  • 1. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z))=((F,A)tsh(αt,βt)˜(G,B)tsh(αi,βi))˜(H,C)tsh(αi,βi),

  • 2. ((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)=((F,A)sh(αi,βi),Z).

  • 3. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)=((G,B)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z).

  • 4. ((F,A)sh(αi,βi),Z)φtsh=((F,A)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Definition 3.10. The intersection of two time-shadow soft sets ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over a common universe U and a time-shadow parameters set is a time-shadow soft set ((H,C)sh(αi,βi),Z), denoted by ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z), such that C = ABZ and defined as follows:

((H,C)sh(αi,βi),Z)(ɛ)={Ftsh(αi,βi)(ɛ),if ɛA-B,Gtsh(αi,βi)(ɛ),if ɛB-A,Ftsh(αi,βi)(ɛ)˜Gtsh(αi,βi)(ɛ),if ɛAB,

where ∩̃ denotes the time-shadow of the soft union.

Example 3.6. Consider Example 3.1. Suppose (F,A)tsh and (G,B)tsh are two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})},(G,B)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t1[0,1],u3t10,u4t10}),(e3(0.2,0.6),{u1t2[0,1],u2t21,u3t21,u4t2[0,1]}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.(H,C)tsh={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.9),{u1t2[0,1],u2t20,u3t20,u4t2[0,1]}),(e3(0.2,0.6),{u1t20.5,u2t20.6,u3t20.9,u4t20.4}),(e3(0.2,0.6),{u1t3[0,1],u2t31,u3t31,u4t31})}.

Proposition 3.3. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TtshSSs over U. Then, the following results hold.

  • 1. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z))=((F,A)tsh˜(G,B)tsh)˜(H,C)tsh.

  • 2. ((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)=((F,A)sh(αi,βi),Z).

  • 3. ((F,A)sh(αi,βi),Z)˜((G,B)sh(αi,βi),Z)=((G,B)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z).

  • 4. ((F,A)sh(αi,βi),Z)φtsh((F,A)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Proposition 3.4. If ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) are three TshSSs over U, then

  • 1. ((F,A)sh(αi,βi),Z)˜(((G,B)sh(αi,βi),Z)˜(H,C)tsh(αi,βi),Z)=((F,A)sh(αi,βi),Z)˜(˜((F,A)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z).

  • 2. ((F,A)sh(αi,βi),Z)˜(((G,B)sh(αi,βi),Z)˜(H,C)tsh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)˜((F,A)sh(αi,βi),Z)˜((H,C)sh(αi,βi),Z).

Proof. The proof of this is straightforward.

Proposition 3.5. If ((F,A)sh(αi,βi),Z) and ((G,)sh(αi,βi),Z) are two TshSSs over U, then

  • 1. ((F,A)tsh(αi,βi),Z)˜((G,B)tsh(αi,βi),Z)c=((F,A)tshc(αi,βi),Z)˜((G,B)tshc(αi,βi),Z).

  • 2. ((F,A)tsh(αi,βi),Z)˜((G,B)tsh(αi,βi),Z)c=((F,A)tshc(αi,βi),Z)˜((G,B)tshc(αi,βi),Z).

Proof. The proof of this is straightforward.

4. AND and OR Operations

In this section, we introduce the definitions of “AND and OR” operations for TshSSs, derive their properties, and provide some examples.

Definition 4.1. If ((F,A)sh(αi,βi),Z)and ((G,B)sh(αi,βi),Z) are two TshSS values over the U then “ ((F,A)sh(αi,βi),Z) AND ((G,B)sh(αi,βi),Z) is denoted by ((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z) is defined as follows:

((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)=(H,A×B)tsh(αi,βi),Z))

such that H(α,β)tsh(αi,βi)=F(α)tsh(αi,βi)˜G(β)tsh(αi,βi), ∀(αi, βi) ∈ A × B, where ∩̃ is a time-shadow soft intersection.

Example 4.1. Consider Example 3.1. Suppose (F,A)tsh(αi,βi) and (G,B)tsh(αi,βi) are two time-shadow soft sets over U such that

(F,A)tsh(αi,βi)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.7),{u1t1[0,1],u2t10,u3t10,u4t11}),(e2(0.4,0.7),{u1t20,u2t2[0,1],u3t21,u4t20}),e3(0.2,0.9),{u1t3[0,1],u2t3[0,1],u3t3[0,1],u4t31})},(G,B)tsh(αi,βi)=(e1(0.3,0.8),{u1t11,u2t1[0,1],andu3t10,u4t10}),(e3(0.2,0.9),{u1t2[0,1],u2t2[0,1],u3t2[0,1],u4t2[0,1]}),(e3(0.2,0.9),{u1t30,u2t2[0,1],u3t3[0,1],u4t31})}.

Then

(F,A)tsh(αi,βi)(G,B)tsh(αi,βi)=(H,A×B)tsh(αt,βt)={((e1t1,e1t1)(0.3,0.8),{u1t1,1[0,1],u2t1,10,u3t1,10,u4t1,10}),((e1t1,e3t2)(0.2,0.8),{u1t1,2[0,1],u2t1,2[0,1],u3t1,20,u4t1,2[0,1]}),((e1t1,e1t3)(0.2,0.8),{u1t1,30,u2t1,3[0,1],u3t1,30,u4t1,3[0,1]}),((e2t1,e1t1)(0.3,0.7),{u1t1,1[0,1],u2t1,10,u3t1,10,u4t1,10}),((e2t1,e3t2)(0.3,0.7),{u1t1,2[0,1],u2t1,20,u3t1,20,u4t1,21}),((e2t1,e3t3)(0.2,0.7),{u1t1,30,u2t1,3[0,1],u3t1,30,u4t1,31}),((e2t2,e1t1)(0.3,0.7),{u1t2,1[0,1],u2t2,1[0,1],u3t2,10,u4t2,10}),((e2t2,e3t2)(0.2,0.7),{u1t2,2[0,1],u2t2,2[0,1],u3t2,2[0,1],u4t2,2[0,1]}),((e2t2,e3t3)(0.2,0.7),{u1t2,30,u2t2,3[0,1],u3t2,31,u4t2,3[0,1]}),((e3t3,e1t1)(0.2,0.8),{u1t3,1[0,1],u2t3,1[0,1],u3t3,10,u4t3,10}),((e3t3,e3t2)(0.2,0.9),{u1t3,2[0,1],u2t3,20.6,u3t3,2[0,1],u4t3,2[0,1]}),((e3t3,e3t3)(0.2,0.3),{u1t3,30,u2t3,31,u3t3,31,u4t3,31})}.

Definition 4.2. If ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) over U then “((F,A)sh(αi,βi),Z) OR ((G,B)sh(αi,βi),Z),” which is denoted by ((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z), is defined by

((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)=(H,A×B,)tsh(αi,βi,Z),

such that H(α,β)tsh(αi,βi)=F(α)tsh(αi,βi)˜G(β)tsh(αi,βi), ∀(αi, βi) ∈ A × B, where ũ is a time-shadow soft union.

Example 4.2. Consider Example 4.1 We have U then, “(F,A)sh(αi,βi) OR (G,B)sh(αi,βi)” denoted as (H,Csh(αi,βi))t=(F,A)sh(αi,βi)(G,B)sh(αi,βi) where

(H,C)sh(αi,βi)={((e1t1,e1t1)(0.3,0.8),{u1t1,11,u2t1,1[0,1],u3t1,10,u4t1,1[0,1]}),((e1t1,e3t2)(0.3,0.9),{u1t1,2[0,1],u2t1,2[0,1],u3t1,2[0,1],u4t1,2[0,1]})((e1t1,e3t3)(0.3,0.9),{u1t1,3[0,1],u2t1,3[0,1],u3t1,3[0,1],u4t1,31}),((e2t1,e1t1)(0.4,0.8),{u1t1,11,u2t1,1[0,1],u3t1,10,u4t1,1[0,1]}),((e2t1,e3t2)(0.4,0.9),{u1t1,2[0,1],u2t1,2[0,1],u3t1,2[0,1],u4t1,2[0,1]}),((e2t1,e3t3)(0.4,0.9),{u1t1,3[0,1],u2t1,3[0,1],u3t1,3[0,1],u4t1,31}),((e2t2,e1t1)(0.4,0.8),{u1t2,11,u2t2,1[0,1],u3t2,11,u4t2,10}),((e2t2,e3t2)(0.4,0.9),{u1t2,20,u2t2,2[0,1],u3t2,2[0,1],u4t2,2[0,1]}),((e2t2,e3t3)(0.4,0.9),{u1t2,30,u2t2,3[0,1],u3t2,3[0,1],u4t2,31}),((e3t3,e1t1)(0.3,0.9),{u1t3,1[0,1],u2t3,1[0,1],u3t3,1[0,1],u4t3,11}),((e3t3,e3t2)(0.2,0.9),{u1t3,2[0,1],u2t3,2[0,1],u3t3,2[0,1],u4t3,21}),((e3t3,e3t3)(0.2,0.9),{u1t3,30,u2t3,3[0,1],u3t3,3[0,1],u4t3,31})}.

Proposition 4.1. Let ((F,A)sh(αi,βi),Z) and ((G,B)sh(αi,βi),Z) be any two time-shadow soft sets. Subsequently, the following results hold.

  • 1. (((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z))c=((F,A)sh(αi,βi),Z)c((G,B)sh(αi,βi),Z)c.

  • 2. (((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z))c=((F,A)sh(αi,βi),Z)c((G,B)sh(αi,βi),Z)c.

Proof. Straightforward from Definitions 3.8, 4.1 and 4.2.

Proposition 4.2. Let ((F,A)sh(αi,βi),Z),((G,B)sh(αi,βi),Z) and ((H,C)sh(αi,βi),Z) be any three shadow soft sets. Subsequently, the following results hold.

  • 1. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((H,C)sh(αi,βi)),Z).

  • 2. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((H,C)sh(αi,βi)),Z)).

  • 3. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((F,A)sh(αi,βi)),Z)((H,C)sh(αi,βi),Z).

  • 4. (((F,A)sh(αi,βi),Z)(((G,B)sh(αi,βi),Z)((H,C)sh(αi,βi),Z)=(((F,A)sh(αi,βi),Z)((G,B)sh(αi,βi),Z)(((F,A)sh(αi,βi)),Z)((H,C)sh(αi,βi),Z)).

Proof. Straightforward from Definitions 4.1 and 4.2.

5. An Application of Time-Shadow Soft Set in Decision-Making

In this section, we apply the time-shadow soft set theory to a decision-making problem. Suppose that one of the broadcasting channels plans to invite experts to evaluate its show by discussing a controversial issue. The producers of the show used the following criteria to evaluate their findings: the four alternatives are U = {u1, u2, u3, u4}. Suppose there are five parameters E = {e1, e2, e3, e4, e5}, that choose the experts for the programs. For i = 1, 2, 3, 4, 5 the parameters ei (i = 1, 2, 3, 4, 5) stands for “this criteria to discriminate,” “this criterion is independent of the other criteria,” “this criteria measures one thing,” “the universal criteria,” and “the criteria that are important to some of the stakeholders.” T = {t1, t2, t3} is a set of previous time periods, and let shdw = {(0.3, 0.8), (0.4, 0.7), (0.3, 0.5), (0.4, 0.6), (0.3, 0.8)} be the shadow parameter set related to E. Based on these findings, we determined the most suitable choice. After extensive discussion, the committee constructed the following time-shadow soft set:

(F,E)t={(e1,{u1t10.6,u2t10.3,u3t10.2,u4t10.4}),(e2,{u1t10.5,u2t10.3,u3t10.2,u4t10.7}),(e3,{u1t10.3,u2t10.6,u3t10.8,u4t10.9}),(e4,{u1t10.5,u2t10.4,u3t10.6,u4t10.8}),(e5,{u1t10.9,u2t10.2,u3t10.4,u4t10.8}),(e1,{u1t20.7,u2t20.4,u3t20.1,u4t20.3}),(e2,{u1t20.3,u2t20.1,u3t20.2,u4t20.6}),(e3,{u1t20.7,u2t20.8,u3t20.6,u4t20.4}),(e4,{u1t20.9,u2t20.3,u3t20.4,u4t20.7}),(e5,{u1t20.2,u2t20.7,u3t20.8,u4t20.5}),(e1,{u1t30.7,u2t30.8,u3t30.6,u4t30.4}),(e2,{u1t30.7,u2t30.5,u3t30.6,u4t30.4}),(e3,{u1t30.6,u2t30.4,u3t30.5,u4t30.7}),(e4,{u1t30.6,u2t30.7,u3t30.5,u4t30.3}),(e5,{u1t30.7,u2t30.2,u3t30.6,u4t30.3}),},(F,E)sh(αt,βt)={(e1(0.3,0.8),{u1t1[0,1],u2t10,u3t10,u4t1[0,1]}),(e2(0.4,0.7),{u1t1[0,1],u2t10,u3t10,u4t11}),(e3(0.3,0.5),{u1t10,u2t11,u3t11,u4t11}),(e4(0.4,0.6),{u1t1[0,1],u2t10,u3t11,u4t11}),(e5(0.3,0.8),{u1t11,u2t10,u3t1[0,1],u4t11}),(e1(0.3,0.8),{u1t2[0,1],u2t2[0,1],u3t20,u4t20}),(e2(0.4,0.7),{u1t20,u2t20,u3t20,u4t2[0,1]}),(e3(0.3,0.5),{u1t21,u2t21,u3t21,u4t2[0]}),(e4(0.4,0.6),{u1t21,u2t20,u3t20,u4t21}),(e5(0.3,0.8),{u1t20,u2t2[0,1],u3t21,u4t2[0,1]}),(e1(0.3,0.8),{u1t3[0,1],u2t31,u3t3[0,1],u4t3[0,1]}),(e2(0.4,0.7),{u1t31,u2t3[0,1],u3t3[0,1],u4t30}),(e3(0.3,0.5),{u1t31,u2t3[0,1],u3t31,u4t31}),(e4(0.4,0.6),{u1t31,u2t31,u3t3[0,1],u4t30}),(e5(0.3,0.8),{u1t3[0,1],u2t30,u3t3[0,1],u4t30})}.

5.1 Algorithm

  • 1. Find the tabular representation of (F,E)t as in Table 1.

  • 2. Find the tabular representation of F (E) as in Table 2, where F (E) defined as follows:

    F(e)={ui=1ntiFt(e)\ni=1nFt(e):uU,eE}

    where n = |T|.

  • 3. Find the tabular representation of (F,E)tsh as in Table 3.

  • 4. Find the score of each element in U as in Table 4.

Table 4 shows that choice u3 has the highest acceptance score, whereas choice u4 has the highest waiting score, and there is no rejection choice.

6. Conclusion

This study introduced the time-shadow soft expert set concept and studied some of its properties. The complement, union, and intersection operations are defined on the time-fuzzy soft set. This theory is hypothetically applied to address decision-making problems.

Acknowledgments

The authors acknowledge the financial support received from Jadara University.

Conflict of Interest

No potential conflict of interest relevant to this article was reported.

Table 1 . Tabular representation of (F,E)t.

Uu1u2u3u4
(e1, t1)0.60.30.20.4
(e1, t2)0.70.40.10.3
(e1, t3)0.70.80.60.4
(e2, t1)0.50.30.20.7
(e2, t2)0.30.10.20.6
(e2, t3)0.70.50.60.4
(e3, t1)0.30.60.80.9
(e3, t2)0.70.80.60.4
(e3, t3)0.60.40.50.7
(e4, t1)0.50.40.60.8
(e4, t2)0.90.30.40.7
(e4, t3)0.60.70.50.3
(e5, t1)0.90.20.40.8
(e5, t2)0.20.70.80.5
(e5, t3)0.70.20.60.3

Table 2 . Tabular representation of F (E).

Uu1u2u3u4
e10.680.770.810.66
e20.510.660.800.60
e30.720.620.610.63
e40.680.930.640.49
e50.620.660.700.77

Table 3 . Tabular representation of (F,E)tsh.

Uu1u2u3u4
e1[0,1][0,1]1[0,1]
e2[0,1][0,1]1[0,1]
e31111
e4111[0,1]
e5[0,1][0,1][0,1][0,1]

Table 4 . Score table.

Ur1r[0,1]r0
u1230
u2230
u3410
u4140

References

  1. Molodtsov, D (1999). Soft set theory: first results. Computers & Mathematics with Applications. 37, 19-31. https://doi.org/10.1016/S0898-1221(99)00056-5
    CrossRef
  2. Chen, D, Tsang, ECC, Yeung, DS, and Wang, X (2005). The parameterization reduction of soft sets and its applications. Computers & Mathematics with Applications. 49, 757-763. https://doi.org/10.1016/j.camwa.2004.10.036
    CrossRef
  3. Maji, PK, Biswas, R, and Roy, AR (2003). Soft set theory. Computers & Mathematics with Applications. 45, 555-562. https://doi.org/10.1016/S0898-1221(03)00016-6
    CrossRef
  4. Maji, PK, Roy, AR, and Biswas, R (2022). An application of soft sets in a decision making problem. Computers & Mathematics with Applications. 44, 1077-1083. https://doi.org/10.1016/S0898-1221(02)00216-X
    CrossRef
  5. Maji, PK, Biswas, R, and Roy, AR (2001). Fuzzy soft sets. Journal of Fuzzy Mathematics. 9, 589-602.
  6. Shakhatreh, M, and Qawasmeh, T . Associativity of maxmin composition of three fuzzy relations., Proceedings of the 28th International Conference of The Jangion Mathematical Society (ICJMS), 2015, Antalya, Turkey.
  7. Hazaymeh, A, Abdullah, IB, Balkhi, Z, and Ibrahim, R (2012). Fuzzy parameterized fuzzy soft expert set. Applied Mathematical Sciences. 6, 5547-5564.
  8. Hazaymeh, A, Qazza, A, Hatamleh, R, Alomari, MW, and Saadeh, R (). On further refinements of numerical radius inequalities. Axioms. 12, 2023. article no 807
  9. Hazaymeh, A, Saadeh, R, Hatamleh, R, Alomari, MW, and Qazza, A (). A perturbed Milne’s quadrature rule for n-times differentiable functions with Lp-error estimates. Axioms. 12, 2023. article no 803
  10. Abuhijleh, EA, Massa’deh, M, Sheimat, A, and Alkouri, A (2021). Complex fuzzy groups based on Rosenfeld’s approach. WSEAS Transactions on Mathematics. 20, 368-377. https://doi.org/10.37394/23206.2021.20.38
    CrossRef
  11. Hazaymeh, AAM 2013. Fuzzy soft set and fuzzy soft expert set: some generalizations and hypothetical applications. Ph.D. dissertation. Universiti Sains Islam Malaysia, Negeri Sembilan. Malaysia. pp.397.
  12. Alsharo, D, Abuteen, E, Abd Ulazeez, MJS, Alkhasawneh, M, and Al-Zubi, FM (2024). Complex shadowed set theory and its application in decision-making problems. AIMS Mathematics. 9, 16810-16825. https://doi.org/10.3934/math.2024815
    CrossRef
  13. Alkhazaleh, S, and Salleh, AR (2011). Soft expert sets. Advances in Decision Sciences, 2011. article no 757868
  14. Alkhazaleh, S, and Salleh, AR (2014). Fuzzy soft expert set and its application. Applied Mathematics. 5, 1349-1368. https://doi.org/10.4236/am.2014.59127
    CrossRef
  15. Hazaymeh, AA, Abdullah, IB, Balkhi, ZT, and Ibrahim, RI (2012). Generalized fuzzy soft expert set. Journal of Applied Mathematics, 2012. article no 328195
  16. Alqaraleh, SM, Abd Ulazeez, MJS, Massa’deh, MO, Talafha, AG, and Bataihah, A (2022). Bipolar complex fuzzy soft sets and their application. International Journal of Fuzzy System Applications (IJFSA). 11, 1-23. https://doi.org/10.4018/IJFSA.285551
  17. Alkhazaleh, S, and Hazaymeh, AA (2018). N-valued refined neutrosophic soft sets and their applications in decision making problems and medical diagnosis. Journal of Artificial Intelligence and Soft Computing Research. 8, 79-86.
    CrossRef
  18. Roy, AR, and Maji, PK (2007). A fuzzy soft set theoretic approach to decision making problems. Journal of computational and Applied Mathematics. 203, 412-418. https://doi.org/10.1016/j.cam.2006.04.008
    CrossRef
  19. Hazaymeh, AA (2025). Time fuzzy soft sets and its application in design-making. International Journal of Neutrosophic Science. 25, 37-50. https://doi.org/10.54216/IJNS
    CrossRef
  20. Hazaymeh, A (2024). Time effective fuzzy soft set and its some applications with and without a neutrosophic. International Journal of Neutrosophic Science (IJNS). 23, 129-149. https://doi.org/10.54216/ijns.230211
    CrossRef
  21. Hazaymeh, AA (2025). Time factor’s impact on fuzzy soft expert sets. International Journal of Neutrosophic Science. 25, 155-176. https://doi.org/10.54216/ijns.250315
    CrossRef
  22. Alkhazaleh, S (2016). Time-neutrosophic soft set and its applications. Journal of Intelligent & Fuzzy Systems. 30, 1087-1098. https://doi.org/10.3233/IFS-151831
    CrossRef
  23. Alkhazaleh, S (2022). Shadow soft set theory. International Journal of Fuzzy Logic and Intelligent Systems. 22, 422-432. https://doi.org/10.5391/IJFIS.2022.22.4.422
    CrossRef

Share this article on :

Related articles in IJFIS