![]() | Computer Modeling in Engineering & Sciences | ![]() |
DOI: 10.32604/cmes.2021.016996
ARTICLE
Neutrosophic N-Structures Applied to Sheffer Stroke BL-Algebras
1Department of Mathematics, Ege University, Izmir, 35100, Turkey
2Department of Mathematics, Payame Noor University, Tehran, 19395-4697, Iran
3Department of Mathematics and Science, University of New Mexico, Gallup, 87301, NM, USA
*Corresponding Author: Akbar Rezaei. Email: rezaei@pnu.ac.ir
Received: 18 April 2021; Accepted: 25 May 2021
Abstract: In this paper, we introduce a neutrosophic N-subalgebra, a (ultra) neutrosophic N-filter, level sets of these neutrosophic N-structures and their properties on a Sheffer stroke BL-algebra. By defining a quasi-subalgebra of a Sheffer stroke BL-algebra, it is proved that the level set of neutrosophic N-subalgebras on the algebraic structure is its quasi-subalgebra and vice versa. Then we show that the family of all neutrosophic N-subalgebras of a Sheffer stroke BL-algebra forms a complete distributive lattice. After that a (ultra) neutrosophic N-filter of a Sheffer stroke BL-algebra is described, we demonstrate that every neutrosophic N-filter of a Sheffer stroke BL-algebra is its neutrosophic N-subalgebra but the inverse is generally not true. Finally, it is presented that a level set of a (ultra) neutrosophic N-filter of a Sheffer stroke BL-algebra is also its (ultra) filter and the inverse is always true. Moreover, some features of neutrosophic N-structures on a Sheffer stroke BL-algebra are investigated.
Keywords: Sheffer stroke BL-algebra; (ultra) filter; neutrosophic 𝒩-subalgebra; (ultra) neutrosophic 𝒩-filter
Fuzzy set theory, which has the truth (t) (membership) function and state positive meaning of information, is introduced by Zadeh [1] as a generalization the classical set theory. This led scientists to find negative meaning of information. Hence, intuitionistic fuzzy sets [2] which are fuzzy sets with the falsehood (f) (nonmembership) function were introduced by Atanassov. However, there exist uncertainty and vagueness in the language, as well as positive ana negative meaning of information. Thus, Smarandache defined neutrosophic sets which are intuitionistic fuzzy sets with the indeterminacy/neutrality (i) function [3,4]. Thereby, neutrosophic sets are determined on three components: (t,i,f):(truth, indeterminacy, falsehood) [5]. Since neutrosophy enables that information in language can be comprehensively examined at all points, many researchers applied neutrosophy to different theoretical areas such as BCK/BCI-algebras, BE-algebras, semigroups, metric spaces, Sheffer stroke Hilbert algebras and strong Sheffer stroke non-associative MV-algebras [6–15] so as to improve devices imitating human behaviours and thoughts, artificial intelligence and technological tools.
Sheffer stroke (or Sheffer operation) was originally introduced by Sheffer [16]. Since Sheffer stroke can be used by itself without any other logical operators to build a logical system which is easy to control, Sheffer stroke can be applied to many logical algebras such as Boolean algebras [17], ortholattices [18], Sheffer stroke Hilbert algebras [19]. On the other side, BL-algebras were introduced by Hájek as an axiom system of his Basic Logic (BL) for fuzzy propositional logic, and he widely studied many types of filters [20]. Moreover, Oner et al. [21] introduced BL-algebras with Sheffer operation and investigated some types of (fuzzy) filters.
We give fundamental definitions and notions about Sheffer stroke BL-algebras, N-functions and neutrosophic N-structures defined by these functions on a crispy set X. Then a neutrosophic N-subalgebra and a (τ,γ,ρ)-level set of a neutrosophic N-structure are presented on Sheffer stroke BL-algebras. By defining a quasi-subalgebra of a Sheffer stroke BL-algebra, it is proved that every (τ,γ,ρ)-level set of a neutrosophic N-subalgebra of the algebra is the quasi-subalgebra and the inverse is true. Also, we show that the family of all neutrosophic N-subalgebras of this algebraic structure forms a complete distributive lattice. Some properties of neutrosophic N-subalgebras of Sheffer stroke BL-algebras are examined. Indeed, we investigate the case which N-functions defining a neutrosophic N-subalgebra of a Sheffer stroke BL-algebra are constant. Moreover, we define a (ultra) neutrosophic N-filter of a Sheffer stroke BL-algebra by N-functions and analyze many features. It is demonstrated that (τ,γ,ρ)-level set of a neutrosophic N-filter of a Sheffer stroke BL-algebra is its filter but the inverse does not hold in general. In fact, we propound that (τ,γ,ρ)-level set of a (ultra) neutrosophic N-filter of a Sheffer stroke BL-algebra is its (ultra) filter and the inverse is true. Finally, new subsets of a Sheffer stroke BL-algebra are defined by the N-functions and special elements of the algebra. It is illustrated that these subsets are (ultra) filters of a Sheffer stroke BL-algebra for the (ultra) neutrosophic N-filter but the special conditions are necessary to prove the inverse.
In this section, basic definitions and notions on Sheffer stroke BL-algebras and neutrosophic N-structures.
Definition 2.1. [18] Let H=⟨H,∣⟩ be a groupoid. The operation ∣ is said to be a Sheffer stroke (or Sheffer operation) if it satisfies the following conditions:
(S1) x∣y=y∣x,
(S2) (x∣x)∣(x∣y)=x,
(S3) x∣((y∣z)∣(y∣z))=((x∣y)∣(x∣y))∣z,
(S4) (x∣((x∣x)∣(y∣y)))∣(x∣((x∣x)∣(y∣y)))=x.
Definition 2.2. [21] A Sheffer stroke BL-algebra is an algebra (C,∨,∧,∣,0,1) of type (2, 2, 2, 0, 0) satisfying the following conditions:
(sBL −1) (C,∨,∧,0,1) is a bounded lattice,
(sBL −2) (C,∣) is a groupoid with the Sheffer stroke,
(sBL −3) c1∧c2=(c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2))),
(sBL −4) (c1∣(c2∣c2))∨(c2∣(c1∣c1))=1,
for all c1,c2∈C.
1=0∣0 is the greatest element and 0=1∣1 is the least element of C.
Proposition 2.1. [21] In any Sheffer stroke BL-algebra C, the following features hold, for all c1,c2,c3∈C:
(1) c1∣((c2∣(c3∣c3))∣(c2∣(c3∣c3)))=c2∣((c1∣(c3∣c3))∣(c1∣(c3∣c3))),
(2) c1∣(c1∣c1)=1,
(3) 1∣(c1∣c1)=c1,
(4) c1∣(1∣1)=1,
(5) (c1∣1)∣(c1∣1)=c1,
(6) (c1∣c2)∣(c1∣c2)≤c3⇔c1≤c2∣(c3∣c3)
(7) c1≤c2 iff c1∣(c2∣c2)=1,
(8) c1≤c2∣(c1∣c1),
(9) c1≤(c1∣c2)∣c2,
(10) (a) (c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2)))≤c1,
(b) (c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2)))≤c2.
(11) If c1≤c2, then
(i) c3∣(c1∣c1)≤c3∣(c2∣c2),
(ii) (c1∣c3)∣(c1∣c3)≤(c2∣c3)∣(c2∣c3),
(iii) c2∣(c3∣c3)≤c1∣(c3∣c3).
(12) c1∣(c2∣c2)≤(c3∣(c1∣c1))∣((c3∣(c2∣c2))∣(c3∣(c2∣c2))),
(13) c1∣(c2∣c2)≤(c2∣(c3∣c3))∣((c1∣(c3∣c3))∣(c1∣(c3∣c3))),
(14) ((c1∨c2)∣c3)∣((c1∨c2)∣c3)=((c1∣c3)∣(c1∣c3))∨((c2∣c3)∣(c2∣c3)),
(15) c1∨c2=((c1∣(c2∣c2))∣(c2∣c2))∧((c2∣(c1∣c1))∣(c1∣c1)).
Lemma 2.1. [21] Let C be a Sheffer stroke BL-algebra. Then
(c1∣(c2∣c2))∣(c2∣c2)=(c2∣(c1∣c1))∣(c1∣c1),for all c1,c2∈C.
Corollary 2.1. [21] Let C be a Sheffer stroke BL-algebra. Then
c1∨c2=(c1∣(c2∣c2))∣(c2∣c2),for all c1,c2∈C.
Lemma 2.2. [21] Let C be a Sheffer stroke BL-algebra. Then
c1∣((c2∣(c3∣c3))∣(c2∣(c3∣c3)))=(c1∣(c2∣c2))∣((c1∣(c3∣c3))∣(c1∣(c3∣c3))),for all c1,c2,c3∈C.
Definition 2.3. [21] A filter of C is a nonempty subset P⊆C satisfying
(SF−1) ifc1,c2∈P, then (c1∣c2)∣(c1∣c2)∈P,(SF−2) if c1∈P and c1≤c2, then c2∈P.Proposition 2.2. [21] Let P be a nonempty subset of C. Then P is a filter of C if and only if the following hold:
(SF−3)1∈P,(SF−4) c1∈P and c1∣(c2∣c2)∈P imply c2∈P.Definition 2.4. [21] Let P be a filter of C. Then P is called an ultra filter of C if it satisfies c∈P or c∣c∈P, for all c∈C.
Lemma 2.3. [21] A filter P of C is an ultra filter of C if and only if c1∨c2∈P implies c1∈P or c2∈P, for all c1,c2∈C.
Definition 2.5. [8] F(X,[−1,0]) denotes the collection of functions from a set X to [−1,0] and an element of F(X,[−1,0]) is called a negative-valued function from X to [−1,0] (briefly, N-function on X). An N-structure refers to an ordered pair (X, f) of X and N-function f on X.
Definition 2.6. [12] A neutrosophic N-structure over a nonempty universe X is defined by
XN:=X(TN,IN,FN)={x(TN(x),IN(x),FN(x)):x∈X}where TN, IN and FN are N-functions on X, called the negative truth membership function, the negative indeterminacy membership function and the negative falsity membership function, respectively.
Every neutrosophic N-structure XN over X satisfies the condition (∀x∈X)(−3≤TN(x)+IN(x)+FN(x)≤0).
Definition 2.7. [13] Let XN be a neutrosophic N-structure on a set X and τ,γ,ρ be any elements of [ −1, 0] such that −3≤τ+γ+ρ≤0. Consider the following sets:
TτN:={x∈X:TN(x)≤τ},IγN:={x∈X:IN(x)≥γ}and
FρN:={x∈X:FN(x)≤ρ}.The set
XN(τ,γ,ρ):={x∈X:TN(x)≤τ,IN(x)≥γ and TN(x)≤ρ}is called the (τ,γ,ρ)-level set of XN. Moreover, XN(τ,γ,ρ)=TτN∩IγN∩FρN.
Consider sets
XctN:={x∈X:TN(x)≤TN(ct)},XciN:={x∈X:IN(x)≥IN(ci)}and
XcfN:={x∈X:FN(x)≤FN(cf)},for any ct,ci,cf∈X. Obviously, ct∈XctN,ci∈XciN and cf∈XcfN [13].
In this section, neutrosophic N-subalgebras and neutrosophic N-filters on Sheffer stroke BL-algebras. Unless otherwise specified, C denotes a Sheffer stroke BL-algebra.
Definition 3.1. A neutrosophic N-structure CN on a Sheffer stroke BL-algebra C is called a neutrosophic N-subalgebra of C if the following condition is valid:
min{TN(c1),TN(c2)}≤TN(c1∣(c2∣c2)),max{IN(c1),IN(c2)}≥IN(c1∣(c2∣c2)) andmax{FN(c1),FN(c2)}≥FN(c1∣(c2∣c2)), (1)
for all c1,c2∈C.
Example 3.1. Consider a Sheffer stroke BL-algebra C where the set C={0,a,b,c,d,e,f,1} and the Sheffer operation ∣, the join operation ∨ and the meet operation ∧ on C has the Cayley tables in Tab. 1 [21]. Then a neutrosophic N-structure
CN={x(−0.08,−0.999,−0.26):x=d,1}∪{x(−0.92,−0.52,−0.0012):x∈C−{d,1}}on C is a neutrosophic N-subalgebra of C.
Definition 3.2. Let CN be a neutrosophic N-structure on a Sheffer stroke BL-algebra C and τ,γ,ρ be any elements of [ −1, 0] such that −3≤τ+γ+ρ≤0. For the sets
TτN:={c∈C:TN(c)≥τ},IγN:={c∈C:IN(c)≤γ}and
FρN:={c∈C:FN(c)≤ρ},the set
CN(τ,γ,ρ):={c∈C:TN(c)≥τ,IN(c)≤γ and FN(c)≤ρ}is called the (τ,γ,ρ)-level set of CN. Moreover, CN(τ,γ,ρ)=TτN∩IγN∩FρN.
Definition 3.3. A subset D of a Sheffer stroke BL-algebra C is called a quasi-subalgebra of C if c1∣(c2∣c2)∈D, for all c1,c2∈D. Obviously, C itself and {1} are quasi-subalgebras of C.
Example 3.2. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then {0,a,f,1} is a quasi-subalgebra of C.
Theorem 3.1. Let CN be a neutrosophic N-structure on a Sheffer stroke BL-algebra C and τ,γ,ρ be any elements of [ −1, 0] such that −3≤τ+γ+ρ≤0. If CN is a neutrosophic N-subalgebra of C, then the nonempty level set CN(τ,γ,ρ) of CN is a quasi-subalgebra of C.
Proof. Let CN be a neutrosophic N-subalgebra of C and c1, c2 be any elements of CN(τ,γ,ρ), for τ,γ,ρ∈[−1,0] with −3≤τ+γ+ρ≤0. Then TN(c1),TN(c2)≥τ,IN(c1),IN(c2)≤γ and FN(c1),FN(c2)≤ρ. Since
τ≤min{TN(c1),TN(c2)}≤TN(c1∣(c2∣c2)),IN(c1∣(c2∣c2))≤max{IN(c1),IN(c2)}≤γand
FN(c1∣(c2∣c2))≤max{FN(c1),FN(c2)}≤ρ,for all c1,c2∈C, we obtain that c1∣(c2∣c2)∈TτN, c1∣(c2∣c2)∈IγN and c1∣(c2∣c2)∈FρN, and so, c1∣(c2∣c2)∈TτN∩IγN∩FρN=CN(τ,γ,ρ). Hence, CN(τ,γ,ρ) is a quasi-subalgebra of C.
Theorem 3.2. Let CN be a neutrosophic N-structure on a Sheffer stroke BL-algebra C and TτN,IγN and FρN be quasi-subalgebras of C, for all τ,γ,ρ∈[−1,0] with −3≤τ+γ+ρ≤0. Then CN is a neutrosophic N-subalgebra of C.
Proof. Let CN be a neutrosophic N-structure on a Sheffer stroke BL-algebra C, and TτN,IγN and FρN be quasi-subalgebras of C, for all τ,γ,ρ∈[−1,0] with −3≤τ+γ+ρ≤0. Suppose that c1 and c2 be any elements of C such that w1=TN(c1∣(c2∣c2))<min{TN(c1),TN(c2)}=w2, c1 and c1. If τ1=12(w1+w2)∈[−1,0), γ1=12(t1+t2)∈[−1,0) and ρ1=12(r1+r2)∈[−1,0), then , and . Thus, c1,c2∈Tτ1N, c1,c2∈Iγ1N and c1,c2∈Fρ1N but c1∣(c2∣c2)∉Tτ1N, c1∣(c2∣c2)∉Iγ1N and c1∣(c2∣c2)∉Fρ1N, which are contradictions. Hence, min{TN(c1),TN(c2)}≤TN(c1∣(c2∣c2)), IN(c1∣(c2∣c2))≤max{IN(c1),IN(c2)} and FN(c1∣(c2∣c2))≤max{FN(c1),FN(c2)}, for all c1,c2∈C. Thereby, CN is a neutrosophic N-subalgebra of C.
Theorem 3.3. Let {CNi:i∈N} be a family of all neutrosophic N-subalgebras of a Sheffer stroke BL-algebra C. Then {CNi:i∈N} forms a complete distributive lattice.
Proof. Let D be a nonempty subset of {CNi:i∈N}. Since CNi is a neutrosophic N-subalgebra of C, for all i∈N, it satisfies the condition (1). Then ⋂D satisfies the condition (1). Thus, ⋂D is a neutrosophic N-subalgebra of C. Let E be a family of all neutrosophic N-subalgebras of C containing ⋃{CNi:i∈N}. Thus, ⋂E is also a neutrosophic N-subalgebra of C. If ⋀i∈NCNi=⋂i∈NCNi and ⋁i∈NCNi=⋂E, then ({CNi:i∈N},⋁,⋀) forms a complete lattice. Also, it is distibutive by the definitions of ⋁ and ⋀.
Lemma 3.1. Let CN be a neutrosophic N-subalgebra of a Sheffer stroke BL-algebra C. Then TN(c)≤TN(1), IN(c)≥IN(1) and FN(c)≥FN(1), for all c∈C.
Proof. Let CN be a neutrosophic N-subalgebra of C. Then it follows from Poposition 2.1 (2) that
TN(c)=min{TN(c),TN(c)}≤TN(c∣(c∣c))=TN(1),IN(1)=IN(c∣(c∣c))≤max{IN(c),IN(c)}=IN(c)and
FN(1)=FN(c∣(c∣c))≤max{FN(c),FN(c)}=FN(c),for all c∈C.
The inverse of Lemma 3.1 is not true in general.
Example 3.3. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then a neutrosophic N-structure
CN={x(−0.01,−0.1,−0.11):x=a,b,1}∪{x(−0.1,−0.01,−0.01):x∈C−{a,b,1}}on C is not a neutrosophic N-subalgebra of C since max{FN(a),FN(b)}=−0.11<−0.01=FN(f)=FN(a∣(b∣b)).
Lemma 3.2. A neutrosophic N-subalgebra CN of a Sheffer stroke BL-algebra C satisfies TN(c1)≤TN(c1∣(c2∣c2)), IN(c1)≥IN(c1∣(c2∣c2)) and FN(c1)≥FN(c1∣(c2∣c2)), for all c1,c2∈C if and only if TN, IN and FN are constant.
Proof. Let CN be a a neutrosophic N-subalgebra of C such that TN(c1)≤TN(c1∣(c2∣c2)), IN(c1)≥IN(c1∣(c2∣c2)) and FN(c1)≥FN(c1∣(c2∣c2)), for all c1,c2∈C. Since TN(1)≤TN(1∣(c∣c))=TN(c), IN(1)≥IN(1∣(c∣c))=IN(c) and FN(1)≥FN(1∣(c∣c))=FN(c) from Proposition 2.1 (3), it is obtained from Lemma 3.1 that TN(c) = TN(1), IN(c) = IN(1) and FN(c) = FN(1), for all c∈C. Hence, TN, IN and FN are constant.
Conversely, it is obvious since TN, IN and FN are constant.
Definition 3.4. A neutrosophic N-structure CN on a Sheffer stroke BL-algebra C is called a neutrosophic N-filter of C if
1. c1≤c2 implies TN(c1)≤TN(c2), IN(c2)≤IN(c1) and FN(c2)≤FN(c1),
2. min{TN(c1),TN(c2)}≤TN((c1∣c2)∣(c1∣c2)), IN((c1∣c2)∣(c1∣c2))≤max{IN(c1),IN(c2)} and FN((c1∣c2)∣(c1∣c2))≤max{FN(c1),FN(c2)},
for all c1,c2∈C.
Example 3.4. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then a neutrosophic N-structure
CN={x(−0.3,−1,−0.15):x=c,e,f,1}∪{x(−1,−0.7,0):x=0,a,b,d}on C is a neutrosophic N-filter of C.
Theorem 3.4. Let CN be a a neutrosophic N-structure on a Sheffer stroke BL-algebra C. Then CN is a neutrosophic N-filter of C if and only if
min{TN(c1),TN(c1∣(c2∣c2))}≤TN(c2)≤TN(1),IN(1)≤IN(c2)≤max{IN(c1),IN(c1∣(c2∣c2))} andFN(1)≤FN(c2)≤max{FN(c1),FN(c1∣(c2∣c2))}, (2)
for all c1,c2∈C.
Proof. Let CN be a neutrosophic N-filter of C. Then it follows from (sBL-3) and Definition 3.4 that
min{TN(c1),TN(c1∣(c2∣c2))}≤TN((c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2))))=TN(c1∧c2)≤TN(c2)≤TN(1),IN(1)≤IN(c2)≤IN(c1∧c2)=IN((c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2))))≤max{IN(c1),IN(c1∣(c2∣c2))}and
FN(1)≤FN(c2)≤FN(c1∧c2)=FN((c1∣(c1∣(c2∣c2)))∣(c1∣(c1∣(c2∣c2))))≤max{FN(c1),FN(c1∣(c2∣c2))},for all c1,c2∈C.
Conversely, let CN be a a neutrosophic N-structure on C satisfying the condition (2). Assume that c1≤c2. Then c1∣(c2∣c2)=1 from Proposition 2.1 (7). Thus,
TN(c1)=min{TN(c1),TN(1)}=min{TN(c1),TN(c1∣(c2∣c2))}≤TN(c2),IN(c2)≤max{IN(c1),IN(c1∣(c2∣c2))}=max{IN(c1),IN(1)}=IN(c1)and
FN(c2)≤max{FN(c1),FN(c1∣(c2∣c2))}=max{FN(c1),FN(1)}=FN(c1),for all c1,c2∈C. Also, it follows from Proposition 2.1 (9), (S1) and (S2) that
min{TN(c1),TN(c2)}≤min{TN(c1),TN(c1∣(c1∣c2))}=min{TN(c1),TN(c1∣(((c1∣c2)∣(c1∣c2))∣((c1∣c2)∣(c1∣c2))))}≤TN((c1∣c2)∣(c1∣c2)), IN((c1∣c2)∣(c1∣c2))≤max{IN(c1),IN(c1∣(((c1∣c2)∣(c1∣c2))∣((c1∣c2)∣(c1∣c2))))}=max{IN(c1),IN(c1∣(c1∣c2))}≤max{IN(c1),IN(c2)}and
FN((c1∣c2)∣(c1∣c2))≤max{FN(c1),FN(c1∣(((c1∣c2)∣(c1∣c2))∣((c1∣c2)∣(c1∣c2))))}=max{FN(c1),FN(c1∣(c1∣c2))}≤max{FN(c1),FN(c2)},for all c1,c2∈C. Thus, CN is a neutrosophic N-filter of C.
Corollary 3.1. Let CN be a neutrosophic N-filter of a Sheffer stroke BL-algebra C. Then
1. min{TN(c3),TN(c3∣(((c2∣(c1∣c1))∣(c1∣c1))∣((c2∣(c1∣c1))∣(c1∣c1))))}≤TN((c1∣(c2∣c2))∣(c2∣c2)), IN((c1∣(c2∣c2))∣(c2∣c2))≤max{IN(c3),IN(c3∣(((c2∣(c1∣c1))∣(c1∣c1))∣((c2∣(c1∣c1))∣(c1∣c1))))} and FN((c1∣(c2∣c2))∣(c2∣c2))≤max{FN(c3),FN(c3∣(((c2∣(c1∣c1))∣(c1∣c1))∣((c2∣(c1∣c1))∣(c1∣c1))))},
2. min{TN(c3),TN(c3∣((c1∣(c2∣c2))∣∣
3.
4.
for all
Proof. It is proved from Theorem 3.4, Lemma 2.1 and Lemma 2.2.
Lemma 3.3. Let CN be a neutrosophic
for all
Proof. Let CN be a neutrosophic
and
for all
Conversely, let CN be a neutrosophic
and
for all
Lemma 3.4. Every neutrosophic
Proof. Let CN be a neutrosophic
from Proposition 2.1 (1), (2), (4) and (S3), it follows from Proposition 2.1 (7) that
and
for all
The inverse of Lemma 3.4 is usually not true.
Example 3.5. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then a neutrosophic
on C is a neutrosophic
Definition 3.5. Let CN be a neutrosophic
Example 3.6. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then a neutrosophic
on C is an ultra neutrosophic
Remark 3.1. By Definition 3.5, every ultra neutrosophic
Example 3.7. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then a neutrosophic
of C is not ultra since
Lemma 3.5. Let CN be a neutrosophic
Proof. Let CN be an ultra neutrosophic
and
from (S1), (S3), Proposition 2.1 (2) and (4), it follows from Theorem 3.4 that
and similarly,
Conversely, let CN be a neutrosophic
Lemma 3.6. Let CN be a neutrosophic
Proof. Let CN be an ultra neutrosophic
and similarly,
Conversely, let CN be a neutrosophic
and
from Proposition 2.1 (2), (S1), (S2) and Corollary 2.1, it is obtained from Theorem 3.4 that
Theorem 3.5. Let CN be a neutrosophic
Proof. Let CN be a neutrosophic
and
Then
Theorem 3.6. Let CN be a neutrosophic
Proof. Let CN be a neutrosophic
and
for some
and
for all
Also, let
Definition 3.6. Let C be a Sheffer stroke BL-algebra. Define
and
for all
Example 3.8. Consider the Sheffer stroke BL-algebra C in Example 3.1. Let ct = a, ci = b,
Then
and
Theorem 3.7. Let ct, ci and cf be any elements of a Sheffer stroke BL-algebra C. If CN is a (ultra) neutrosophic
Proof. Let ct, ci and cf be any elements of C and CN be a neutrosophic
and
Then
Let CN be an ultra neutrosophic
and
from Lemma 3.6, it follows that
Example 3.9. Consider the Sheffer stroke BL-algebra C in Example 3.1. For a neutrosophic
of C, ct = b, ci = c and
and
of C are filters of C. Also,
The inverse of Theorem 3.7 does not hold in general.
Example 3.10. Consider the Sheffer stroke BL-algebra C in Example 3.1. Then
and
of C are filters of C but a neutrosophic
is not a neutrosophic
Theorem 3.8. Let ct, ci and cf be any elements of a Sheffer stroke BL-algebra C and CN be a neutrosophic
1. If
for all
2. If CN satisfies the condition (4) and
for all
Proof. Let CN be a neutrosophic
1. Assume that
2. Suppose that CN be a neutrosophic
and
Thus,
Example 3.11. Consider the Sheffer stroke BL-algebra C in Example 3.1. Let
Then the filters
Also, let
be a neutrosophic
and
of C are filters of C, where ct = f, ci = b and cf = 1 of C.
In the study, neutrosophic
In future works, we wish to study on plithogenic structures and relationships between neutrosophic
Acknowledgement: The authors are thankful to the referees for a careful reading of the paper and for valuable comments and suggestions.
Funding Statement: The authors received no specific funding for this study.
Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.
1. Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8(3), 338–353. DOI http://dx.doi.org/10.1016/S0019-9958(65)90241-X. [Google Scholar] [CrossRef]
2. Atanassov, K. T. (1986). Intuitionistic fuzzy sets. Fuzzy Sets and Systems, 20(1), 87–96. DOI 10.1016/S0165-0114(86)80034-3. [Google Scholar] [CrossRef]
3. Smarandache, F. (1999). A unifying field in logics. Neutrosophy: Neutrosophic probability, set and logic. Ann Arbor, Michigan, USA: ProQuest Co. [Google Scholar]
4. Smarandache, F. (2005). Neutrosophic set–A generalization of the intuitionistic fuzzy set. International Journal of Pure and Applied Mathematics, 24(3), 287–297. [Google Scholar]
5. Webmaster, University of New Mexico, Gallup Campus, USA, Biography. http://fsunm.edu/FlorentinSmarandache.htm. [Google Scholar]
6. Borumand Saeid, A., Jun, Y. B. (2017). Neutrosophic subalgebras of BCK/BCI-algebras based on neutrosophic points. Annals of Fuzzy Mathematics and Informatics, 14, 87–97. DOI 10.30948/afmi. [Google Scholar] [CrossRef]
7. Muhiuddin, G., Smarandache, F., Jun, Y. B. (2019). Neutrosophi quadruple ideals in neutrosophic quadruple BCI-algebras. Neutrosophic Sets and Systems, 25, 161–173. DOI 10.5281/zenodo.2631518. [Google Scholar] [CrossRef]
8. Jun, Y. B., Lee, K. J., Song, S. Z. (2009). N-ideals of BCK/BCI-algebras. Journal of the Chungcheong Mathematical Society, 22(3), 417–437. [Google Scholar]
9. Muhiuddin, G. (2021). P-ideals of BCI-algebras based on neutrosophic N-structures. Journal of Intelligent & Fuzzy Systems, 40(1), 1097–1105. DOI 10.3233/JIFS-201309. [Google Scholar] [CrossRef]
10. Oner, T., Katican, T., Borumand Saeid, A. (2021). Neutrosophic N-structures on sheffer stroke hilbert algebras. Neutrosophic Sets and Systems (in Press). [Google Scholar]
11. Oner, T., Katican, T., Rezaei, A. (2021). Neutrosophic N-structures on strong Sheffer stroke non-associative MV-algebras. Neutrosophic Sets and Systems, 40, 235–252. DOI 10.5281/zenodo.4549403. [Google Scholar] [CrossRef]
12. Khan, M., Anis, S., Smarandache, F., Jun, Y. B. (2017). Neutrosophic N-structures and their applications in semigroups. Annals of Fuzzy Mathematics and Informatics, 14(6), 583–598. [Google Scholar]
13. Jun, Y. B., Smarandache, F., Bordbar, H. (2017). Neutrosophic N-structures applied to BCK/BCI-algebras. Information–An International Interdisciplinary Journal, 8(128), 1–12. DOI 10.3390/info8040128. [Google Scholar] [CrossRef]
14. Sahin, M., Kargn, A., Çoban, M. A. (2018). Fixed point theorem for neutrosophic triplet partial metric space. Symmetry, 10(7), 240. DOI 10.3390/sym10070240. [Google Scholar] [CrossRef]
15. Rezaei, A., Borumand Saeid, A., Smarandache, F. (2015). Neutrosophic filters in BE-algebras. Ratio Mathematica, 29(1), 65–79. DOI 10.23755/rm.v29i1.22. [Google Scholar] [CrossRef]
16. Sheffer, H. M. (1913). A set of five independent postulates for boolean algebras, with application to logical constants. Transactions of the American Mathematical Society, 14(4), 481–488. DOI 10.1090/S0002-9947-1913-1500960-1. [Google Scholar] [CrossRef]
17. McCune, W., Veroff, R., Fitelson, B., Harris, K., Feist, A. et al. (2002). Short single axioms for boolean algebra. Journal of Automated Reasoning, 29(1), 1–16. DOI 10.1023/A:1020542009983. [Google Scholar] [CrossRef]
18. Chajda, I. (2005). Sheffer operation in ortholattices. Acta Universitatis Palackianae Olomucensis, Facultas Rerum Naturalium. Mathematica, 44(1), 19–23. [Google Scholar]
19. Oner, T., Katican, T., Borumand Saeid, A. (2021). Relation between sheffer stroke and hilbert algebras. Categories and General Algebraic Structures with Applications, 14(1), 245–268. DOI 10.29252/cgasa.14.1.245. [Google Scholar] [CrossRef]
20. Hájek, P. (2013). Metamathematics of fuzzy logic, vol. 4. Berlin, Germany: Springer Science & Business Media. [Google Scholar]
21. Oner, T., Katican, T., Borumand Saeid, A. (2023). (Fuzzy) filters of sheffer stroke bl-algebras. Kragujevac Journal of Mathematics, 47(1), 39–55. [Google Scholar]
![]() | This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |