Next Article in Journal
(ζ−m, ζm)-Type Algebraic Minimal Surfaces in Three-Dimensional Euclidean Space
Next Article in Special Issue
Neighborhood Structures and Continuities via Cubic Sets
Previous Article in Journal
Reconstruction of Differential Operators with Frozen Argument
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semigroup Structures and Commutative Ideals of BCK-Algebras Based on Crossing Cubic Set Structures

1
Department of Mathematics, Faculty of Arts and Sciences, Adıyaman University, Adıyaman 02040, Turkey
2
Department of Mathematics, Faculty of Sciences, Erzurum Technical University, Erzurum 25050, Turkey
3
Department of Mathematics Education, Gyeongsang National University, Jinju 52828, Korea
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(1), 25; https://doi.org/10.3390/axioms11010025
Submission received: 22 November 2021 / Revised: 1 January 2022 / Accepted: 5 January 2022 / Published: 9 January 2022
(This article belongs to the Special Issue Cubic Set Structure and Its Applications)

Abstract

:
First, semigroup structure is constructed by providing binary operations for the crossing cubic set structure. The concept of commutative crossing cubic ideal is introduced by applying crossing cubic set structure to commutative ideal in BCK-algebra, and several properties are investigated. The relationship between crossing cubic ideal and commutative crossing cubic ideal is discussed. An example to show that crossing cubic ideal is not commutative crossing cubic ideal is given, and then the conditions in which crossing cubic ideal can be commutative crossing cubic ideal are explored. Characterizations of commutative crossing cubic ideal are discussed, and the relationship between commutative crossing cubic ideal and crossing cubic level set is considered. An extension property of commutative crossing cubic ideal is established, and the translation of commutative crossing cubic ideal is studied. Conditions for the translation of crossing cubic set structure to be commutative crossing cubic ideal are provided, and its characterization is processed.

1. Introduction

A crisp set A in a universe K can be described as its characteristic function ξ A : K { 0 , 1 } . If we take an extension [ 0 , 1 ] of the range { 0 , 1 } in the characteristic function ξ A : K { 0 , 1 } , we can obtain a new function ξ : K [ 0 , 1 ] , and it is called the fuzzy set, which is introduced by Zadeh [1]. A fuzzy set is a very useful and valuable tool for processing positive information while having limitations in processing negative information. Based on the need for tools necessary to process negative information, Jun et al. [2] introduced the negative-valued function and applied it to the BCK/BCI-algebra. They discussed the ideal theory of BCK/BCI-algebras based on negative-valued functions. The interval-valued fuzzy set, which is defined by an interval-valued membership function, was proposed more than 40 years ago as a natural extension of the set of fuzzy. The fuzzy set theory and interval-valued fuzzy set theory are good mathematical tools for dealing with uncertainty in a parametric manner and are widely applied to pure mathematics, medical diagnosis, decision-making, etc. (see [3,4,5,6,7,8]). Yang et al. [9] attempted to combine the interval value fuzzy set and [10] the soft set for the purpose of obtaining a new soft set model, and then they used it to analyze a decision-making problem. The Pythagorean fuzzy set and interval value Pythagorean fuzzy set play an important role in the decision-making process. Abbas et al. [11] introduced the concept of a cubic Pythagorean fuzzy set based on the Pythagorean fuzzy set and the interval value Pythagorean fuzzy set. They developed a cubic Pythagorean fuzzy weighted mean operator and a cubic Pythagorean fuzzy weighted geometric operator, and they applied it to multi-attribute decision-making with unknown weight information. The spherical fuzzy sets and interval-valued spherical fuzzy sets are better methods to deal with fuzziness and uncertainty. Based on the spherical fuzzy sets and interval-valued spherical fuzzy sets, Ayaz et al. [12] introduced the spherical cubic fuzzy set and discussed various aggregation operators. Moreover, its application in multi-attribute decision-making is also discussed by Tehreem et al. [13]. In the social structure, where the development of science and the occurrence of complex problems involving various factors are frequent, we feel the need for new tools in the expectation that one tool will have limitations in solving these problems. Moreover, it can be observed that the cubic set theory is useful in dealing with the problem of uncertainty about positive information, but there is a limit to dealing with the problem of uncertainty, including negative information. Therefore, Jun et al. [14] introduced crossing cubic set structure as an extension of bipolar fuzzy set, consisting of interval-valued fuzzy set and negative-valued function, and applied it to BCK-algebra. In [15], Jun et al. introduced the crossing cubic ideal in BCK/BCI-algebra, closed crossing cubic ideal in BCI-algebra, and crossing cubic ∘-subalgebra of BCK-algebra with the condition (S). They identified the relationship between them. They provided conditions for crossing cubic structure to be closed crossing cubic ideal, and explored the conditions under which crossing cubic ideal is closed. They discussed characterizations of crossing cubic ideal, and we studied the translation of crossing cubic subalgebra and crossing cubic ideal.
In this paper, we first construct a semigroup structure by giving binary operations on the set of crossing cubic set structures. We apply the crossing cubic set structure to commutative ideals of BCK-algebras, and define commutative crossing cubic ideal. We investigate the relationship between crossing cubic ideal and commutative crossing cubic ideal. We first present an example in which crossing cubic ideal is not commutative crossing cubic ideal, and explore the conditions in which crossing cubic ideal can be commutative crossing cubic ideal. We discuss characterizations of commutative crossing cubic ideal, and investigate the relationship between commutative crossing cubic ideal and crossing cubic level set. We establish an extension property of commutative crossing cubic ideal. We study the translation of commutative crossing cubic ideal. We find conditions for the translation of crossing cubic set structure to be commutative crossing cubic ideal, and consider its characterization.

2. Preliminaries

A set K with a special element 0 and a binary operation “÷” is called BCI-algebra if it satisfies the following:
( a , b , c K ) ( ( ( a ÷ b ) ÷ ( a ÷ c ) ) ÷ ( c ÷ b ) = 0 ) ,
( a , b K ) ( ( a ÷ ( a ÷ b ) ) ÷ b = 0 ) ,
( a K ) ( a ÷ a = 0 ) ,
( a , b K ) ( a ÷ b = 0 , b ÷ a = 0 a = b ) .
A BCK-algebra is defined as a BCI-algebra K satisfying the following condition:
( a K ) ( 0 ÷ a = 0 ) .
Every BCI/BCK-algebra K satisfies the following:
( a K ) ( a ÷ 0 = a ) ,
( a , b , c K ) ( ( a ÷ b ) ÷ c = ( a ÷ c ) ÷ b ) ,
( a , b , c K ) ( a b a ÷ c b ÷ c , c ÷ b c ÷ a ) ,
A BCK-algebra K is said to be commutative (see [16]) if a b = b a for all a , b K where a b = a ÷ ( a ÷ b ) . We will abbreviate commutative BCK-algebra to cBCK-algebra.
A subset L of a BCI/BCK-algebra K is called the following:
  • A subalgebra of K (see [16,17]) if a ÷ b L for all a , b L .
  • An ideal of K (see [16,17]) if it satisfies
    0 L ,
    ( a , b K ) ( a ÷ b L , b L a L ) .
A subset L of a BCK-algebra K is called a commutative ideal of K (see [18]) if it satisfies Equation (9) and
( a , b , c K ) ( ( a ÷ b ) ÷ c L , c L a ÷ ( b a ) L ) .
We denote by F ( K , [ 1 , 0 ] ) the collection of all functions from a set K to [ 1 , 0 ] . We say that an element of F ( K , [ 1 , 0 ] ) is a negative-valued function from K to [ 1 , 0 ] (briefly, N -function on K). We define a relation ≤ on F ( K , [ 1 , 0 ] ) as follows:
ζ η ( a K ) ( ζ ( a ) η ( a ) )
for all ζ , η F ( K , [ 1 , 0 ] ) .
An interval number is defined to be a subinterval a ˜ = a , a + of [ 0 , 1 ] , where 0 a a + 1 . The interval numbers [ 0 , 0 ] and [ 1 , 1 ] are denoted by 0 ˜ and 1 ˜ , respectively. We denote by [[ 0 , 1 ] ] the set of all interval numbers. Let us define what is known as refined minimum (briefly, rmin ) of two elements in [ [ 0 , 1 ] ] . We also define the symbols “⪰”, “⪯”, “=” in case of two elements in [ [ 0 , 1 ] ] . Consider two interval numbers a ˜ 1 : = a 1 , a 1 + and a ˜ 2 : = a 2 , a 2 + . Then,
rmin a ˜ 1 , a ˜ 2 = min a 1 , a 2 , min a 1 + , a 2 + , a ˜ 1 a ˜ 2 a 1 a 2 , a 1 + a 2 + ,
and, similarly, we may have a ˜ 1 a ˜ 2 and a ˜ 1 = a ˜ 2 . To say a ˜ 1 a ˜ 2 (resp. a ˜ 1 a ˜ 2 ), we mean a ˜ 1 a ˜ 2 and a ˜ 1 a ˜ 2 (resp. a ˜ 1 a ˜ 2 and a ˜ 1 a ˜ 2 ). Let a ˜ i [ [ 0 , 1 ] ] where i Λ . We define
rinf i Λ a ˜ i = inf i Λ a i , inf i Λ a i + and rsup i Λ a ˜ i = sup i Λ a i , sup i Λ a i + .
Let K be a nonempty set. A function : K [ [ 0 , 1 ] ] is called an interval-valued fuzzy set (briefly, an IVF set) in K. Let [ [ 0 , 1 ] ] K stand for the set of all IVF sets in K . Every [ [ 0 , 1 ] ] K and a K , ( a ) = ( a ) , + ( a ) is called the degree of membership of an element a to , where : K [ 0 , 1 ] and + : K [ 0 , 1 ] are fuzzy sets in K which are called a lower fuzzy set and an upper fuzzy set in K , respectively. For simplicity, we denote = [ , + ] . For every , £ [ [ 0 , 1 ] ] K , we define
£ ( a ) £ ( a ) for all a K ,
and
= £ ( a ) = £ ( a ) for all a K .
Definition 1
([14]). By a crossing cubic set structure on a set K, we mean a pair K , C ( , ζ ) where
C ( , ζ ) : = { a , ( a ) , ζ ( a ) a K }
in which ℏ is an interval-valued fuzzy set in K and ζ is an N -function on K.
Definition 2
([14]). A crossing cubic set structure K , C ( , ζ ) on a BCI/BCK-algebra K is called a crossing cubic subalgebra of K if it satisfies the following:
( a , b K ) ( a ÷ b ) rmin { ( a ) , ( b ) } ζ ( a ÷ b ) max { ζ ( a ) , ζ ( b ) } .
Proposition 1
([14]). Every crossing cubic subalgebra K , C ( , ζ ) of a BCI/BCK-algebra K satisfies
( a K ) ( ( 0 ) ( a ) , ζ ( 0 ) ζ ( a ) ) .
Definition 3
([15]). A crossing cubic set structure K , C ( , ζ ) on a BCI/BCK-algebra K is called a crossing cubic ideal (briefly, CC-ideal) of K if it satisfies the following:
( x , y K ) ( 0 ) ( x ) rmin { ( x ÷ y ) , ( y ) } ζ ( 0 ) ζ ( x ) max { ζ ( x ÷ y ) , ζ ( y ) } .

3. Semigroup Structures of Crossing Cubic Set Structures

We denote by C C S ( K ) the collection of crossing cubic set structures on a set K.
Definition 4.
Let K , C ( , ζ ) , K , C ( £ , η ) C C S ( K ) . Then, the sum of K , C ( , ζ ) and K , C ( £ , η ) , denoted by K , C ( , ζ ) K , C ( £ , η ) , is defined as a crossing cubic set structure K , C ( £ , ζ η ) in which £ : K [ [ 0 , 1 ] ] and ζ η : K [ 1 , 0 ] are given as follows:
( £ ) ( x ) = [ ( £ ) ( x ) , ( £ ) + ( x ) ]
and ( ζ η ) ( x ) = ζ ( x ) + η ( x ) ζ ( x ) · η ( x ) , respectively, where
( £ ) ( x ) = ( x ) + £ ( x ) ( x ) · £ ( x )
and ( £ ) + ( x ) = + ( x ) + £ + ( x ) + ( x ) · £ + ( x ) .
Example 1.
Let K = [ 0 , 1 ] and we define
: K [ [ 0 , 1 ] ] , x [ 0.9 x , x ] , ζ : K [ 1 , 0 ] , x x
and
£ : K [ [ 0 , 1 ] ] , x [ 0.5 x 2 , x 2 ] , η : K [ 1 , 0 ] , x 1 2 x .
Then, K , C ( , ζ ) , K , C ( £ , η ) C C S ( K ) , and their sum
K , C ( , ζ ) K , C ( £ , η ) = K , C ( £ , ζ η )
is given as follows:
£ : K [ [ 0 , 1 ] ] , x [ 0.9 x + 0.5 x 2 0.45 x 3 , x + x 2 x 3 ] , ζ η : K [ 1 , 0 ] , x x 1 2 x 1 2 x 2 .
Let K , C ( , ζ ) ,   K , C ( £ , η ) ,   K , C ( ð , ξ ) C C S ( K ) . Then,
( £ ) ( x ) + ð ( x ) ( £ ) ( x ) · ð ( x ) = ( x ) + £ ( x ) ( x ) · £ ( x ) + ð ( x ) ( ( x ) + £ ( x ) ( x ) · £ ( x ) ) · ð ( x ) = ( x ) + £ ( x ) ( x ) · £ ( x ) + ð ( x ) ( x ) · ð ( x ) £ ( x ) · ð ( x ) + ( x ) · £ ( x ) · ð ( x ) ,
( x ) + ( £ ð ) ( x ) ( x ) · ( £ ð ) ( x ) = ( x ) + ( £ ( x ) + ð ( x ) £ ( x ) · ð ( x ) ) ( x ) · ( £ ( x ) + ð ( x ) £ ( x ) · ð ( x ) ) = ( x ) + £ ( x ) + ð ( x ) £ ( x ) · ð ( x ) ( x ) · £ ( x ) ( x ) · ð ( x ) + ( x ) · £ ( x ) · ð ( x ) ,
( £ ) + ( x ) + ð + ( x ) ( £ ) + ( x ) · ð + ( x ) = + ( x ) + £ + ( x ) + ( x ) · £ + ( x ) + ð + ( x ) ( + ( x ) + £ + ( x ) + ( x ) · £ + ( x ) ) · ð + ( x ) = + ( x ) + £ + ( x ) + ( x ) · £ + ( x ) + ð + ( x ) + ( x ) · ð + ( x ) £ + ( x ) · ð + ( x ) + + ( x ) · £ + ( x ) · ð + ( x ) ,
and
+ ( x ) + ( £ + ð + ) ( x ) + ( x ) · ( £ + ð + ) ( x ) = + ( x ) + ( £ + ( x ) + ð + ( x ) £ + ( x ) · ð + ( x ) ) + ( x ) · ( £ + ( x ) + ð + ( x ) £ + ( x ) · ð + ( x ) ) = + ( x ) + £ + ( x ) + ð + ( x ) £ + ( x ) · ð + ( x ) + ( x ) · £ + ( x ) + ( x ) · ð + ( x ) + + ( x ) · £ + ( x ) · ð + ( x ) ,
that is, ( £ ) ( x ) + ð ( x ) ( £ ) ( x ) · ð ( x ) = ( x ) + ( £ ð ) ( x ) ( x ) · ( £ ð ) ( x ) and ( £ ) + ( x ) + ð + ( x ) ( £ ) + ( x ) · ð + ( x ) = + ( x ) + ( £ + ð + ) ( x ) + ( x ) · ( £ + ð + ) ( x ) for all x K . Hence, ( £ ) η = ( £ η ) . In addition, we obtain
( ( ζ η ) ξ ) ( x ) = ( ζ η ) ( x ) + ξ ( x ) ( ζ η ) ( x ) · ξ ( x ) = ζ ( x ) + η ( x ) ζ ( x ) · η ( x ) + ξ ( x ) ( ζ ( x ) + η ( x ) ζ ( x ) · η ( x ) ) · ξ ( x ) = ζ ( x ) + η ( x ) ζ ( x ) · η ( x ) + ξ ( x ) ζ ( x ) · ξ ( x ) η ( x ) · ξ ( x ) + ζ ( x ) · η ( x ) · ξ ( x ) = ζ ( x ) + η ( x ) + ξ ( x ) η ( x ) · ξ ( x ) ζ ( x ) · η ( x ) ζ ( x ) · ξ ( x ) + ζ ( x ) · η ( x ) · ξ ( x ) = ζ ( x ) + ( η ( x ) + ξ ( x ) η ( x ) · ξ ( x ) ) ζ ( x ) · ( η ( x ) + ξ ( x ) η ( x ) · ξ ( x ) ) = ζ ( x ) + ( η ξ ) ( x ) ζ ( x ) · ( η ξ ) ( x ) = ( ζ ( η ξ ) ) ( x )
for all x K . Thus,
K , C ( , ζ ) K , C ( £ , η ) K , C ( ð , ξ ) = K , C ( , ζ ) K , C ( £ , η ) K , C ( ð , ξ ) .
Now, we have
( £ ) ( x ) = ( x ) + £ ( x ) ( x ) · £ ( x ) = £ ( x ) + ( x ) £ ( x ) · ( x ) = ( £ ) ( x ) ,
( £ ) + ( x ) = + ( x ) + £ + ( x ) + ( x ) · £ + ( x ) = £ + ( x ) + + ( x ) £ + ( x ) · + ( x ) = ( £ ) + ( x ) ,
and ( ζ η ) ( x ) = ζ ( x ) + η ( x ) ζ ( x ) · η ( x ) = η ( x ) + ζ ( x ) η ( x ) · ζ ( x ) = ( η ζ ) ( x ) for all x K . Hence, K , C ( , ζ ) K , C ( £ , η ) = K , C ( £ , η ) K , C ( , ζ ) .
Consider a crossing cubic set structure K , C ( 0 ˜ , 0 ) on K in which
0 ˜ : K [ [ 0 , 1 ] ] , x [ 0 , 0 ]
and
0 : K [ 1 , 0 ] , x 0 .
For every K , C ( , ζ ) C C S ( K ) , we obtain
( 0 ˜ ) ( x ) = [ ( x ) + 0 ˜ ( x ) ( x ) · 0 ˜ ( x ) , + ( x ) + 0 ˜ + ( x ) + ( x ) · 0 ˜ + ( x ) ] = [ ( x ) , + ( x ) ] ,
and ( ζ 0 ) ( x ) = ζ ( x ) + 0 ( x ) ζ ( x ) · 0 ( x ) = ζ ( x ) for all x K . Similarly, ( 0 ˜ ) ( x ) = [ ( x ) , + ( x ) ] and ( 0 ζ ) ( x ) = ζ ( x ) for all x K . Thus,
K , C ( , ζ ) K , C ( 0 ˜ , 0 ) = K , C ( , ζ ) = K , C ( 0 ˜ , 0 ) K , C ( , ζ ) .
Based on the above calculations, we obtain the next theorem.
Theorem 1.
The collection C C S ( K ) is a commutative monoid under the operation with identity K , C ( 0 ˜ , 0 ) .
Definition 5.
Let K , C ( , ζ ) , K , C ( £ , η ) C C S ( K ) . Then, the product of K , C ( , ζ ) and K , C ( £ , η ) , denoted by K , C ( , ζ ) K , C ( £ , η ) , is defined as a crossing cubic set structure K , C ( £ , ζ η ) where
£ : K [ [ 0 , 1 ] ] , x [ ( x ) · £ ( x ) , + ( x ) · £ + ( x ) ] , ζ η : K [ 1 , 0 ] , x ζ ( x ) · η ( x ) .
Example 2.
Consider the crossing cubic set structures K , C ( , ζ ) and K , C ( £ , η ) in Example 1. Then, their product
K , C ( , ζ ) K , C ( £ , η ) = K , C ( £ , ζ η )
is given as follows:
£ : K [ [ 0 , 1 ] ] , x [ 0.45 x 3 , x 3 ] , ζ η : K [ 1 , 0 ] , x 1 2 x 2 .
Theorem 2.
The collection C C S ( K ) is a commutative semigroup under the operation .
Proof. 
Let K , C ( , ζ ) ,   K , C ( £ , η ) ,   K , C ( ð , ξ ) C C S ( K ) . Then,
( ( £ ) ð ) ( x ) = [ ( £ ) ( x ) · ð ( x ) , ( £ ) + ( x ) · ð + ( x ) ] = [ ( ( x ) · £ ( x ) ) · ð ( x ) , ( + ( x ) · £ + ( x ) ) · ð + ( x ) ] = [ ( x ) · ( £ ( x ) · ð ( x ) ) , + ( x ) · ( £ + ( x ) · ð + ( x ) ) ] = [ ( x ) · ( £ ð ) ( x ) , + ( x ) · ( £ ð ) + ( x ) ] = ( ( £ ð ) ) ( x )
and
( ( ζ η ) ξ ) ( x ) = ( ζ η ) ( x ) · ξ ( x ) = ( ζ ( x ) · η ( x ) ) · ξ ( x ) = ζ ( x ) · ( η ( x ) · ξ ( x ) ) = ζ ( x ) · ( η ξ ) ( x ) = ( ζ ( η ξ ) ) ( x )
for all x K . Hence,
K , C ( , ζ ) K , C ( £ , η ) K , C ( ð , ξ ) = K , C ( , ζ ) K , C ( £ , η ) K , C ( ð , ξ ) .
In addition, we have
( £ ) ( x ) = [ ( x ) · £ ( x ) , + ( x ) · £ + ( x ) ] = [ £ ( x ) · ( x ) , £ + ( x ) · + ( x ) ] = ( £ ) ( x )
and
( ζ η ) ( x ) = [ ζ ( x ) · η ( x ) , ζ + ( x ) · η + ( x ) ] = [ η ( x ) · ζ ( x ) , η + ( x ) · ζ + ( x ) ] = ( η ζ ) ( x )
for all x K . Thus, K , C ( , ζ ) K , C ( £ , η ) = K , C ( £ , η ) K , C ( , ζ ) and therefore ( C C S ( K ) , ) is a commutative semigroup. □

