-convex sets and -convex functions, which are considered as an important class of generalized convex sets and convex functions, have been introduced and studied by Youness [5] and other researchers. This class has recently extended, by Youness, to strongly -convex sets and strongly -convex functions. In these generalized classes, the definitions of the classical convex sets and convex functions are relaxed and introduced with respect to a mapping . In this paper, new properties of strongly -convex sets are presented. We define strongly -convex hull, strongly -convex cone, and strongly -convex cone hull and we proof some of their properties.  Some examples to illustrate the aforementioned concepts and to cl

    In this paper, the concept of soft closed groups is presented using the soft ideal pre-generalized open and soft pre-open, which are -ᶅ- - -closed sets " -closed", Which illustrating several characteristics of these groups.  We also use some games and   -  Separation Axiom, such as (Æ®_0, Ó¼, ᶅ) that use many tables and charts to illustrate this. Also, we put some proposals to study the relationship between these games and give some examples.

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

    The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

In this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.

       Let R be a commutative ring with unity .M an R-Module. M is called coprime module     (dual notion of prime module) if ann M =ann M/N for every proper submodule N of M   In this paper we study coprime modules we give many basic properties of this concept. Also we give many characterization of it under certain of module.

Contents IJPAM: Volume 116, No. 3 (2017)