Neutrosophic N -Structures Applied to BCK/BCI-Algebras

Neutrosophic N -structures with applications in BCK/BC I-algebras is discussed. The notions of a neutrosophic N -subalgebra and a (closed) neutrosophic N -ideal in a BCK/BC I-algebra are introduced, and several related properties are investigated. Characterizations of a neutrosophic N -subalgebra and a neutrosophic N -ideal are considered, and relations between a neutrosophic N -subalgebra and a neutrosophic N -ideal are stated. Conditions for a neutrosophic N -ideal to be a closed neutrosophic N -ideal are provided

Int-Soft Ideals of Pseudo MV-Algebras

The notion of (implicative) int-soft ideal in a pseudo MV-algebra is introduced, and related properties are investigated. Conditions for a soft set to be an int-soft ideal are provided. Characterizations of (implicative) int-soft ideal are considered. The extension property for implicative int-soft ideal is established

Further results on -neutrosophic subalgebras and ideals in BCK/BCI-algebras

Characterizations of an (∈, ∈)-neutrosophic ideal are considered. Any ideal in a BCK/BCI-algebra will be realized as level neutrosophic ideals of some (∈, ∈)-neutrosophic ideal. The relation between (∈, ∈)-neutrosophic ideal and (∈, ∈)-neutrosophic subalgebra in a BCK-algebra is discussed. Conditions for an (∈, ∈)-neutrosophic subalgebra to be a (∈, ∈)-neutrosophic ideal are provided. Using a collection of ideals in a BCK/BCI-algebra, an (∈, ∈)-neutrosophic ideal is established. Equivalence relations on the family of all (∈, ∈)-neutrosophic ideals are introduced, and related properties are investigated

A General Model of Neutrosophic Ideals in BCK/BCI-algebras Based on Neutrosophic Points

More general form of (∈, ∈ ∨q)-neutrosophic ideal is introduced, and their properties are investigated. Relations between (∈, ∈)-neutrosophic ideal and (∈, ∈ ∨q(kT ,kI ,kF ))-neutrosophic ideal are discussed. Characterizations of (∈, ∈∨q(kT ,kI,kF ))-neutrosophic ideal are discussed, and conditions for a neutrosophic set to be an (∈, ∈∨q(kT ,kI ,kF ))-neutrosophic ideal are displayed

The Structure of the Block Code Generated by a BL-Algebra

Inspired by the concept of BL-algebra as an important part of the ordered algebra, in this paper we investigate the binary block code generated by an arbitrary BL-algebra and study related properties. For this goal, we initiate the study of the BL-function on a nonempty set P based on BL-algebra L, and by using that, l-functions and l-subsets are introduced for the arbitrary element l of a BL-algebra. In addition, by the mean of the l-functions and l-subsets, an equivalence relation on the BL-algebra L is introduced, and using that, the structure of the code generated by an arbitrary BL-algebra is considered. Some related properties (such as the length and the linearity) of the generated code and examples are provided. Moreover, as the main result, we define a new order on the generated code C based on the BL-algebra L, and show that the structures of the BL-algebra with its order and the correspondence generated code with the defined order are the same

Torsion Elements and Torsionable Hypermodules

This article is motivated by the recently published studies on divisible hypermodules and falls in the area of hypercompositional algebra. In particular, it focuses on the torsion elements in Krasner hypermodules. First, we define the concept of a torsion element over a hypermodule, and based on it, we introduce a new class of hypermodules, namely the torsionable hypermodule. After investigating some of their fundamental properties, we will show that the class of torsionable hypermodules is a subclass of the class of divisible hypermodules. Finally, we present the relationships between divisible, torsionable, and normal injective hypermodules

SEMI-PRIME CLOSURE OPERATIONS ON BCK-ALGEBRA

In this paper we study the (good) semi-prime closure oper- ations on ideals of a BCK-algebra, lower BCK-semilattice, Noetherian BCK-algebra and meet quotient ideal and then we give several theorems that make different (good) semi-prime closure operations. Moreover, by giving some examples, we show that the given different notions are independent together, for instance, there is a semi-prime closure operation, which is not a good semi-prime. Finally by given the notion of “cf-Max X”, we prove that every member of “cf-Max X” is a prime ideal. Also, we conclude some more related results

Codes generated by ordered algebraic structures

Error-control codes are used to detect and correct errors that occur when data are trans-mitted across some noisy channel or stored on some medium. The study of error-control codes is called coding theory and emerged in 1948 by Claud Shannon\u27s paper which demonstrated that by proper encoding of the data, errors induced by a noisy channel can be reduced to any desired level without sacrificing the rate of information transmission. Some algebraic structures, includes the study and discovery of various coding schemes, are used to increase the number of errors that can be corrected during data transmission. One of the classes of logical algebra is ordered algebras which were introduced by Imai and Iseki in 1966. In this note, I study the codes generating by the ordered algebraic structures such as BCK-algebras and BL-algebras. For this goal, symmetric rela-tions on these ordered structures facilitate us to design the correspondence codeword. Moreover, I show that the structure of ordered algebra and the code generated by it will be the same