4. Crossing Cubic Set Structure Applied to Commutative Ideals in BCK-Algebras

In the following, let K denote a BCK-algebra unless otherwise specified.
Definition 6.
A crossing cubic set structure K , C ( , ζ ) on K is called a commutative crossing cubic ideal (briefly, cCC-ideal) of K if it satisfies
( x K ) ( 0 ) ( x ) , ζ ( 0 ) ζ ( x )
and
( x , y , z K ) ( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } .
If K is commutative, then the condition Equation (18) is equivalent to the next condition:
( x , y , z K ) ( x ÷ ( x y ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ζ ( x ÷ ( x y ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } .
Example 3.
Let K = { 0 , ϱ 1 , ϱ 2 , ϱ 3 } be a set with the binary operation “÷” which is given in Table 1.
Then, K is a BCK-algebra (see [16]). Let K , C ( , ζ ) be a crossing cubic set structure on K, which is given by Table 2.
It is routine to verify that K , C ( , ζ ) is a cCC-ideal of K.
We discuss the relationship between CC-ideal and cCC-ideal.
Theorem 3.
Every cCC-ideal is a CC-ideal.
Proof. 
Let K , C ( , ζ ) be a cCC-ideal of K. If we place y = 0 in Equation (18) and use Equations (5) and (6), then
( x ) = ( x ÷ ( 0 x ) ) rmin { ( ( x ÷ 0 ) ÷ z ) , ( z ) } = rmin { ( x ÷ z ) , ( z ) }
and ζ ( x ) = ζ ( x ÷ ( 0 x ) ) max { ζ ( ( x ÷ 0 ) ÷ z ) , ζ ( z ) } = max { ζ ( x ÷ z ) , ζ ( z ) } for all x , z K . Therefore, K , C ( , ζ ) is a CC-ideal of K. □
The example below informs the existence of the CC-ideal, not the cCC-ideal.
Example 4.
Let K = { 0 , ϱ 1 , ϱ 2 , ϱ 3 , ϱ 4 } be a set with the binary operation “÷”, which is given in Table 3.
Then, K is a BCK-algebra (see [16]). Let K , C ( , ζ ) be a crossing cubic set structure on K, which is given by Table 4.
It is routine to verify that K , C ( , ζ ) is a CC-ideal of K, but it is not a cCC-ideal of K because ( ϱ 2 ÷ ( ϱ 3 ϱ 2 ) ) = ( ϱ 2 ) = [ 0.28 , 0.66 ] [ 0.42 , 0.84 ] = rmin { ( ( ϱ 2 ÷ ϱ 3 ) ÷ 0 ) , ( 0 ) } and/or ζ ( ϱ 2 ÷ ( ϱ 3 ϱ 2 ) ) = ζ ( ϱ 2 ) = 0.58 0.87 = max { ζ ( ( ϱ 2 ÷ ϱ 3 ) ÷ 0 ) , ζ ( 0 ) } .
We explore the conditions under which a CC-ideal can be a cCC-ideal.
Lemma 1
([15]). Every CC-ideal K , C ( , ζ ) of K satisfies the following:
( x , y , z K ) x ÷ y z ( x ) rmin { ( y ) , ( z ) } ζ ( x ) max { ζ ( y ) , ζ ( z ) } .
Theorem 4.
In a cBCK-algebra, every CC-ideal is a cCC-ideal.
Proof. 
Let K , C ( , ζ ) be a CC-ideal of a cBCK-algebra K. The combination of Equations (1), (3), (7), and the commutativity of K derive the following:
( ( x ÷ ( y x ) ) ÷ ( ( x ÷ y ) ÷ z ) ) ÷ z = ( ( x ÷ ( y x ) ) ÷ z ) ÷ ( ( x ÷ y ) ÷ z ) ( x ÷ ( y x ) ) ÷ ( x ÷ y ) = ( x y ) ÷ ( y x ) = 0 ,
that is, ( x ÷ ( y x ) ) ÷ ( ( x ÷ y ) ÷ z ) z for all x , y , z K . It follows from Lemma 1 that ( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } and
ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } .
Therefore, K , C ( , ζ ) is a cCC-ideal of K. □
Corollary 1.
If a BCK-algebra K satisfies any of the following conditions:
( x , y K ) ( x y y x ) ,
( x , y K ) ( x y = y ÷ ( y ÷ ( x y ) ) ) ,
( x , y K ) ( x y x = y x ) ,
then every CC-ideal is a cCC-ideal.
Proof. 
If a BCK-algebra K satisfies any of three conditions Equations (21)–(23), then K is a cBCK-algebra. Hence every CC-ideal is a cCC-ideal by Theorem 4. □
Note that every BCK-algebra K which is a lower semilattice with respect to the order relation “≤” is a cBCK-algebra. Hence, we have the next corollary.
Corollary 2.
If a BCK-algebra K is a lower semilattice with respect to the order relation “≤”, then every CC-ideal is a cCC-ideal.
Theorem 5.
Every CC-ideal K , C ( , ζ ) of K that satisfies
( x , y , z K ) ( ( x ÷ z ) ÷ ( y x ) ) ( ( x ÷ y ) ÷ z ) ζ ( ( x ÷ z ) ÷ ( y x ) ) ζ ( ( x ÷ y ) ÷ z ) .
is a cCC-ideal of K.
Proof. 
Let K , C ( , ζ ) be a CC-ideal of K that satisfies the condition Equation (24). The combination of Equations (7), (16), and (24) leads to
( x ÷ ( y x ) ) rmin { ( ( x ÷ ( y x ) ) ÷ z ) , ( z ) } = rmin { ( ( x ÷ z ) ÷ ( y x ) ) , ( z ) } rmin { ( ( x ÷ y ) ÷ z ) , ( z ) }
and
ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ ( y x ) ) ÷ z ) , ζ ( z ) } = max { ζ ( ( x ÷ z ) ÷ ( y x ) ) , ζ ( z ) } max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) }
for all x , y , z K . Therefore, K , C ( , ζ ) is a cCC-ideal of K. □
Theorem 6.
A crossing cubic set structure K , C ( , ζ ) on K is a cCC-ideal of K if, and only if, it is a CC-ideal of K that satisfies
( x , y K ) ( x ÷ ( y x ) ) ( x ÷ y ) ζ ( x ÷ ( y x ) ) ζ ( x ÷ y ) .
Proof. 
Assume that K , C ( , ζ ) is a cCC-ideal of K. Then, it is a CC-ideal of K by Theorem 3, and hence we replace z with 0 in Equation (18) and then use Equations (6) and (16) to find Equation (25).
Conversely, let K , C ( , ζ ) be a CC-ideal of K that satisfies the condition Equation (25). Then, ( x ÷ ( y x ) ) ( x ÷ y ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } and ζ ( x ÷ ( y x ) ) ζ ( x ÷ y ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } for all x , y , z K . Therefore, K , C ( , ζ ) is a cCC-ideal of K. □
Given a crossing cubic set structure K , C ( , ζ ) on K and an element v K , we consider the next set, which is called a crossing cubic level set:
K v : = { x K ( x ) ( v ) , ζ ( x ) ζ ( v ) } .
Theorem 7.
If K , C ( , ζ ) is a cCC-ideal of K, then the set K v in Equation (26) is a commutative ideal of K for all v K .
Proof. 
Let v K . It is clear that 0 K v by Equation (17). Let x , y , z K be such that z K v and ( x ÷ y ) ÷ z K v . Then, ( z ) ( v ) , ( ( x ÷ y ) ÷ z ) ( v ) , ζ ( z ) ζ ( v ) and ζ ( ( x ÷ y ) ÷ z ) ζ ( v ) . It follows from Equation (18) that
( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ( v )
and ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } ζ ( v ) . Hence, x ÷ ( y x ) K v , and therefore K v is a commutative ideal of K. □
Proposition 2.
Given a crossing cubic set structure K , C ( , ζ ) on K, if K v is a commutative ideal of K for v K , then the following assertion is valid.
rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ( v ) ( x ÷ ( y x ) ) ( v ) , max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } ζ ( v ) ζ ( x ÷ ( y x ) ) ζ ( v ) .
for all x , y , z K .
Proof. 
Assume that K v is a commutative ideal of K for v K . Let x , y , z K be such that rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ( v ) and max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } ζ ( v ) . Then, ( x ÷ y ) ÷ z K v and z K v , which imply from Equation (11) that x ÷ ( y x ) K v . Therefore, ( x ÷ ( y x ) ) ( v ) and ζ ( x ÷ ( y x ) ) ζ ( v ) . □
Theorem 8.
If a crossing cubic set structure K , C ( , ζ ) on K satisfies Equations (17) and (27), then the set K v is a commutative ideal of K for v K .
Proof. 
Let K , C ( , ζ ) be a crossing cubic set structure on K that satisfies Equations (17) and (27). Let v , x , y , z K be such that ( x ÷ y ) ÷ z K v and z K v . Then, ( ( x ÷ y ) ÷ z ) ( v ) , ζ ( ( x ÷ y ) ÷ z ) ζ ( v ) , ( z ) ( v ) and ζ ( z ) ζ ( v ) , which imply that rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } ( v ) and max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } ζ ( v ) . Combining these with Equation (27) leads to ( x ÷ ( y x ) ) ( v ) and ζ ( x ÷ ( y x ) ) ζ ( v ) . Hence, x ÷ ( y x ) K v . The condition Equation (17) induces 0 K v . Therefore K v is a commutative ideal of K. □
Let K , C ( , ζ ) be a crossing cubic set structure on K. We define a level set of K , C ( , ζ ) , written as L K , C ( , ζ ) , as follows:
L K , C ( , ζ ) , β ˜ , t = L ( K , , β ˜ ) L ( K , ζ , t )
where L ( K , , β ˜ ) = { x K ( x ) β ˜ } and L ( K , ζ , t ) = { x K ζ ( x ) t } for β ˜ : = [ β , β + ] [ [ 0 , 1 ] ] and t [ 1 , 0 ] . We say that L ( K , , β ˜ ) and L ( K , ζ , t ) are ℏ-level set and ζ-level set of K , C ( , ζ ) with level indices β ˜ and t, respectively.
Theorem 9.
If K , C ( , ζ ) is a cCC-ideal of K, then its nonempty ℏ-level set and ζ-level set are commutative ideals of K for all level indices.
Proof. 
Let β ˜ and t be level indices of K , C ( , ζ ) such that L ( K , , β ˜ ) and L ( K , ζ , t ) are nonempty. Then there exists x L ( K , , β ˜ ) L ( K , ζ , t ) , and so ( 0 ) ( x ) β ˜ and ζ ( 0 ) ζ ( x ) t . Thus, 0 L ( K , , β ˜ ) L ( K , ζ , t ) . Let x , y , z K be such that ( x ÷ y ) ÷ z L ( K , , β ˜ ) L ( K , ζ , t ) and z L ( K , , β ˜ ) L ( K , ζ , t ) . Then, ( ( x ÷ y ) ÷ z ) β ˜ , ( z ) β ˜ , ζ ( ( x ÷ y ) ÷ z ) t and ζ ( z ) t . It follows from Equation (18) that
( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } β ˜
and ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } t . Hence, x ÷ ( y x ) L ( K , , β ˜ ) L ( K , ζ , t ) . Therefore, L ( K , , β ˜ ) and L ( K , ζ , t ) are commutative ideals of K. □
Corollary 3.
If K , C ( , ζ ) is a cCC-ideal of K, then its nonempty level set L K , C ( , ζ ) , β ˜ , t is a commutative ideal of K for all β ˜ : = [ β , β + ] [ [ 0 , 1 ] ] and t [ 1 , 0 ] .
Theorem 10.
Let K , C ( , ζ ) be a crossing cubic set structure on K in which its nonempty ℏ-level set and ζ-level set are commutative ideals of K for all level indices. Then, K , C ( , ζ ) is a cCC-ideal of K.
Proof. 
Assume that L ( K , , β ˜ ) and L ( K , ζ , t ) are nonempty commutative ideals of K for all β ˜ : = [ β , β + ] [ [ 0 , 1 ] ] and t [ 1 , 0 ] . Suppose K , C ( , ζ ) is not a cCC-ideal of K. Then at least one of Equations (17) and (18) is not valid. Suppose that Equation (18) is not valid. Then, there exist a , b , x , y K be such that ( a ÷ ( b a ) ) rmin { ( ( a ÷ b ) ÷ c ) , ( c ) } or ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } . If we take β ˜ : = [ β , β + ] = rmin { ( ( a ÷ b ) ÷ c ) , ( c ) } , then ( a ÷ b ) ÷ c L ( K , , β ˜ ) and c L ( K , , β ˜ ) , but a ÷ ( b a ) L ( K , , β ˜ ) . In addition, if we take t = max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } , then ( x ÷ y ) ÷ z L ( K , ζ , t ) and z L ( K , ζ , t ) , but x ÷ ( y x ) L ( K , ζ , t ) . This is a contradiction, and so Equation (18) is valid. In the same way, if Equation (17) is not established, it leads to a contradiction. Therefore, K , C ( , ζ ) is a cCC-ideal of K. □
Theorem 11.
Given a subset L of K, we define a crossing cubic set structure K , C ( , ζ ) on K as follows:
: K [ [ 0 , 1 ] ] , x β ˜ : = [ β , β + ] if x L , 0 ˜ : = [ 0 , 0 ] otherwise , ζ : K [ 1 , 0 ] , x t if x L , 0 otherwise ,
where β , β + ( 0 , 1 ] with β < β + and t [ 1 , 0 ) . Then L is a commutative ideal of K if and only if K , C ( , ζ ) is a cCC-ideal of K.
Proof. 
The definition of K , C ( , ζ ) derives L ( K , , β ˜ ) = L , L ( K , , 0 ˜ ) = K ,   L ( K , ζ , t ) = L and L ( K , ζ , 0 ) = K . Hence, the desired result can be obtained by Theorems 9 and 10. □
Note that a CC-ideal might not be a cCC-ideal (see Example 4), but we can consider the extension property for a cCC-ideal.
Lemma 2
([16]). Let A and B be ideals of K such that A B . If A is a commutative ideal of K, then so is B.
Theorem 12.
Let K , C ( , ζ ) and K , C ( £ , η ) be CC-ideals of K such that
( 0 ) = £ ( 0 ) , ζ ( 0 ) = η ( 0 ) ,
( x ( 0 ) K ) ( ( x ) £ ( x ) , ζ ( x ) η ( x ) ) .
If K , C ( , ζ ) is a cCC-ideal of K, then so is K , C ( £ , η ) .
Proof. 
Assume that K , C ( , ζ ) is a cCC-ideal of K. Then, its nonempty -level set and ζ -level set are commutative ideals of K for all level indices by Theorem 9, that is, L ( K , , β ˜ ) and L ( K , ζ , t ) are commutative ideals of K whenever they are nonempty for all β ˜ : = [ β , β + ] [ [ 0 , 1 ] ] and t [ 1 , 0 ] . It is clear from Equations (29) and (30) that L ( K , , β ˜ ) L ( K , £ , β ˜ ) and L ( K , ζ , t ) L ( K , η , t ) . As K , C ( £ , η ) is a CC-ideals of K, we know that L ( K , £ , β ˜ ) and L ( K , η , t ) are ideals of K. It follows from Lemma 2 that L ( K , £ , β ˜ ) and L ( K , η , t ) are commutative ideals of K. Therefore, K , C ( £ , η ) is a cCC-ideal of K by Theorem 10. □

