SlideShare a Scribd company logo
International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 224
Intuitionistic Fuzzy Semipre Generalized Connected
Spaces
M. Thirumalaiswamy
Department of Mathematics,
NGM College, Pollachi-642001,
Tamil Nadu, India
K. M. Arifmohammed
Department of Mathematics,
NGM College, Pollachi-642001,
Tamil Nadu, India
Abstract : In this paper, we introduce the notion of intuitionistic fuzzy semipre generalized connected space, intuitionistic
fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected
spaces. We investigate some of their properties.
Keywords : Intuitionistic fuzzy topology, intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy
semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces
2010 Mathematical Subject Classification: 54A40, 03F55
1. INTRODUCTION
In 1965, Zadeh [11] introduced fuzzy sets and
in 1968, Chang [2] introduced fuzzy topology. After the
introduction of fuzzy set and fuzzy topology, several
authors were conducted on the generalization of this
notion. The notion of intuitionistic fuzzy sets was
introduced by Atanassov [1] as a generalization of fuzzy
sets. 1997, Coker [3] introduced the concept of
intuitionistic fuzzy topological spaces. In this paper, we
introduce the notion of intuitionistic fuzzy semipre
generalized connected space, intuitionistic fuzzy semipre
generalized super connected space and intuitionistic
fuzzy semipre generalized extremally disconnected
spaces. And study some of their properties.
2. PRELIMINARIES
Definition 2.1:[1] Let X be a non-empty fixed set. An
intuitionistic fuzzy set (IFS in short) A in X is an object
having the form A = {〈 x, µA(x), νA(x)〉 / x ∈ X} where
the functions µA: X → [0, 1] and νA : X → [0, 1]
denote the degree of membership (namely µA(x)) and the
degree of non-membership (namely νA(x)) of each
element x ∈ X to the set A respectively and 0 ≤ µA(x) +
νA(x) ≤ 1 for each x ∈ X. Denote by IFS(X), the set of
all intuitionistic fuzzy sets in X.
Definition 2.2:[1] Let A and B be IFSs of the form A =
{〈 x, µA(x), νA(x)〉 / x ∈ X} and B = {〈 x, µB(x),
νB(x)〉 / x ∈ X}. Then
1. A ⊆ B if and only if µA(x) ≤ µB(x) and νA(x)
≥ νB(x) for all x ∈ X
2. A = B if and only if A ⊆ B and B ⊆ A
3. Ac = {〈 x, νA(x), µA(x)〉 / x ∈ X }
4. A ∩ B = {〈 x, µA(x) ∧ µB(x), νA(x) ∨
νB(x)〉 / x ∈ X}
5. A ∪ B = {〈 x, µA(x) ∨ µB(x), νA(x) ∧
νB(x)〉 / x ∈ X}
For the sake of simplicity, we shall use the notation A =
〈 x, µA, νA〉 instead of A = {〈 x, µA(x), νA(x)〉 / x ∈
X}. Also for the sake of simplicity, we shall use the
notation A = 〈 x, (µA, µB), (νA, νB)〉 instead of A =
〈 x, (A/μA, B/μB), (A/νA, B/νB)〉 . The intuitionistic
fuzzy sets 0~ = {〈 x, 0, 1〉 / x ∈ X} and 1~ = {〈 x, 1,
0〉 / x ∈ X} are respectively the empty set and the whole
set of X.
Definition 2.3:[3] An intuitionistic fuzzy topology (IFT
in short) on X is a family τ of IFSs in X satisfying the
following axioms:
1. 0~, 1~ ∈ τ
2. G1 ∩ G2 ∈ τ, for every G1, G2 ∈ τ
3. ∪ Gi ∈ τ for any family {Gi / i ∈ J} ⊆ τ
In this case the pair (X, τ) is called an intuitionistic fuzzy
topological space(IFTS in short) and any IFS in τ is
known as an intuitionistic fuzzy open set(IFOS in
short)in X. The complement Ac of an IFOS A in an IFTS
(X, τ) is called an intuitionistic fuzzy closed set (IFCS in
short) in X.
Definition 2.4:[3] Let (X, τ) be an IFTS and A = 〈 x,
µA, νA〉 be an IFS in X. Then
1. int(A) = ∪{ G / G is an IFOS in X and G ⊆ A
}
2. cl(A) = ∩{ K / K is an IFCS in X and A ⊆ K }
3. cl(Ac) = (int(A))c
4. int(Ac) = (cl(A))c
Definition 2.5:[10] An IFS A of an IFTS (X, τ) is an
International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 225
1. intuitionistic fuzzy semipre closed set (IFSPCS
for short) if there exists an IFPCS B such that int(B) ⊆ A
⊆ B
2. intuitionistic fuzzy semipre open set (IFSPOS
for short) if there exists an IFPOS B such that B ⊆ A ⊆
cl(B)
Definition 2.6:[4] Let A be an IFS in an IFTS (X, τ).
Then
1. spint (A) = ∪{ G / G is an IFSPOS in X and G
⊆ A }
2. spcl (A) = ∩{ K / K is an IFSPCS in X and A
⊆ K }
Note that for any IFS A in (X, τ), we have spcl(Ac) =
(spint(A))c and spint(Ac) = (spcl(A))c .
Definition 2.7:[7] An IFS A in an IFTS (X, τ) is said to
be an intuitionistic fuzzy semipre generalized closed set
(IFSPGCS for short) if spcl(A) ⊆ U whenever A ⊆ U
and U is an IFSOS in (X, τ).
The family of all IFSPGCSs of an IFTS (X, τ) is denoted
by IFSPGC(X). Every IFCS and IFSPCS is an IFSPGCS
but the converses are not true in general.
Definition 2.8:[5] The complement Ac of an IFSPGCS
A in an IFTS (X, τ) is called an intuitionistic fuzzy
semipre generalized open set (IFSPGOS for short) in X.
The family of all IFSPGOSs of an IFTS (X, τ) is denoted
by IFSPGO(X). Every IFOS and IFSPOS is an IFSPGOS
but the converses are not true in general.
Definition 2.9:[9] Let A be an IFS in an IFTS (X, τ).
Then semipre generalized interior of A (spgint(A) for
short) and semipre generalized closure of A (spgcl(A) for
short) are defined by
1. spgint (A) = ∪{ G / G is an IFSPGOS in X and
G ⊆ A }
2. spgcl (A) = ∩{ K / K is an IFSPGCS in X and
A ⊆ K }
Note that for any IFS A in (X, τ), we have spgcl(Ac) =
(spgint(A))c and spgint(Ac) = (spgcl(A))c.
Definition 2.10:[5] An IFTS(X, τ) is said to be an
intuitionistic fuzzy semipre T*1/2 space (IFSPT*1/2
space for short) if every IFSPGCS is an IFCS in (X, τ).
Definition 2.11:[8] A mapping f : (X, τ) → (Y, σ) is
called an intuitionistic fuzzy semipre generalized
continuous (IFSPG continuous for short) mappings if f -
1(V) is an IFSPGCS in (X, τ) for every IFCS V of (Y, σ).
Definition 2.12:[8] A mapping f: (X, τ) → (Y, σ) be an
intuitionistic fuzzy semipre generalized irresolute
(IFSPG irresolute) mapping if f -1(V) is an IFSPGCS in
(X, τ) for every IFSPGCS V of (Y, σ).
Definition 2.13:[4] Two IFSs A and B are said to be q-
coincident (A q B in short) if and only if there exists an
element x ∈ X such that µA(x) > νB(x) or νA(x) <
µB(x).
Definition 2.14:[4] Two IFSs A and B are said to be not
q-coincident (A qc B in short) if and only if A ⊆ Bc.
Definition 2.15:[6] An IFTS (X, τ ) is said to be an
intuitionistic fuzzy C5-connected (IFC5-connected for
short) space if the only IFSs which are both intuitionistic
fuzzy open and intuitionistic fuzzy closed are 0∼ and
1∼.
3. INTUITIONISTIC FUZZY
SEMIPRE GENERALIZED
CONNECTED SPACES
Definition 3.1: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized connected space
(IFSPG connected space for short) if the only IFSs which
are both an IFSPGOS and an IFSPGCS are 0~ and 1~.
Theorem 3.2: Every IFSPG connected space is IFC5-
connected but not conversely.
Proof: Let (X, τ) be an IFSPG connected space. Suppose
(X, τ) is not IFC5-connected, then there exists a proper
IFS A which is both an IFOS and an IFCS in (X, τ). That
is, A is both an IFSPGOS and an IFSPGCS in (X, τ).
This implies that (X, τ) is not IFSPG connected. This is a
contradiction. Therefore (X, τ) must be an IFC5-
connected space.
Example 3.3: Let X = {a, b} and G = 〈 x, (0.5, 0.6),
(0.5, 0.4)〉 . Then τ = {0~, G, 1~} is an IFT on X. Then
X is an IFC5-connected space but not IFSPG connected,
since the IFS A = 〈 x, (0.5, 0.7), (0.5, 0.3)〉 in X is both
an IFSPGCS and an IFSPGOS in X.
Theorem 3.4: An IFTS (X, τ) is an IFSPG connected
space if and only if there exists no non-zero IFSPGOSs
A and B in (X, τ) such that B = Ac, B = (spcl(A))c, A =
(spcl(B))c.
Proof: Necessity: Assume that there exist IFSs A and B
such that A ≠ 0~ ≠ B, B = Ac, B = (spcl(A))c, A =
(spcl(B))c. Since (spcl(A))c and (spcl(B))c are
IFSPGOSs in (X, τ), A and B are IFSPGOSs in (X, τ).
This implies (X, τ) is not IFSPG connected, which is a
contradiction. Therefore there exists no non-zero
IFSPGOSs A and B in (X, τ) such that B = Ac, B =
(spcl(A))c, A = (spcl(B))c.
Sufficiency: Let A be both an IFSPGOS and an
IFSPGCS in (X, τ) such that 1~ ≠ A ≠ 0~. Now by taking
B = Ac, we obtain a contradiction to our hypothesis.
Hence (X, τ) is an IFSPG connected space.
Theorem 3.5: Let (X, τ) be an IFSPT*1/2 space, then the
following statements are equivalent:
(i) (X, τ) is an IFSPG connected space,
International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 226
(ii) (X, τ) is an IFC5-connected space.
Proof: (i) ⇒ (ii) is obvious by Theorem 3.2.
(ii) ⇒ (i) Let (X, τ) be an IFC5-connected space. Suppose
(X, τ) is not IFSPG connected, then there exists a proper
IFS A in (X, τ) which is both an IFSPGOS and an
IFSPGCS in (X, τ). But since (X, τ) is an IFSPT*1/2
space, A is both an IFOS and an IFCS in (X, τ). This
implies that (X, τ) is not IFC5-connected, which is a
contradiction to our hypothesis. Therefore (X, τ) must be
an IFSPG connected space.
Theorem 3.6: If f : (X, τ) → (Y, σ) is an IFSPG
continuous surjection and (X, τ) is an IFSPG connected
space, then (Y, σ) is an IFC5-connected space.
Proof: Let (X, τ) be an IFSPG connected space. Suppose
(Y, σ) is not IFC5-connected, then there exists a proper
IFS A which is both an IFOS and an IFCS in (Y, σ).
Since f is an IFSPG continuous mapping, f -1(A) is both
an IFSPGOS and an IFSPGCS in (X, τ). But this is a
contradiction to our hypothesis. Hence (Y, σ) must be an
IFC5- connected space.
Theorem 3.7: If f : (X, τ) → (Y, σ) is an IFSPG
irresolute surjection and (X, τ) is an IFSPG connected
space, then (Y, σ) is also an IFSPG connected space.
Proof: Suppose (Y, σ) is not an IFSPG connected space,
then there exists a proper IFS A such that A is both an
IFSPGOS and an IFSPGCS in (Y, σ). Since f is an
IFSPG irresolute surjection, f -1(A) is both an IFSPGOS
and an IFSPGCS in (X, τ). But this is a contradiction to
our hypothesis. Hence (Y, σ) must be an IFSPG
connected space.
Definition 3.8: An IFTS (X, τ) is IFSPG connected
between two IFSs A and B if there is no IFSPGOS E in
(X, τ) such that A ⊆ E and E qc B.
Example 3.9: Let X = {a, b} and G = 〈 x, (0.5, 0.4),
(0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A
= 〈 x, (0.5, 0.4), (0.5, 0.3)〉 and B = 〈 x, (0.5, 0.4), (0.5,
0.5)〉 be two IFSs in X. Hence (X, τ) is IFSPG
connected between the IFSs A and B.
Theorem 3.10: If an IFTS (X, τ) is IFSPG connected
between two IFSs A and B, then it is IFC5-connected
between A and B but the converse may not be true in
general.
Proof: Suppose (X, τ) is not IFC5-connected between A
and B, then there exists an IFOS E in (X, τ) such that A
⊆ E and E qc B. Since every IFOS is an IFSPGOS, there
exists an IFSPGOS E in (X, τ) such that A ⊆ E and E qc
B. This implies (X, τ) is not IFSPG connected between A
and B, a contradiction to our hypothesis. Therefore (X,
τ) must be IFC5-connected between A and B.
Example 3.11: Let X = {a, b} and G = 〈 x, (0.5, 0.4),
(0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A
= 〈 x, (0.4, 0.4), (0.6, 0.6)〉 and B = 〈 x, (0.3, 0.3), (0.4,
0.4)〉 be two IFSs in X. Then X is IFC5-connected
between A and B, since there exists no IFOS E in X such
that A ⊆ E and E q B. But it is not IFSPG connected
between the two IFS A and B, since there exists an
IFSPGOS E = 〈 x, (0.4, 0.4), (0.5, 0.5) 〉 in X such that
A ⊆ E and E q B.
Theorem 3.12: If an IFTS (X, τ) is IFSPG connected
between A and B and A ⊆ A1, B ⊆ B1, then (X, τ) is
IFSPG connected between A1 and B1.
Proof: Suppose that (X, τ) is not IFSPG connected
between A1 and B1, then by Definition 3.8, there exists
an IFSPGOS E in (X, τ) such that A1 ⊆ E and E qc B1.
This implies E ⊆ B1c. A1 ⊆ E implies A ⊆ A1 ⊆ E.
That is A ⊆ E. Now let us prove that E ⊆ Bc, that is E qc
B. Suppose that E q B, then by Definition 2.13, there
exists an element x in X such that µE(x) > νB(x) and
νE(x) < µB(x). Therefore µE(x) > νB(x) > νB1(x) and
νE(x) < µB(x) < µB1(x), since B ⊆ B1. Hence µE(x) >
µB1(x) and νE(x) < νB1(x). Thus E q B1. That is E q
B1, which is a contradiction. Therefore E qc B. That is
E ⊆ Bc. Hence (X, τ) is not IFSPG connected between A
and B, which is a contradiction to our hypothesis. Thus
(X, τ) must be IFSPG connected between A1 and B1.
Theorem 3.13: Let (X, τ) be an IFTS and A and B be
IFSs in (X, τ). If A q B, then (X, τ) is IFSPG connected
between A and B.
Proof: Suppose (X, τ) is not IFSPG connected between
A and B. Then there exists an IFSPGOS E in (X, τ) such
that A ⊆ E and E ⊆ Bc. This implies that A ⊆ Bc. That
is A qc B. But this is a contradiction to our hypothesis.
Therefore (X, τ) is must be IFSPG connected between A
and B.
Definition 3.14: An IFSPGOS A is an intuitionistic
fuzzy regular semipre generalized open set (IFRSPGOS
for short) if A = spgint(spgcl(A)). The complement of an
IFRSPGOS is called an intuitionistic fuzzy regular
semipre generalized closed set (IFRSPGCS for short).
Definition 3.15: An IFTS (X, τ) is called an intuitionistic
fuzzy semipre generalized (IFSPG for short) super
connected space if there exists no proper IFRSPGOS in
(X, τ).
Theorem 3.16: Let (X, τ) be an IFTS. Then the
following statements are equivalent:
(i) (X, τ) is an IFSPG super connected space
(ii) For every non-zero IFSPGOS A, spgcl(A) = 1~
(iii) For every IFSPGCS A with A ≠ 1~, spgint(A) =
0~
(iv) There exists no IFSPGOSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, A ⊆ Bc
(v) There exists no IFSPGOSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, B = (spgcl(A))c, A = (spgcl(B))c
(vi) There exists no IFSPGCSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, B = (spgint(A))c, A =
(spgint(B))c
International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 227
Proof: (i) ⇒ (ii) Assume that there exists an IFSPGOS A
in (X, τ) such that A ≠ 0~ and spgcl(A) ≠ 1~. Now let B
= spgint(spgcl(A))c. Then B is a proper IFRSPGOS in
(X, τ), which is conradiction. Therefore spgcl(A) = 1~.
(ii) ⇒ (iii) Let A ≠ 1~ be an IFSPGCS in (X, τ). If B =
Ac, then B is an IFSPGOS in (X, τ) with B ≠ 0~. Hence
spgcl(B) = 1~. This implies (spgcl(B))c = 0~. That is
spgint(Bc) = 0~. Hence spgint(A) = 0~.
(iii) ⇒ (iv) Suppose A and B be two IFSPGOSs in (X, τ)
such that A ≠ 0~ ≠ B and A ⊆ Bc. Then Bc is an
IFSPGCS in (X, τ) and B ≠ 0~ implies Bc ≠ 1~. By
hypothesis spgint(Bc) = 0~. But A ⊆ Bc. Therefore 0~
≠ A = spgint(A) ⊆ spgint(Bc) = 0~, which is a
contradiction. Therefore (iv) is true.
(iv) ⇒ (i) Suppose 0~ ≠ A ≠ 1~ be an IFRSPGOS in (X,
τ). If we take B = (spgcl(A))c, we get B ≠ 0~, since if B
= 0~ then this implies (spgcl(A))c = 0~. That is spgcl(A)
= 1~. Hence A = spgint(spgcl(A)) = spgint(1~) = 1~,
which is a contradiction. Therefore B ≠ 0~ and A ⊆ Bc.
But this is a contradiction to (iv). Therefore (X, τ) must
be an IFSPG super connected space.
(i) ⇒ (v) Suppose A and B be two IFSPGOSs in (X, τ)
such that A ≠ 0~ ≠ B and B = (spgcl(A))c, A =
(spgcl(B))c. Now we have spgint(spgcl(A)) = spgint(Bc)
= (spgcl(B))c = A, A ≠ 0~ and A ≠ 1~, since if A = 1~,
then 1~ = (spgcl(B))c ⇒ spgcl(B) = 0~ ⇒ B = 0~.
Therefore A ≠ 1~. That is, A is a proper IFRSPGOS in
(X, τ), which is a contradiction to (i). Hence (v) is
true.
(v) ⇒ (i) Let A be an IFSPGOS in (X, τ) such that A =
spgint(spgcl(A)), 0~ ≠ A ≠ 1~. Now take B =
(spgcl(A))c. In this case we get, B ≠ 0~ and B is an
IFSPGOS in (X, τ). Now B = (spgcl(A))c and
(spgcl(B))c = (spgcl(spgcl(A))c)c = spgint(spgcl(A)) =
A. But this is a contradiction to (v). Therefore (X, τ)
must be an IFSPG super connected space.
(v) ⇒ (vi) Suppose A and B be two IFSPGCS in (X, τ)
such that A ≠ 1~ ≠ B, B = (spgint(A))c, A = (spgint(B))c.
Taking C = Ac and D = Bc, C and D become IFSPGOSs
in (X, τ) with C ≠ 0~ ≠D and D = (spgcl(C))c, C =
(spgcl(D))c, which is a contradiction to (v). Hence (vi) is
true.
(vi) ⇒ (v) can be proved easily by the similar way as in
(v) ⇒ (vi).
Definition 3.17: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized (IFSPG for short
) extremally disconnected if the semipre generalized
closure of every IFSPGOS in (X, τ) is an IFSPGOS in
(X, τ).
Theorem 3.18: Let (X, τ) be an IFTS space. Then the
following statements are equivalent:
(vi) ⇒ (v) can be proved easily by the similar way as in
(v) ⇒ (vi).
Definition 3.17: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized (IFSPG for short
) extremally disconnected if the semipre generalized
closure of every IFSPGOS in (X, τ) is an IFSPGOS in
(X, τ).
Theorem 3.18: Let (X, τ) be an IFTS space. Then the
following statements are equivalent:
(i) (X, τ) is an IFSPG extremally disconnected
(ii) For each IFSPGCS A, spgint(A) is an IFSPGCS
(iii) For each IFSPGOS A, spgcl(A) =
(spgcl(spgcl(A))c)c
(iv) For each pair of IFSPGOSs A and B with
spgcl(A) = Bc implies that spgcl(A) = (spgcl(B))c
Proof : (i) ⇒ (ii) Let A be any IFSPGOS. Then Ac is an
IFSPGOS. So (i) implies that spgcl(Ac) = (spgint(A))c is
an IFSPGOS. Thus spgint(A) is an IFSPGCS in (X, τ).
(ii) ⇒ (iii) Let A be an IFSPGOS. We have
(spgcl(spgcl(A))c)c = (spgcl(spgint(Ac)))c. Since A is an
IFSPGOS, Ac is IFSPGCS. So by (ii) spgint(Ac) is an
IFSPGCS. That is spgcl(spgint(Ac)) = spgint(Ac).
Hence (spgcl(spgint(Ac)))c = (spgint(Ac))c = spgcl(A).
(iii) ⇒ (iv) Let A and B be any two IFSPGOSs in (X, τ)
such that spgcl(A) = Bc. (iii) implies that spgcl(A) =
(spgcl(spgcl(A))c)c =( spgcl(Bc)c)c = (spgcl(B))c.
(iv) ⇒ (i) Let A be any IFSPGOS in (X, τ). Put B =
(spgcl(A))c, then B is an IFSPGOS and spgcl(A) = Bc.
Hence by (iv) , spgcl(A) = (spgcl(B))c. Since spgcl(B) is
an IFSPGCS, it follows that spgcl(A) is an IFSPGOS.
This implies that (X, τ) is an IFSPG extremally
disconnected space.
4. REFERENCES
[1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy
Sets and Systems, 20, 1986, 87-96.
[2] C. L. Chang, Fuzzy topological spaces,
J.Math.Anal.Appl. 24, 1968, 182-190.
[3] D. Coker, An introduction to intuitionistic
fuzzy topological space, Fuzzy Sets and Systems, 88,
1997, 81-89.
[4] H. Gurcay, Es. A. Haydar and D. Coker, On
fuzzy continuity in intuitionistic fuzzy topological
spaces, The J.Fuzzy Math.5 (2) , 1997, 365-378.
[5] M. Thirumalaiswamy and K. M.
Arifmohammed, Semipre Generalized Open Sets and
Applications of Semipre Generalized Closed Sets in
Intuitionistic Fuzzy Topological Spaces (submitted).
[6] N. Turnali and D. Coker, Fuzzy connectedness
in intuitionistic fuzzy topological spaces, FuzzySets and
Systems 116 (2000) 369–375.
International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 228
[7] M. Thirumalaiswamy and K. Ramesh,
Intuitionistic fuzzy semi-pre generalized closed sets
(submitted).
[8] M. Thirumalaiswamy and K. Ramesh,
Semipre Generalized Continuous and Irresolute
Mappings in Intuitionistic Fuzzy Topological Space
(submitted).
[9] M. Thirumalaiswamy and K. Ramesh,
Semipre Generalized Homeomorphisms in Intuitionistic
Fuzzy Topological Spaces
[10] Young Bae Jun and Seok- Zun Song,
Intuitionistic fuzzy semi-pre open sets and Intuitionistic
fuzzy semi-pre continuous mappings, Jour. of Appl.
Math & computing, 2005, 467-474.
[11] L. A. Zadeh, Fuzzy sets, Information and
control, 8, 1965, 338-353.

More Related Content

What's hot

Ow3426032607
Ow3426032607Ow3426032607
Ow3426032607
IJERA Editor
 
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsCorrespondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
journal ijrtem
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
IJECEIAES
 
Cd32939943
Cd32939943Cd32939943
Cd32939943IJMER
 
On Gr-Separation Axioms
 On Gr-Separation Axioms  On Gr-Separation Axioms
On Gr-Separation Axioms
IJMER
 
C027011018
C027011018C027011018
C027011018
inventionjournals
 
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
IJMER
 
Some More Results on Intuitionistic Semi Open Sets
Some More Results on Intuitionistic Semi Open SetsSome More Results on Intuitionistic Semi Open Sets
Some More Results on Intuitionistic Semi Open Sets
IJERA Editor
 
Between α-closed Sets and Semi α-closed Sets
Between α-closed Sets and Semi α-closed SetsBetween α-closed Sets and Semi α-closed Sets
Between α-closed Sets and Semi α-closed Sets
IJMER
 
On fuzzy compact open topology
On fuzzy compact open topologyOn fuzzy compact open topology
On fuzzy compact open topologybkrawat08
 
g∗S-closed sets in topological spaces
g∗S-closed sets in topological spacesg∗S-closed sets in topological spaces
g∗S-closed sets in topological spaces
IJMER
 
Presentation iaf 2014 v1
Presentation iaf 2014 v1Presentation iaf 2014 v1
Presentation iaf 2014 v1Fayçal Touazi
 
μ-πrα Closed Sets in Bigeneralized Topological Spaces
μ-πrα Closed Sets in Bigeneralized Topological Spacesμ-πrα Closed Sets in Bigeneralized Topological Spaces
μ-πrα Closed Sets in Bigeneralized Topological Spaces
IJERA Editor
 
Gödel’s incompleteness theorems
Gödel’s incompleteness theoremsGödel’s incompleteness theorems
Gödel’s incompleteness theorems
Sérgio Souza Costa
 
Godels First Incompleteness Theorem
Godels First Incompleteness TheoremGodels First Incompleteness Theorem
Godels First Incompleteness Theorem
mmanning02474
 
4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...Alexander Decker
 

What's hot (19)

50120140504018
5012014050401850120140504018
50120140504018
 
Ow3426032607
Ow3426032607Ow3426032607
Ow3426032607
 
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsCorrespondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
 
Cd32939943
Cd32939943Cd32939943
Cd32939943
 
On Gr-Separation Axioms
 On Gr-Separation Axioms  On Gr-Separation Axioms
On Gr-Separation Axioms
 
C027011018
C027011018C027011018
C027011018
 
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
𝑺𝒈 ∗ -Compact and 𝑺𝒈 ∗ -Connected Spaces
 
Some More Results on Intuitionistic Semi Open Sets
Some More Results on Intuitionistic Semi Open SetsSome More Results on Intuitionistic Semi Open Sets
Some More Results on Intuitionistic Semi Open Sets
 
Between α-closed Sets and Semi α-closed Sets
Between α-closed Sets and Semi α-closed SetsBetween α-closed Sets and Semi α-closed Sets
Between α-closed Sets and Semi α-closed Sets
 
On fuzzy compact open topology
On fuzzy compact open topologyOn fuzzy compact open topology
On fuzzy compact open topology
 
g∗S-closed sets in topological spaces
g∗S-closed sets in topological spacesg∗S-closed sets in topological spaces
g∗S-closed sets in topological spaces
 
Logic Seminar Spring 2011
Logic Seminar Spring 2011Logic Seminar Spring 2011
Logic Seminar Spring 2011
 
Presentation iaf 2014 v1
Presentation iaf 2014 v1Presentation iaf 2014 v1
Presentation iaf 2014 v1
 
μ-πrα Closed Sets in Bigeneralized Topological Spaces
μ-πrα Closed Sets in Bigeneralized Topological Spacesμ-πrα Closed Sets in Bigeneralized Topological Spaces
μ-πrα Closed Sets in Bigeneralized Topological Spaces
 
Gödel’s incompleteness theorems
Gödel’s incompleteness theoremsGödel’s incompleteness theorems
Gödel’s incompleteness theorems
 
1 s2.0-s1574035804702117-main
1 s2.0-s1574035804702117-main1 s2.0-s1574035804702117-main
1 s2.0-s1574035804702117-main
 
Godels First Incompleteness Theorem
Godels First Incompleteness TheoremGodels First Incompleteness Theorem
Godels First Incompleteness Theorem
 
4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...4. [22 25]characterization of connected vertex magic total labeling graphs in...
4. [22 25]characterization of connected vertex magic total labeling graphs in...
 

Viewers also liked

Ijcatr04041019
Ijcatr04041019Ijcatr04041019
Ijcatr04041019
Editor IJCATR
 
Risk Prediction for Production of an Enterprise
Risk Prediction for Production of an EnterpriseRisk Prediction for Production of an Enterprise
Risk Prediction for Production of an Enterprise
Editor IJCATR
 
Ijcatr04041017
Ijcatr04041017Ijcatr04041017
Ijcatr04041017
Editor IJCATR
 
Ijcatr04041015
Ijcatr04041015Ijcatr04041015
Ijcatr04041015
Editor IJCATR
 
Ijcatr04051009
Ijcatr04051009Ijcatr04051009
Ijcatr04051009
Editor IJCATR
 
Journal paper 1
Journal paper 1Journal paper 1
Journal paper 1
Editor IJCATR
 
Ijcatr04051016
Ijcatr04051016Ijcatr04051016
Ijcatr04051016
Editor IJCATR
 
Ijsea04031005
Ijsea04031005Ijsea04031005
Ijsea04031005
Editor IJCATR
 
Agent-Driven Distributed Data Mining
Agent-Driven Distributed Data MiningAgent-Driven Distributed Data Mining
Agent-Driven Distributed Data Mining
Editor IJCATR
 
Security for Effective Data Storage in Multi Clouds
Security for Effective Data Storage in Multi CloudsSecurity for Effective Data Storage in Multi Clouds
Security for Effective Data Storage in Multi Clouds
Editor IJCATR
 
Random Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural FilterRandom Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural Filter
Editor IJCATR
 
Assistive Examination System for Visually Impaired
Assistive Examination System for Visually ImpairedAssistive Examination System for Visually Impaired
Assistive Examination System for Visually Impaired
Editor IJCATR
 
A Formal Machine Learning or Multi Objective Decision Making System for Deter...
A Formal Machine Learning or Multi Objective Decision Making System for Deter...A Formal Machine Learning or Multi Objective Decision Making System for Deter...
A Formal Machine Learning or Multi Objective Decision Making System for Deter...
Editor IJCATR
 
Risk-Aware Response Mechanism with Extended D-S theory
Risk-Aware Response Mechanism with Extended D-S theoryRisk-Aware Response Mechanism with Extended D-S theory
Risk-Aware Response Mechanism with Extended D-S theory
Editor IJCATR
 

Viewers also liked (15)

Ijcatr04041019
Ijcatr04041019Ijcatr04041019
Ijcatr04041019
 
Risk Prediction for Production of an Enterprise
Risk Prediction for Production of an EnterpriseRisk Prediction for Production of an Enterprise
Risk Prediction for Production of an Enterprise
 
Ijcatr04041017
Ijcatr04041017Ijcatr04041017
Ijcatr04041017
 
Ijcatr04041015
Ijcatr04041015Ijcatr04041015
Ijcatr04041015
 
Ijcatr04051009
Ijcatr04051009Ijcatr04051009
Ijcatr04051009
 
Journal paper 1
Journal paper 1Journal paper 1
Journal paper 1
 
Ijcatr04051016
Ijcatr04051016Ijcatr04051016
Ijcatr04051016
 
Ijsea04031005
Ijsea04031005Ijsea04031005
Ijsea04031005
 
Agent-Driven Distributed Data Mining
Agent-Driven Distributed Data MiningAgent-Driven Distributed Data Mining
Agent-Driven Distributed Data Mining
 
Security for Effective Data Storage in Multi Clouds
Security for Effective Data Storage in Multi CloudsSecurity for Effective Data Storage in Multi Clouds
Security for Effective Data Storage in Multi Clouds
 
Random Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural FilterRandom Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural Filter
 
Assistive Examination System for Visually Impaired
Assistive Examination System for Visually ImpairedAssistive Examination System for Visually Impaired
Assistive Examination System for Visually Impaired
 
A Formal Machine Learning or Multi Objective Decision Making System for Deter...
A Formal Machine Learning or Multi Objective Decision Making System for Deter...A Formal Machine Learning or Multi Objective Decision Making System for Deter...
A Formal Machine Learning or Multi Objective Decision Making System for Deter...
 
Ijcatr04021016
Ijcatr04021016Ijcatr04021016
Ijcatr04021016
 
Risk-Aware Response Mechanism with Extended D-S theory
Risk-Aware Response Mechanism with Extended D-S theoryRisk-Aware Response Mechanism with Extended D-S theory
Risk-Aware Response Mechanism with Extended D-S theory
 

Similar to Intuitionistic Fuzzy Semipre Generalized Connected Spaces

On some locally closed sets and spaces in Ideal Topological Spaces
On some locally closed sets and spaces in Ideal Topological SpacesOn some locally closed sets and spaces in Ideal Topological Spaces
On some locally closed sets and spaces in Ideal Topological Spaces
IJMER
 
On intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed setsOn intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed sets
ijceronline
 
On intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed setsOn intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed sets
ijceronline
 
International Refereed Journal of Engineering and Science (IRJES)
International Refereed Journal of Engineering and Science (IRJES)International Refereed Journal of Engineering and Science (IRJES)
International Refereed Journal of Engineering and Science (IRJES)
irjes
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
IOSR Journals
 
𝒈 ∗S-closed sets in topological spaces
𝒈 ∗S-closed sets in topological spaces𝒈 ∗S-closed sets in topological spaces
𝒈 ∗S-closed sets in topological spaces
IJMER
 
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -ContinuityIntuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
Waqas Tariq
 
Contra qpi continuous functions in ideal bitopological spaces
Contra qpi  continuous functions in ideal bitopological spacesContra qpi  continuous functions in ideal bitopological spaces
Contra qpi continuous functions in ideal bitopological spaces
Alexander Decker
 
Fundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation SpaceFundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation Space
YogeshIJTSRD
 
Interval valued intuitionistic fuzzy homomorphism of bf algebras
Interval valued intuitionistic fuzzy homomorphism of bf algebrasInterval valued intuitionistic fuzzy homomorphism of bf algebras
Interval valued intuitionistic fuzzy homomorphism of bf algebras
Alexander Decker
 
FUZZY ROUGH CONNECTED SPACES
FUZZY ROUGH CONNECTED SPACESFUZZY ROUGH CONNECTED SPACES
Between -I-closed sets and g-closed sets
Between -I-closed sets and g-closed setsBetween -I-closed sets and g-closed sets
Between -I-closed sets and g-closed sets
IJMER
 
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
AIRCC Publishing Corporation
 
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
AIRCC Publishing Corporation
 
On Zα-Open Sets and Decompositions of Continuity
On Zα-Open Sets and Decompositions of ContinuityOn Zα-Open Sets and Decompositions of Continuity
On Zα-Open Sets and Decompositions of Continuity
IJERA Editor
 
Some Results on Fuzzy Supra Topological Spaces
Some Results on Fuzzy Supra Topological SpacesSome Results on Fuzzy Supra Topological Spaces
Some Results on Fuzzy Supra Topological Spaces
IJERA Editor
 
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
International Journal of Technical Research & Application
 
Note on closed sets in topological spaces
Note on    closed sets in topological spacesNote on    closed sets in topological spaces
Note on closed sets in topological spaces
Alexander Decker
 
Contra  * Continuous Functions in Topological Spaces
Contra   * Continuous Functions in Topological SpacesContra   * Continuous Functions in Topological Spaces
Contra  * Continuous Functions in Topological Spaces
IJMER
 
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
IJERA Editor
 

Similar to Intuitionistic Fuzzy Semipre Generalized Connected Spaces (20)

On some locally closed sets and spaces in Ideal Topological Spaces
On some locally closed sets and spaces in Ideal Topological SpacesOn some locally closed sets and spaces in Ideal Topological Spaces
On some locally closed sets and spaces in Ideal Topological Spaces
 
On intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed setsOn intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed sets
 
On intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed setsOn intuitionistic fuzzy 휷 generalized closed sets
On intuitionistic fuzzy 휷 generalized closed sets
 
International Refereed Journal of Engineering and Science (IRJES)
International Refereed Journal of Engineering and Science (IRJES)International Refereed Journal of Engineering and Science (IRJES)
International Refereed Journal of Engineering and Science (IRJES)
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
 
𝒈 ∗S-closed sets in topological spaces
𝒈 ∗S-closed sets in topological spaces𝒈 ∗S-closed sets in topological spaces
𝒈 ∗S-closed sets in topological spaces
 
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -ContinuityIntuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -Continuity
 
Contra qpi continuous functions in ideal bitopological spaces
Contra qpi  continuous functions in ideal bitopological spacesContra qpi  continuous functions in ideal bitopological spaces
Contra qpi continuous functions in ideal bitopological spaces
 
Fundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation SpaceFundamentals of Parameterised Covering Approximation Space
Fundamentals of Parameterised Covering Approximation Space
 
Interval valued intuitionistic fuzzy homomorphism of bf algebras
Interval valued intuitionistic fuzzy homomorphism of bf algebrasInterval valued intuitionistic fuzzy homomorphism of bf algebras
Interval valued intuitionistic fuzzy homomorphism of bf algebras
 
FUZZY ROUGH CONNECTED SPACES
FUZZY ROUGH CONNECTED SPACESFUZZY ROUGH CONNECTED SPACES
FUZZY ROUGH CONNECTED SPACES
 
Between -I-closed sets and g-closed sets
Between -I-closed sets and g-closed setsBetween -I-closed sets and g-closed sets
Between -I-closed sets and g-closed sets
 
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
RESIDUAL QUOTIENT AND ANNIHILATOR OF INTUITIONISTIC FUZZY SETS OF RING AND MO...
 
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
Residual Quotient and Annihilator of Intuitionistic Fuzzy Sets of Ring and Mo...
 
On Zα-Open Sets and Decompositions of Continuity
On Zα-Open Sets and Decompositions of ContinuityOn Zα-Open Sets and Decompositions of Continuity
On Zα-Open Sets and Decompositions of Continuity
 
Some Results on Fuzzy Supra Topological Spaces
Some Results on Fuzzy Supra Topological SpacesSome Results on Fuzzy Supra Topological Spaces
Some Results on Fuzzy Supra Topological Spaces
 
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
ON SEMI-  -CONTINUITY WHERE   {L, M, R, S}
 
Note on closed sets in topological spaces
Note on    closed sets in topological spacesNote on    closed sets in topological spaces
Note on closed sets in topological spaces
 
Contra  * Continuous Functions in Topological Spaces
Contra   * Continuous Functions in Topological SpacesContra   * Continuous Functions in Topological Spaces
Contra  * Continuous Functions in Topological Spaces
 
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
 

More from Editor IJCATR

Text Mining in Digital Libraries using OKAPI BM25 Model
 Text Mining in Digital Libraries using OKAPI BM25 Model Text Mining in Digital Libraries using OKAPI BM25 Model
Text Mining in Digital Libraries using OKAPI BM25 Model
Editor IJCATR
 
Green Computing, eco trends, climate change, e-waste and eco-friendly
Green Computing, eco trends, climate change, e-waste and eco-friendlyGreen Computing, eco trends, climate change, e-waste and eco-friendly
Green Computing, eco trends, climate change, e-waste and eco-friendly
Editor IJCATR
 
Policies for Green Computing and E-Waste in Nigeria
 Policies for Green Computing and E-Waste in Nigeria Policies for Green Computing and E-Waste in Nigeria
Policies for Green Computing and E-Waste in Nigeria
Editor IJCATR
 
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
Editor IJCATR
 
Optimum Location of DG Units Considering Operation Conditions
Optimum Location of DG Units Considering Operation ConditionsOptimum Location of DG Units Considering Operation Conditions
Optimum Location of DG Units Considering Operation Conditions
Editor IJCATR
 
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
Editor IJCATR
 
Web Scraping for Estimating new Record from Source Site
Web Scraping for Estimating new Record from Source SiteWeb Scraping for Estimating new Record from Source Site
Web Scraping for Estimating new Record from Source Site
Editor IJCATR
 
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
 Evaluating Semantic Similarity between Biomedical Concepts/Classes through S... Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
Editor IJCATR
 
Semantic Similarity Measures between Terms in the Biomedical Domain within f...
 Semantic Similarity Measures between Terms in the Biomedical Domain within f... Semantic Similarity Measures between Terms in the Biomedical Domain within f...
Semantic Similarity Measures between Terms in the Biomedical Domain within f...
Editor IJCATR
 
A Strategy for Improving the Performance of Small Files in Openstack Swift
 A Strategy for Improving the Performance of Small Files in Openstack Swift  A Strategy for Improving the Performance of Small Files in Openstack Swift
A Strategy for Improving the Performance of Small Files in Openstack Swift
Editor IJCATR
 
Integrated System for Vehicle Clearance and Registration
Integrated System for Vehicle Clearance and RegistrationIntegrated System for Vehicle Clearance and Registration
Integrated System for Vehicle Clearance and Registration
Editor IJCATR
 
Assessment of the Efficiency of Customer Order Management System: A Case Stu...
 Assessment of the Efficiency of Customer Order Management System: A Case Stu... Assessment of the Efficiency of Customer Order Management System: A Case Stu...
Assessment of the Efficiency of Customer Order Management System: A Case Stu...
Editor IJCATR
 
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
Editor IJCATR
 
Security in Software Defined Networks (SDN): Challenges and Research Opportun...
Security in Software Defined Networks (SDN): Challenges and Research Opportun...Security in Software Defined Networks (SDN): Challenges and Research Opportun...
Security in Software Defined Networks (SDN): Challenges and Research Opportun...
Editor IJCATR
 
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
Editor IJCATR
 
Hangul Recognition Using Support Vector Machine
Hangul Recognition Using Support Vector MachineHangul Recognition Using Support Vector Machine
Hangul Recognition Using Support Vector Machine
Editor IJCATR
 
Application of 3D Printing in Education
Application of 3D Printing in EducationApplication of 3D Printing in Education
Application of 3D Printing in Education
Editor IJCATR
 
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Editor IJCATR
 
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
Editor IJCATR
 
Decay Property for Solutions to Plate Type Equations with Variable Coefficients
Decay Property for Solutions to Plate Type Equations with Variable CoefficientsDecay Property for Solutions to Plate Type Equations with Variable Coefficients
Decay Property for Solutions to Plate Type Equations with Variable Coefficients
Editor IJCATR
 

More from Editor IJCATR (20)

Text Mining in Digital Libraries using OKAPI BM25 Model
 Text Mining in Digital Libraries using OKAPI BM25 Model Text Mining in Digital Libraries using OKAPI BM25 Model
Text Mining in Digital Libraries using OKAPI BM25 Model
 
Green Computing, eco trends, climate change, e-waste and eco-friendly
Green Computing, eco trends, climate change, e-waste and eco-friendlyGreen Computing, eco trends, climate change, e-waste and eco-friendly
Green Computing, eco trends, climate change, e-waste and eco-friendly
 
Policies for Green Computing and E-Waste in Nigeria
 Policies for Green Computing and E-Waste in Nigeria Policies for Green Computing and E-Waste in Nigeria
Policies for Green Computing and E-Waste in Nigeria
 
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...
 
Optimum Location of DG Units Considering Operation Conditions
Optimum Location of DG Units Considering Operation ConditionsOptimum Location of DG Units Considering Operation Conditions
Optimum Location of DG Units Considering Operation Conditions
 
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...
 
Web Scraping for Estimating new Record from Source Site
Web Scraping for Estimating new Record from Source SiteWeb Scraping for Estimating new Record from Source Site
Web Scraping for Estimating new Record from Source Site
 
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
 Evaluating Semantic Similarity between Biomedical Concepts/Classes through S... Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...
 
Semantic Similarity Measures between Terms in the Biomedical Domain within f...
 Semantic Similarity Measures between Terms in the Biomedical Domain within f... Semantic Similarity Measures between Terms in the Biomedical Domain within f...
Semantic Similarity Measures between Terms in the Biomedical Domain within f...
 
A Strategy for Improving the Performance of Small Files in Openstack Swift
 A Strategy for Improving the Performance of Small Files in Openstack Swift  A Strategy for Improving the Performance of Small Files in Openstack Swift
A Strategy for Improving the Performance of Small Files in Openstack Swift
 
Integrated System for Vehicle Clearance and Registration
Integrated System for Vehicle Clearance and RegistrationIntegrated System for Vehicle Clearance and Registration
Integrated System for Vehicle Clearance and Registration
 
Assessment of the Efficiency of Customer Order Management System: A Case Stu...
 Assessment of the Efficiency of Customer Order Management System: A Case Stu... Assessment of the Efficiency of Customer Order Management System: A Case Stu...
Assessment of the Efficiency of Customer Order Management System: A Case Stu...
 
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*
 
Security in Software Defined Networks (SDN): Challenges and Research Opportun...
Security in Software Defined Networks (SDN): Challenges and Research Opportun...Security in Software Defined Networks (SDN): Challenges and Research Opportun...
Security in Software Defined Networks (SDN): Challenges and Research Opportun...
 
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...
 
Hangul Recognition Using Support Vector Machine
Hangul Recognition Using Support Vector MachineHangul Recognition Using Support Vector Machine
Hangul Recognition Using Support Vector Machine
 
Application of 3D Printing in Education
Application of 3D Printing in EducationApplication of 3D Printing in Education
Application of 3D Printing in Education
 
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...
 
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...
 
Decay Property for Solutions to Plate Type Equations with Variable Coefficients
Decay Property for Solutions to Plate Type Equations with Variable CoefficientsDecay Property for Solutions to Plate Type Equations with Variable Coefficients
Decay Property for Solutions to Plate Type Equations with Variable Coefficients
 

Recently uploaded

RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
IreneSebastianRueco1
 
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO PerspectiveAdvantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
Krisztián Száraz
 
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion DesignsDigital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
chanes7
 
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
Ashish Kohli
 
The Diamonds of 2023-2024 in the IGRA collection
The Diamonds of 2023-2024 in the IGRA collectionThe Diamonds of 2023-2024 in the IGRA collection
The Diamonds of 2023-2024 in the IGRA collection
Israel Genealogy Research Association
 
DRUGS AND ITS classification slide share
DRUGS AND ITS classification slide shareDRUGS AND ITS classification slide share
DRUGS AND ITS classification slide share
taiba qazi
 
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.pptThesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
EverAndrsGuerraGuerr
 
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments UnitDigital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit
chanes7
 
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Sandy Millin
 
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold MethodHow to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
Celine George
 
Acetabularia Information For Class 9 .docx
Acetabularia Information For Class 9  .docxAcetabularia Information For Class 9  .docx
Acetabularia Information For Class 9 .docx
vaibhavrinwa19
 
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdfMASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
goswamiyash170123
 
How to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP ModuleHow to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP Module
Celine George
 
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHatAzure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Scholarhat
 
Top five deadliest dog breeds in America
Top five deadliest dog breeds in AmericaTop five deadliest dog breeds in America
Top five deadliest dog breeds in America
Bisnar Chase Personal Injury Attorneys
 
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdfANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
Priyankaranawat4
 
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe..."Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
SACHIN R KONDAGURI
 
World environment day ppt For 5 June 2024
World environment day ppt For 5 June 2024World environment day ppt For 5 June 2024
World environment day ppt For 5 June 2024
ak6969907
 
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxChapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Mohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
 
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdfUnit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Thiyagu K
 

Recently uploaded (20)

RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
 
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO PerspectiveAdvantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
 
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion DesignsDigital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
 
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
Aficamten in HCM (SEQUOIA HCM TRIAL 2024)
 
The Diamonds of 2023-2024 in the IGRA collection
The Diamonds of 2023-2024 in the IGRA collectionThe Diamonds of 2023-2024 in the IGRA collection
The Diamonds of 2023-2024 in the IGRA collection
 
DRUGS AND ITS classification slide share
DRUGS AND ITS classification slide shareDRUGS AND ITS classification slide share
DRUGS AND ITS classification slide share
 
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.pptThesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
 
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments UnitDigital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit
 
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
 
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold MethodHow to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
 
Acetabularia Information For Class 9 .docx
Acetabularia Information For Class 9  .docxAcetabularia Information For Class 9  .docx
Acetabularia Information For Class 9 .docx
 
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdfMASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
 
How to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP ModuleHow to Add Chatter in the odoo 17 ERP Module
How to Add Chatter in the odoo 17 ERP Module
 
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHatAzure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
 
Top five deadliest dog breeds in America
Top five deadliest dog breeds in AmericaTop five deadliest dog breeds in America
Top five deadliest dog breeds in America
 
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdfANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
 
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe..."Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
 
World environment day ppt For 5 June 2024
World environment day ppt For 5 June 2024World environment day ppt For 5 June 2024
World environment day ppt For 5 June 2024
 
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxChapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
 
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdfUnit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
 

Intuitionistic Fuzzy Semipre Generalized Connected Spaces

  • 1. International Journal of Computer Applications Technology and Research Volume 2– Issue 3, 224 - 228, 2013 www.ijcat.com 224 Intuitionistic Fuzzy Semipre Generalized Connected Spaces M. Thirumalaiswamy Department of Mathematics, NGM College, Pollachi-642001, Tamil Nadu, India K. M. Arifmohammed Department of Mathematics, NGM College, Pollachi-642001, Tamil Nadu, India Abstract : In this paper, we introduce the notion of intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces. We investigate some of their properties. Keywords : Intuitionistic fuzzy topology, intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces 2010 Mathematical Subject Classification: 54A40, 03F55 1. INTRODUCTION In 1965, Zadeh [11] introduced fuzzy sets and in 1968, Chang [2] introduced fuzzy topology. After the introduction of fuzzy set and fuzzy topology, several authors were conducted on the generalization of this notion. The notion of intuitionistic fuzzy sets was introduced by Atanassov [1] as a generalization of fuzzy sets. 1997, Coker [3] introduced the concept of intuitionistic fuzzy topological spaces. In this paper, we introduce the notion of intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces. And study some of their properties. 2. PRELIMINARIES Definition 2.1:[1] Let X be a non-empty fixed set. An intuitionistic fuzzy set (IFS in short) A in X is an object having the form A = {〈 x, µA(x), νA(x)〉 / x ∈ X} where the functions µA: X → [0, 1] and νA : X → [0, 1] denote the degree of membership (namely µA(x)) and the degree of non-membership (namely νA(x)) of each element x ∈ X to the set A respectively and 0 ≤ µA(x) + νA(x) ≤ 1 for each x ∈ X. Denote by IFS(X), the set of all intuitionistic fuzzy sets in X. Definition 2.2:[1] Let A and B be IFSs of the form A = {〈 x, µA(x), νA(x)〉 / x ∈ X} and B = {〈 x, µB(x), νB(x)〉 / x ∈ X}. Then 1. A ⊆ B if and only if µA(x) ≤ µB(x) and νA(x) ≥ νB(x) for all x ∈ X 2. A = B if and only if A ⊆ B and B ⊆ A 3. Ac = {〈 x, νA(x), µA(x)〉 / x ∈ X } 4. A ∩ B = {〈 x, µA(x) ∧ µB(x), νA(x) ∨ νB(x)〉 / x ∈ X} 5. A ∪ B = {〈 x, µA(x) ∨ µB(x), νA(x) ∧ νB(x)〉 / x ∈ X} For the sake of simplicity, we shall use the notation A = 〈 x, µA, νA〉 instead of A = {〈 x, µA(x), νA(x)〉 / x ∈ X}. Also for the sake of simplicity, we shall use the notation A = 〈 x, (µA, µB), (νA, νB)〉 instead of A = 〈 x, (A/μA, B/μB), (A/νA, B/νB)〉 . The intuitionistic fuzzy sets 0~ = {〈 x, 0, 1〉 / x ∈ X} and 1~ = {〈 x, 1, 0〉 / x ∈ X} are respectively the empty set and the whole set of X. Definition 2.3:[3] An intuitionistic fuzzy topology (IFT in short) on X is a family τ of IFSs in X satisfying the following axioms: 1. 0~, 1~ ∈ τ 2. G1 ∩ G2 ∈ τ, for every G1, G2 ∈ τ 3. ∪ Gi ∈ τ for any family {Gi / i ∈ J} ⊆ τ In this case the pair (X, τ) is called an intuitionistic fuzzy topological space(IFTS in short) and any IFS in τ is known as an intuitionistic fuzzy open set(IFOS in short)in X. The complement Ac of an IFOS A in an IFTS (X, τ) is called an intuitionistic fuzzy closed set (IFCS in short) in X. Definition 2.4:[3] Let (X, τ) be an IFTS and A = 〈 x, µA, νA〉 be an IFS in X. Then 1. int(A) = ∪{ G / G is an IFOS in X and G ⊆ A } 2. cl(A) = ∩{ K / K is an IFCS in X and A ⊆ K } 3. cl(Ac) = (int(A))c 4. int(Ac) = (cl(A))c Definition 2.5:[10] An IFS A of an IFTS (X, τ) is an
  • 2. International Journal of Computer Applications Technology and Research Volume 2– Issue 3, 224 - 228, 2013 www.ijcat.com 225 1. intuitionistic fuzzy semipre closed set (IFSPCS for short) if there exists an IFPCS B such that int(B) ⊆ A ⊆ B 2. intuitionistic fuzzy semipre open set (IFSPOS for short) if there exists an IFPOS B such that B ⊆ A ⊆ cl(B) Definition 2.6:[4] Let A be an IFS in an IFTS (X, τ). Then 1. spint (A) = ∪{ G / G is an IFSPOS in X and G ⊆ A } 2. spcl (A) = ∩{ K / K is an IFSPCS in X and A ⊆ K } Note that for any IFS A in (X, τ), we have spcl(Ac) = (spint(A))c and spint(Ac) = (spcl(A))c . Definition 2.7:[7] An IFS A in an IFTS (X, τ) is said to be an intuitionistic fuzzy semipre generalized closed set (IFSPGCS for short) if spcl(A) ⊆ U whenever A ⊆ U and U is an IFSOS in (X, τ). The family of all IFSPGCSs of an IFTS (X, τ) is denoted by IFSPGC(X). Every IFCS and IFSPCS is an IFSPGCS but the converses are not true in general. Definition 2.8:[5] The complement Ac of an IFSPGCS A in an IFTS (X, τ) is called an intuitionistic fuzzy semipre generalized open set (IFSPGOS for short) in X. The family of all IFSPGOSs of an IFTS (X, τ) is denoted by IFSPGO(X). Every IFOS and IFSPOS is an IFSPGOS but the converses are not true in general. Definition 2.9:[9] Let A be an IFS in an IFTS (X, τ). Then semipre generalized interior of A (spgint(A) for short) and semipre generalized closure of A (spgcl(A) for short) are defined by 1. spgint (A) = ∪{ G / G is an IFSPGOS in X and G ⊆ A } 2. spgcl (A) = ∩{ K / K is an IFSPGCS in X and A ⊆ K } Note that for any IFS A in (X, τ), we have spgcl(Ac) = (spgint(A))c and spgint(Ac) = (spgcl(A))c. Definition 2.10:[5] An IFTS(X, τ) is said to be an intuitionistic fuzzy semipre T*1/2 space (IFSPT*1/2 space for short) if every IFSPGCS is an IFCS in (X, τ). Definition 2.11:[8] A mapping f : (X, τ) → (Y, σ) is called an intuitionistic fuzzy semipre generalized continuous (IFSPG continuous for short) mappings if f - 1(V) is an IFSPGCS in (X, τ) for every IFCS V of (Y, σ). Definition 2.12:[8] A mapping f: (X, τ) → (Y, σ) be an intuitionistic fuzzy semipre generalized irresolute (IFSPG irresolute) mapping if f -1(V) is an IFSPGCS in (X, τ) for every IFSPGCS V of (Y, σ). Definition 2.13:[4] Two IFSs A and B are said to be q- coincident (A q B in short) if and only if there exists an element x ∈ X such that µA(x) > νB(x) or νA(x) < µB(x). Definition 2.14:[4] Two IFSs A and B are said to be not q-coincident (A qc B in short) if and only if A ⊆ Bc. Definition 2.15:[6] An IFTS (X, τ ) is said to be an intuitionistic fuzzy C5-connected (IFC5-connected for short) space if the only IFSs which are both intuitionistic fuzzy open and intuitionistic fuzzy closed are 0∼ and 1∼. 3. INTUITIONISTIC FUZZY SEMIPRE GENERALIZED CONNECTED SPACES Definition 3.1: An IFTS (X, τ) is said to be an intuitionistic fuzzy semipre generalized connected space (IFSPG connected space for short) if the only IFSs which are both an IFSPGOS and an IFSPGCS are 0~ and 1~. Theorem 3.2: Every IFSPG connected space is IFC5- connected but not conversely. Proof: Let (X, τ) be an IFSPG connected space. Suppose (X, τ) is not IFC5-connected, then there exists a proper IFS A which is both an IFOS and an IFCS in (X, τ). That is, A is both an IFSPGOS and an IFSPGCS in (X, τ). This implies that (X, τ) is not IFSPG connected. This is a contradiction. Therefore (X, τ) must be an IFC5- connected space. Example 3.3: Let X = {a, b} and G = 〈 x, (0.5, 0.6), (0.5, 0.4)〉 . Then τ = {0~, G, 1~} is an IFT on X. Then X is an IFC5-connected space but not IFSPG connected, since the IFS A = 〈 x, (0.5, 0.7), (0.5, 0.3)〉 in X is both an IFSPGCS and an IFSPGOS in X. Theorem 3.4: An IFTS (X, τ) is an IFSPG connected space if and only if there exists no non-zero IFSPGOSs A and B in (X, τ) such that B = Ac, B = (spcl(A))c, A = (spcl(B))c. Proof: Necessity: Assume that there exist IFSs A and B such that A ≠ 0~ ≠ B, B = Ac, B = (spcl(A))c, A = (spcl(B))c. Since (spcl(A))c and (spcl(B))c are IFSPGOSs in (X, τ), A and B are IFSPGOSs in (X, τ). This implies (X, τ) is not IFSPG connected, which is a contradiction. Therefore there exists no non-zero IFSPGOSs A and B in (X, τ) such that B = Ac, B = (spcl(A))c, A = (spcl(B))c. Sufficiency: Let A be both an IFSPGOS and an IFSPGCS in (X, τ) such that 1~ ≠ A ≠ 0~. Now by taking B = Ac, we obtain a contradiction to our hypothesis. Hence (X, τ) is an IFSPG connected space. Theorem 3.5: Let (X, τ) be an IFSPT*1/2 space, then the following statements are equivalent: (i) (X, τ) is an IFSPG connected space,
  • 3. International Journal of Computer Applications Technology and Research Volume 2– Issue 3, 224 - 228, 2013 www.ijcat.com 226 (ii) (X, τ) is an IFC5-connected space. Proof: (i) ⇒ (ii) is obvious by Theorem 3.2. (ii) ⇒ (i) Let (X, τ) be an IFC5-connected space. Suppose (X, τ) is not IFSPG connected, then there exists a proper IFS A in (X, τ) which is both an IFSPGOS and an IFSPGCS in (X, τ). But since (X, τ) is an IFSPT*1/2 space, A is both an IFOS and an IFCS in (X, τ). This implies that (X, τ) is not IFC5-connected, which is a contradiction to our hypothesis. Therefore (X, τ) must be an IFSPG connected space. Theorem 3.6: If f : (X, τ) → (Y, σ) is an IFSPG continuous surjection and (X, τ) is an IFSPG connected space, then (Y, σ) is an IFC5-connected space. Proof: Let (X, τ) be an IFSPG connected space. Suppose (Y, σ) is not IFC5-connected, then there exists a proper IFS A which is both an IFOS and an IFCS in (Y, σ). Since f is an IFSPG continuous mapping, f -1(A) is both an IFSPGOS and an IFSPGCS in (X, τ). But this is a contradiction to our hypothesis. Hence (Y, σ) must be an IFC5- connected space. Theorem 3.7: If f : (X, τ) → (Y, σ) is an IFSPG irresolute surjection and (X, τ) is an IFSPG connected space, then (Y, σ) is also an IFSPG connected space. Proof: Suppose (Y, σ) is not an IFSPG connected space, then there exists a proper IFS A such that A is both an IFSPGOS and an IFSPGCS in (Y, σ). Since f is an IFSPG irresolute surjection, f -1(A) is both an IFSPGOS and an IFSPGCS in (X, τ). But this is a contradiction to our hypothesis. Hence (Y, σ) must be an IFSPG connected space. Definition 3.8: An IFTS (X, τ) is IFSPG connected between two IFSs A and B if there is no IFSPGOS E in (X, τ) such that A ⊆ E and E qc B. Example 3.9: Let X = {a, b} and G = 〈 x, (0.5, 0.4), (0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A = 〈 x, (0.5, 0.4), (0.5, 0.3)〉 and B = 〈 x, (0.5, 0.4), (0.5, 0.5)〉 be two IFSs in X. Hence (X, τ) is IFSPG connected between the IFSs A and B. Theorem 3.10: If an IFTS (X, τ) is IFSPG connected between two IFSs A and B, then it is IFC5-connected between A and B but the converse may not be true in general. Proof: Suppose (X, τ) is not IFC5-connected between A and B, then there exists an IFOS E in (X, τ) such that A ⊆ E and E qc B. Since every IFOS is an IFSPGOS, there exists an IFSPGOS E in (X, τ) such that A ⊆ E and E qc B. This implies (X, τ) is not IFSPG connected between A and B, a contradiction to our hypothesis. Therefore (X, τ) must be IFC5-connected between A and B. Example 3.11: Let X = {a, b} and G = 〈 x, (0.5, 0.4), (0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A = 〈 x, (0.4, 0.4), (0.6, 0.6)〉 and B = 〈 x, (0.3, 0.3), (0.4, 0.4)〉 be two IFSs in X. Then X is IFC5-connected between A and B, since there exists no IFOS E in X such that A ⊆ E and E q B. But it is not IFSPG connected between the two IFS A and B, since there exists an IFSPGOS E = 〈 x, (0.4, 0.4), (0.5, 0.5) 〉 in X such that A ⊆ E and E q B. Theorem 3.12: If an IFTS (X, τ) is IFSPG connected between A and B and A ⊆ A1, B ⊆ B1, then (X, τ) is IFSPG connected between A1 and B1. Proof: Suppose that (X, τ) is not IFSPG connected between A1 and B1, then by Definition 3.8, there exists an IFSPGOS E in (X, τ) such that A1 ⊆ E and E qc B1. This implies E ⊆ B1c. A1 ⊆ E implies A ⊆ A1 ⊆ E. That is A ⊆ E. Now let us prove that E ⊆ Bc, that is E qc B. Suppose that E q B, then by Definition 2.13, there exists an element x in X such that µE(x) > νB(x) and νE(x) < µB(x). Therefore µE(x) > νB(x) > νB1(x) and νE(x) < µB(x) < µB1(x), since B ⊆ B1. Hence µE(x) > µB1(x) and νE(x) < νB1(x). Thus E q B1. That is E q B1, which is a contradiction. Therefore E qc B. That is E ⊆ Bc. Hence (X, τ) is not IFSPG connected between A and B, which is a contradiction to our hypothesis. Thus (X, τ) must be IFSPG connected between A1 and B1. Theorem 3.13: Let (X, τ) be an IFTS and A and B be IFSs in (X, τ). If A q B, then (X, τ) is IFSPG connected between A and B. Proof: Suppose (X, τ) is not IFSPG connected between A and B. Then there exists an IFSPGOS E in (X, τ) such that A ⊆ E and E ⊆ Bc. This implies that A ⊆ Bc. That is A qc B. But this is a contradiction to our hypothesis. Therefore (X, τ) is must be IFSPG connected between A and B. Definition 3.14: An IFSPGOS A is an intuitionistic fuzzy regular semipre generalized open set (IFRSPGOS for short) if A = spgint(spgcl(A)). The complement of an IFRSPGOS is called an intuitionistic fuzzy regular semipre generalized closed set (IFRSPGCS for short). Definition 3.15: An IFTS (X, τ) is called an intuitionistic fuzzy semipre generalized (IFSPG for short) super connected space if there exists no proper IFRSPGOS in (X, τ). Theorem 3.16: Let (X, τ) be an IFTS. Then the following statements are equivalent: (i) (X, τ) is an IFSPG super connected space (ii) For every non-zero IFSPGOS A, spgcl(A) = 1~ (iii) For every IFSPGCS A with A ≠ 1~, spgint(A) = 0~ (iv) There exists no IFSPGOSs A and B in (X, τ) such that A ≠ 0~ ≠ B, A ⊆ Bc (v) There exists no IFSPGOSs A and B in (X, τ) such that A ≠ 0~ ≠ B, B = (spgcl(A))c, A = (spgcl(B))c (vi) There exists no IFSPGCSs A and B in (X, τ) such that A ≠ 0~ ≠ B, B = (spgint(A))c, A = (spgint(B))c
  • 4. International Journal of Computer Applications Technology and Research Volume 2– Issue 3, 224 - 228, 2013 www.ijcat.com 227 Proof: (i) ⇒ (ii) Assume that there exists an IFSPGOS A in (X, τ) such that A ≠ 0~ and spgcl(A) ≠ 1~. Now let B = spgint(spgcl(A))c. Then B is a proper IFRSPGOS in (X, τ), which is conradiction. Therefore spgcl(A) = 1~. (ii) ⇒ (iii) Let A ≠ 1~ be an IFSPGCS in (X, τ). If B = Ac, then B is an IFSPGOS in (X, τ) with B ≠ 0~. Hence spgcl(B) = 1~. This implies (spgcl(B))c = 0~. That is spgint(Bc) = 0~. Hence spgint(A) = 0~. (iii) ⇒ (iv) Suppose A and B be two IFSPGOSs in (X, τ) such that A ≠ 0~ ≠ B and A ⊆ Bc. Then Bc is an IFSPGCS in (X, τ) and B ≠ 0~ implies Bc ≠ 1~. By hypothesis spgint(Bc) = 0~. But A ⊆ Bc. Therefore 0~ ≠ A = spgint(A) ⊆ spgint(Bc) = 0~, which is a contradiction. Therefore (iv) is true. (iv) ⇒ (i) Suppose 0~ ≠ A ≠ 1~ be an IFRSPGOS in (X, τ). If we take B = (spgcl(A))c, we get B ≠ 0~, since if B = 0~ then this implies (spgcl(A))c = 0~. That is spgcl(A) = 1~. Hence A = spgint(spgcl(A)) = spgint(1~) = 1~, which is a contradiction. Therefore B ≠ 0~ and A ⊆ Bc. But this is a contradiction to (iv). Therefore (X, τ) must be an IFSPG super connected space. (i) ⇒ (v) Suppose A and B be two IFSPGOSs in (X, τ) such that A ≠ 0~ ≠ B and B = (spgcl(A))c, A = (spgcl(B))c. Now we have spgint(spgcl(A)) = spgint(Bc) = (spgcl(B))c = A, A ≠ 0~ and A ≠ 1~, since if A = 1~, then 1~ = (spgcl(B))c ⇒ spgcl(B) = 0~ ⇒ B = 0~. Therefore A ≠ 1~. That is, A is a proper IFRSPGOS in (X, τ), which is a contradiction to (i). Hence (v) is true. (v) ⇒ (i) Let A be an IFSPGOS in (X, τ) such that A = spgint(spgcl(A)), 0~ ≠ A ≠ 1~. Now take B = (spgcl(A))c. In this case we get, B ≠ 0~ and B is an IFSPGOS in (X, τ). Now B = (spgcl(A))c and (spgcl(B))c = (spgcl(spgcl(A))c)c = spgint(spgcl(A)) = A. But this is a contradiction to (v). Therefore (X, τ) must be an IFSPG super connected space. (v) ⇒ (vi) Suppose A and B be two IFSPGCS in (X, τ) such that A ≠ 1~ ≠ B, B = (spgint(A))c, A = (spgint(B))c. Taking C = Ac and D = Bc, C and D become IFSPGOSs in (X, τ) with C ≠ 0~ ≠D and D = (spgcl(C))c, C = (spgcl(D))c, which is a contradiction to (v). Hence (vi) is true. (vi) ⇒ (v) can be proved easily by the similar way as in (v) ⇒ (vi). Definition 3.17: An IFTS (X, τ) is said to be an intuitionistic fuzzy semipre generalized (IFSPG for short ) extremally disconnected if the semipre generalized closure of every IFSPGOS in (X, τ) is an IFSPGOS in (X, τ). Theorem 3.18: Let (X, τ) be an IFTS space. Then the following statements are equivalent: (vi) ⇒ (v) can be proved easily by the similar way as in (v) ⇒ (vi). Definition 3.17: An IFTS (X, τ) is said to be an intuitionistic fuzzy semipre generalized (IFSPG for short ) extremally disconnected if the semipre generalized closure of every IFSPGOS in (X, τ) is an IFSPGOS in (X, τ). Theorem 3.18: Let (X, τ) be an IFTS space. Then the following statements are equivalent: (i) (X, τ) is an IFSPG extremally disconnected (ii) For each IFSPGCS A, spgint(A) is an IFSPGCS (iii) For each IFSPGOS A, spgcl(A) = (spgcl(spgcl(A))c)c (iv) For each pair of IFSPGOSs A and B with spgcl(A) = Bc implies that spgcl(A) = (spgcl(B))c Proof : (i) ⇒ (ii) Let A be any IFSPGOS. Then Ac is an IFSPGOS. So (i) implies that spgcl(Ac) = (spgint(A))c is an IFSPGOS. Thus spgint(A) is an IFSPGCS in (X, τ). (ii) ⇒ (iii) Let A be an IFSPGOS. We have (spgcl(spgcl(A))c)c = (spgcl(spgint(Ac)))c. Since A is an IFSPGOS, Ac is IFSPGCS. So by (ii) spgint(Ac) is an IFSPGCS. That is spgcl(spgint(Ac)) = spgint(Ac). Hence (spgcl(spgint(Ac)))c = (spgint(Ac))c = spgcl(A). (iii) ⇒ (iv) Let A and B be any two IFSPGOSs in (X, τ) such that spgcl(A) = Bc. (iii) implies that spgcl(A) = (spgcl(spgcl(A))c)c =( spgcl(Bc)c)c = (spgcl(B))c. (iv) ⇒ (i) Let A be any IFSPGOS in (X, τ). Put B = (spgcl(A))c, then B is an IFSPGOS and spgcl(A) = Bc. Hence by (iv) , spgcl(A) = (spgcl(B))c. Since spgcl(B) is an IFSPGCS, it follows that spgcl(A) is an IFSPGOS. This implies that (X, τ) is an IFSPG extremally disconnected space. 4. REFERENCES [1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, 20, 1986, 87-96. [2] C. L. Chang, Fuzzy topological spaces, J.Math.Anal.Appl. 24, 1968, 182-190. [3] D. Coker, An introduction to intuitionistic fuzzy topological space, Fuzzy Sets and Systems, 88, 1997, 81-89. [4] H. Gurcay, Es. A. Haydar and D. Coker, On fuzzy continuity in intuitionistic fuzzy topological spaces, The J.Fuzzy Math.5 (2) , 1997, 365-378. [5] M. Thirumalaiswamy and K. M. Arifmohammed, Semipre Generalized Open Sets and Applications of Semipre Generalized Closed Sets in Intuitionistic Fuzzy Topological Spaces (submitted). [6] N. Turnali and D. Coker, Fuzzy connectedness in intuitionistic fuzzy topological spaces, FuzzySets and Systems 116 (2000) 369–375.
  • 5. International Journal of Computer Applications Technology and Research Volume 2– Issue 3, 224 - 228, 2013 www.ijcat.com 228 [7] M. Thirumalaiswamy and K. Ramesh, Intuitionistic fuzzy semi-pre generalized closed sets (submitted). [8] M. Thirumalaiswamy and K. Ramesh, Semipre Generalized Continuous and Irresolute Mappings in Intuitionistic Fuzzy Topological Space (submitted). [9] M. Thirumalaiswamy and K. Ramesh, Semipre Generalized Homeomorphisms in Intuitionistic Fuzzy Topological Spaces [10] Young Bae Jun and Seok- Zun Song, Intuitionistic fuzzy semi-pre open sets and Intuitionistic fuzzy semi-pre continuous mappings, Jour. of Appl. Math & computing, 2005, 467-474. [11] L. A. Zadeh, Fuzzy sets, Information and control, 8, 1965, 338-353.