Abstract

A semigroup is an algebraic structure that consists of a set and a binary operation that is associative, meaning that the order in which the operations are performed does not affect the outcome. For example, addition and multiplication are associative operations. The term “semigroup” was first used in its modern sense by Harold Hilton in his book on finite groups in 1908 [6]. Semigroups have since then been studied extensively in mathematics, and they have numerous applications in different fields, such as computer science, physics, and economics. Nearenness semigroup is a generalization of semigroups. Near set theory, which is a generalization of rough set theory, is based on the determination of universal sets according to the available information about the objects. Nearenness semigroups extend the concept of nearness from set theory to semigroups. ˙Inan and Öztürk applied the notion of near sets defined by J. F. Peters to the semigroups [10]. Our objective in this paper is to establish the definition of ordered semigroups on weak near approximation spaces. In addition, we investigated certain characteristics of these ordered nearness semigroups.