5. Translations of Commutative Crossing Cubic Ideals

Given a crossing cubic set structure K , C ( , ζ ) on a set K, we denote
: = 1 inf { ζ ( x ) x K } and : = 1 sup { + ( x ) x K } .
For every k [ 1 , 0 ] with k and β ˜ = [ β , β + ] [ [ 0 , 1 ] ] with β + , we define
β ˜ T : K [ [ 0 , 1 ] ] , x ( x ) + β ˜ , ζ k T : K [ 1 , 0 ] , x ζ ( x ) + k .
Then, K , C ( β ˜ T , ζ k T ) is a crossing cubic set structure on K, which is called the ( β ˜ , k ) -translation of K , C ( , ζ ) .
Theorem 13.
If K , C ( , ζ ) is a cCC-ideal of K, then its ( β ˜ , k ) -translation K , C ( β ˜ T , ζ k T ) is also a cCC-ideal of K for all β ˜ = [ β , β + ] [ [ 0 , 1 ] ] and k [ 1 , 0 ] with β + and k , respectively.
Proof. 
Let k [ 1 , 0 ] with k and β ˜ = [ β , β + ] [ [ 0 , 1 ] ] with β + . Assume that K , C ( , ζ ) is a cCC-ideal of K and let x , y , z K . Then,
β ˜ T ( 0 ) = ( 0 ) + β ˜ ( x ) + β ˜ = β ˜ T ( x ) ,
ζ k T ( 0 ) = ζ ( 0 ) + k ζ ( x ) + k = ζ k T ( x ) ,
β ˜ T ( x ÷ ( y x ) ) = ( x ÷ ( y x ) ) + β ˜ rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } + β ˜ = rmin { ( ( x ÷ y ) ÷ z ) + β ˜ , ( z ) + β ˜ } = rmin { β ˜ T ( ( x ÷ y ) ÷ z ) , β ˜ T ( z ) }
and
ζ k T ( x ÷ ( y x ) ) = ζ ( x ÷ ( y x ) ) + k max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } + k = max { ζ ( ( x ÷ y ) ÷ z ) + k , ζ ( z ) + k } = max { ζ k T ( ( x ÷ y ) ÷ z ) , ζ k T ( z ) } .
Hence, K , C ( β ˜ T , ζ k T ) is a cCC-ideal of K. □
Theorem 14.
Let K , C ( , ζ ) be a crossing cubic set structure on K. If there exist k [ 1 , 0 ] and β ˜ = [ β , β + ] [ [ 0 , 1 ] ] with k and β + , respectively, such that the ( β ˜ , k ) -translation K , C ( β ˜ T , ζ k T ) of K , C ( , ζ ) is a cCC-ideal of K, then K , C ( , ζ ) is a cCC-ideal of K.
Proof. 
Assume that the ( β ˜ , k ) -translation K , C ( β ˜ T , ζ k T ) of K , C ( , ζ ) is a cCC-ideal of K for some β ˜ = [ β , β + ] [ [ 0 , 1 ] ] and k [ 1 , 0 ] with β + and k , respectively. Then, ( 0 ) + β ˜ = β ˜ T ( 0 ) β ˜ T ( x ) = ( x ) + β ˜ and ζ ( 0 ) + k = ζ k T ( 0 ) ζ k T ( x ) = ζ ( x ) + k for all x K . Hence, ( 0 ) ( x ) and ζ ( 0 ) ζ ( x ) for all x K . For every x , y , z K , we have
( x ÷ ( y x ) ) + β ˜ = β ˜ T ( x ÷ ( y x ) ) rmin { β ˜ T ( ( x ÷ y ) ÷ z ) , β ˜ T ( z ) } = rmin { ( ( x ÷ y ) ÷ z ) + β ˜ , ( z ) + β ˜ } = rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } + β ˜
and
ζ ( x ÷ ( y x ) ) + k = ζ k T ( x ÷ ( y x ) ) max { ζ k T ( ( x ÷ y ) ÷ z ) , ζ k T ( z ) } = max { ζ ( ( x ÷ y ) ÷ z ) + k , ζ ( z ) + k } = max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } + k
which imply that ( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } and ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } . Consequently, K , C ( , ζ ) is a cCC-ideal of K. □
Let K , C ( , ζ ) be a crossing cubic set structure on K and consider k [ 1 , 0 ] and β ˜ = [ β , β + ] [ [ 0 , 1 ] ] with k and β + , respectively. We take a set
C ( , ζ ) ( γ ˜ , r ) : = { x K ( x ) γ ˜ β ˜ , ζ ( x ) r k }
where γ ˜ [ [ 0 , 1 ] ] and r [ 1 , 0 ] such that γ ˜ β ˜ , γ + and r < k .
Theorem 15.
If K , C ( , ζ ) is a cCC-ideal of K, then the set C ( , ζ ) ( γ ˜ , r ) in (33) is a commutative ideal of K for all γ ˜ [ [ 0 , 1 ] ] and r [ 1 , 0 ] such that γ ˜ β ˜ , γ + and r < k .
Proof. 
Suppose that K , C ( , ζ ) is a cCC-ideal of K and let x , y , z K be such that ( x ÷ y ) ÷ z C ( , ζ ) ( γ ˜ , r ) and z C ( , ζ ) ( γ ˜ , r ) . Then, ( ( x ÷ y ) ÷ z ) γ ˜ β ˜ , ζ ( ( x ÷ y ) ÷ z ) r k , ( z ) γ ˜ β ˜ , and ζ ( z ) r k . It follows from Equation (18) that ( x ÷ ( y x ) ) rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } γ ˜ β ˜ and ζ ( x ÷ ( y x ) ) max { ζ ( ( x ÷ y ) ÷ z ) , ζ ( z ) } r k . Thus, x ÷ ( y x ) C ( , ζ ) ( γ ˜ , r ) . It is clear that 0 C ( , ζ ) ( γ ˜ , r ) . Therefore, C ( , ζ ) ( γ ˜ , r ) is a commutative ideal of K. □
We explore the conditions under which the ( β ˜ , k ) -translation of a crossing cubic set structure on K becomes a cCC-ideal of K.
Theorem 16.
Let K , C ( , ζ ) be a crossing cubic set structure on K. Then, the ( β ˜ , k ) -translation K , C ( β ˜ T , ζ k T ) of K , C ( , ζ ) is a cCC-ideal of K if, and only if, the nonempty sets
C ( , ζ ) ( γ ˜ ) : = { x K ( x ) γ ˜ β ˜ } and C ( , ζ ) ( r ) : = { x K ζ ( x ) r k }
are commutative ideals of K for all γ ˜ [ [ 0 , 1 ] ] and r [ 1 , 0 ] such that γ ˜ β ˜ , γ + and r < k .
Proof. 
Assume that K , C ( β ˜ T , ζ k T ) is a cCC-ideal of K. Let x C ( , ζ ) ( γ ˜ ) and a C ( , ζ ) ( r ) for all γ ˜ [ [ 0 , 1 ] ] and r [ 1 , 0 ] such that γ ˜ β ˜ , γ + and r < k . Then,
( 0 ) + β ˜ = β ˜ T ( 0 ) β ˜ T ( x ) = ( x ) + β ˜ γ ˜ β ˜ + β ˜ = γ ˜
and
ζ ( 0 ) + k = ζ k T ( 0 ) ζ k T ( a ) = ζ ( a ) + k r k + k = r ,
which shows that 0 C ( , ζ ) ( γ ˜ ) C ( , ζ ) ( r ) . Let x , y , z , a , b , c K be such that ( x ÷ y ) ÷ z C ( , ζ ) ( γ ˜ ) , z C ( , ζ ) ( γ ˜ ) , ( a ÷ b ) ÷ c C ( , ζ ) ( r ) and c C ( , ζ ) ( r ) . Then,
( x ÷ ( y x ) ) + β ˜ = β ˜ T ( x ) rmin { β ˜ T ( ( x ÷ y ) ÷ z ) , β ˜ T ( z ) } = rmin { ( ( x ÷ y ) ÷ z ) + β ˜ , ( z ) + β ˜ } = rmin { ( ( x ÷ y ) ÷ z ) , ( z ) } + β ˜ γ ˜ β ˜ + β ˜ = γ ˜
and
ζ ( a ÷ ( b a ) ) + k = ζ k T ( a ÷ ( b a ) ) max { ζ k T ( ( a ÷ b ) ÷ c ) , ζ k T ( c ) } = max { ζ ( ( a ÷ b ) ÷ c ) + k , ζ ( c ) + k } = max { ζ ( ( a ÷ b ) ÷ c ) , ζ ( c ) } + k r k + k = r .
Hence, x ÷ ( y x ) C ( , ζ ) ( γ ˜ ) and a ÷ ( b a ) C ( , ζ ) ( r ) . Therefore, C ( , ζ ) ( γ ˜ ) and C ( , ζ ) ( r ) are commutative ideals of K.
Conversely, suppose that C ( , ζ ) ( γ ˜ ) and C ( , ζ ) ( r ) are commutative ideals of K for all γ ˜ [ [ 0 , 1 ] ] and r [ 1 , 0 ] such that γ ˜ β ˜ , γ + and r < k . If there exists ( x , a ) K × K such that β ˜ T ( 0 ) β ˜ T ( x ) or ζ k T ( 0 ) ζ k T ( a ) are not true, then β ˜ T ( 0 ) δ ˜ β ˜ T ( x ) or ζ k T ( 0 ) > s ζ k T ( a ) for some δ ˜ [ [ 0 , 1 ] ] and s [ 1 , 0 ] such that δ ˜ β ˜ , δ + and s < k . Then, 0 C ( , ζ ) ( γ ˜ ) or 0 C ( , ζ ) ( r ) , which is a contradiction and so β ˜ T ( 0 ) β ˜ T ( x ) and ζ k T ( 0 ) ζ k T ( x ) for all x K . If there exist ( a , b , c ) , ( x , y , z ) K × K × K such that β ˜ T ( a ÷ ( b a ) ) rmin { β ˜ T ( ( a ÷ b ) ÷ c ) , β ˜ T ( c ) } or ζ k T ( x ÷ ( y x ) ) max { ζ k T ( ( x ÷ y ) ÷ z ) , ζ k T ( z ) } are not true, then β ˜ T ( a ÷ ( b a ) ) δ ˜ rmin { β ˜ T ( ( a ÷ b ) ÷ c ) , β ˜ T ( c ) } or ζ k T ( x ÷ ( y x ) ) > s max { ζ k T ( ( x ÷ y ) ÷ z ) , ζ k T ( z ) } for some δ ˜ [ [ 0 , 1 ] ] and s [ 1 , 0 ] such that δ ˜ β ˜ , δ + and s < k . It follows that
( ( a ÷ b ) ÷ c ) δ ˜ β ˜ , ( c ) δ ˜ β ˜
or
ζ ( ( x ÷ y ) ÷ z ) s k , ζ ( z ) s k ,
that is, ( a ÷ b ) ÷ c , c C ( , ζ ) ( γ ˜ ) or ( x ÷ y ) ÷ z , z C ( , ζ ) ( r ) . However, ( a ÷ ( b a ) ) δ ˜ β ˜ or ζ ( x ÷ ( y x ) ) s k , that is, a ÷ ( b a ) C ( , ζ ) ( γ ˜ ) or x ÷ ( y x ) C ( , ζ ) ( r ) . This is a contradiction, and thus β ˜ T ( a ÷ ( b a ) ) rmin { β ˜ T ( ( a ÷ b ) ÷ c ) , β ˜ T ( c ) } and ζ k T ( x ÷ ( y x ) ) max { ζ k T ( ( x ÷ y ) ÷ z ) , ζ k T ( z ) } for all a , b , c , x , y , z K . Therefore, K , C ( β ˜ T , ζ k T ) is a cCC-ideal of K. □

6. Conclusions and Future Work

In this manuscript, we provided two binary operations to assign a semigroup structure to the set of crossing cubic set structures and applied the crossing cubic set structure to commutative ideals of BCK-algebras and defined commutative crossing cubic ideal. We investigated several properties and the relationship between crossing cubic ideal and commutative crossing cubic ideal. We presented an example in which crossing cubic ideal is not commutative crossing cubic ideal, and then we explored the conditions in which crossing cubic ideal can be commutative crossing cubic ideal. We discussed characterizations of commutative crossing cubic ideal and investigated the relationship between commutative crossing cubic ideal and crossing cubic level set. We established an extension property of commutative crossing cubic ideal and studied the translation of commutative crossing cubic ideal. We found conditions for the translation of crossing cubic set structure to be commutative crossing cubic ideal and considered its characterization.
Our future work involves applications of crossing cubic set structure to substructures of various algebraic structures, for example, hoop algebra, equality algebra, EQ-algebra, BL-algebra, BE-algebra, group, (near, semi) ring, etc. Based on these studies, we will find ways and technologies to apply K to decision-making theory, computer science, medical science, etc., in the future.

Author Contributions

Create and conceptualize ideas: Y.B.J.; writing—original draft preparation, Y.B.J. and M.A.Ö.; writing—review and editing, M.A.Ö. and D.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors wish to thank the anonymous reviewers for their valuable suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Jun, Y.B.; Lee, K.J.; Song, S.Z. N-ideals of BCK/BCI-algebras. J. Chungcheong Math. Soc. 2009, 22, 417–437. [Google Scholar]
  3. Biswas, R. Rosenfeld’s fuzzy subgroups with interval-valued membership functions. Fuzzy Sets Syst. 1994, 63, 87–90. [Google Scholar] [CrossRef]
  4. Saeid, A.B. Fuzzy QS-algebras with interval-valued membership functions. Bull. Malays. Math. Sci. Soc. 2006, 29, 169–177. [Google Scholar]
  5. Khanale, P.B.; Ambilwade, R.P. A fuzzy inference system for diagnosis of hypothyroidism. J. Artif. Intell. 2011, 4, 45–54. [Google Scholar] [CrossRef] [Green Version]
  6. Liu, Z.; Qin, K.; Pei, Z. A method for fuzzy soft sets in decision-making based on an ideal solution. Symmetry 2017, 9, 246. [Google Scholar] [CrossRef] [Green Version]
  7. Meenakshi, A.R.; Kaliraja, M. An application of interval-valued fuzzy matrices in medical diagnosis. Int. J. Math. Anal. 2011, 5, 1791–1802. [Google Scholar]
  8. Vlachos, I.K.; Sergiadis, G.D. Subsethood, entropy, and cardinality for interval-valued fuzzy sets–An algebraic derivation. Fuzzy Sets Syst. 2007, 158, 1384–1396. [Google Scholar] [CrossRef]
  9. Yang, X.; Lin, T.Y.; Yang, J.; Li, Y.; Yu, D. Combination of interval-valued fuzzy set and soft set. Comput. Math. Appl. 2009, 58, 521–527. [Google Scholar] [CrossRef] [Green Version]
  10. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  11. Abbas, S.Z.; Khan, M.S.A.; Abdullah, S.; Sun, H.; Hussain, F. Cubic Pythagorean fuzzy sets and their application to multi-attribute decision making with unknown weight information. J. Intell. Fuzzy Syst. 2019, 37, 1529–1544. [Google Scholar] [CrossRef]
  12. Ayaz, T.; Al-Shomrani, M.M.; Abdullah, S.; Hussain, A. Evaluation of enterprise production based on spherical cubic hamacher aggregation operators. Mathematics 2020, 8, 1761. [Google Scholar] [CrossRef]
  13. Tehreem; Hussain, A.; Khan, M.S.A. Average operators based on spherical cubic fuzzy number and their application in multi-attribute decision making. Ann. Optim. Theory Pract. 2020, 3, 83–111. [Google Scholar]
  14. Jun, Y.B.; Hur, K.; Lee, J.G.; Kim, J. Crossing cubic structures as an extension of bipolar fuzzy sets. Annal. Fuzzy Math. Inform. 2021, 22, 1–15. [Google Scholar]
  15. Jun, Y.B.; Song, S.Z. Crossing cubic ideals of BCK/BCI-algebras. J. Algebr. Hyperstruct. Log. Algebr. 2021, 2, 17–31. [Google Scholar] [CrossRef]
  16. Meng, J.; Jun, Y.B. BCK-Algebras; Kyung Moon Sa Co.: Seoul, Korea, 1994. [Google Scholar]
  17. Huang, Y. BCI-Algebra; Science Press: Beijing, China, 2006. [Google Scholar]
  18. Meng, J. Commutative ideals in BCK-algebras. Pure Appl. Math. 1991, 9, 49–53. [Google Scholar]
Table 1. Cayley table for the binary operation “÷”.
Table 1. Cayley table for the binary operation “÷”.
 ÷0 ϱ 1 ϱ 2 ϱ 3  
 0000
  ϱ 1 ϱ 1 00 ϱ 1  
  ϱ 2 ϱ 2 ϱ 1 0 ϱ 2  
  ϱ 3 ϱ 3 ϱ 3 ϱ 3
Table 2. Tabular representation for K , C ( , ζ ) .
Table 2. Tabular representation for K , C ( , ζ ) .
 K ( x ) ζ ( x )  
 0 [ 0.39 , 0.76 ] 0.8  
  ϱ 1 [ 0.23 , 0.63 ] 0.4  
  ϱ 2 [ 0.23 , 0.63 ] 0.4  
  ϱ 3 [ 0.15 , 0.47 ] 0.6  
Table 3. Cayley table for the binary operation “÷”.
Table 3. Cayley table for the binary operation “÷”.
 ÷0 ϱ 1 ϱ 2 ϱ 3 ϱ 4  
 00000
  ϱ 1 ϱ 1 0 ϱ 1 0
  ϱ 2 ϱ 2 ϱ 2 00
  ϱ 3 ϱ 3 ϱ 3 ϱ 3 0
  ϱ 4 ϱ 4 ϱ 4 ϱ 4 ϱ 3
Table 4. Tabular representation for K , C ( , ζ ) .
Table 4. Tabular representation for K , C ( , ζ ) .
 K ( x ) ζ ( x )  
 0 [ 0.42 , 0.84 ] 0.87  
  ϱ 1 [ 0.37 , 0.74 ] 0.74  
  ϱ 2 [ 0.28 , 0.66 ] 0.58  
  ϱ 3 [ 0.17 , 0.52 ] 0.43  
  ϱ 4 [ 0.17 , 0.52 ] 0.43  
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Öztürk, M.A.; Yılmaz, D.; Jun, Y.B. Semigroup Structures and Commutative Ideals of BCK-Algebras Based on Crossing Cubic Set Structures. Axioms 2022, 11, 25. https://doi.org/10.3390/axioms11010025

AMA Style

Öztürk MA, Yılmaz D, Jun YB. Semigroup Structures and Commutative Ideals of BCK-Algebras Based on Crossing Cubic Set Structures. Axioms. 2022; 11(1):25. https://doi.org/10.3390/axioms11010025

Chicago/Turabian Style

Öztürk, Mehmet Ali, Damla Yılmaz, and Young Bae Jun. 2022. "Semigroup Structures and Commutative Ideals of BCK-Algebras Based on Crossing Cubic Set Structures" Axioms 11, no. 1: 25. https://doi.org/10.3390/axioms11010025

APA Style

Öztürk, M. A., Yılmaz, D., & Jun, Y. B. (2022). Semigroup Structures and Commutative Ideals of BCK-Algebras Based on Crossing Cubic Set Structures. Axioms, 11(1), 25. https://doi.org/10.3390/axioms11010025

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop