ON THE STUDY OF CHAINS SOFT SETS, SOFT ORDERED SETS AND SOFT SEMILATTICES
Abstract
In this paper, we study the concept of chains soft sets and set-valued function of chains soft sets. The definitions of chains soft sets or linear order or total order soft set are given. The notions of binary relation of comparability of the elements of set-valued functions are also discussed. Linearization’s of a partial order soft set are also defined. The definition and some algebraic structure of soft semilattice are also given.
References
A. M. Ibrahim, M. K. Dauda and D. Singh. Composition of Soft Set Relations and Construction of Transitive Closure, Journal of Mathematical Theory and Modeling, Vol. 2, No. 7, pp. 98 – 107, 2012.
A. M. Ibrahim and A. O. Yusuf. Development of Soft Set Theory, American International Journal of Contemporary Research, Vol. 2 No. 9, 2012.
A. Kharal and B. Ahmad. Mappings on Soft Classes, Information Sciences, INS-D-08-1231 by ESS, pp. 1 – 11, 2010.
A. O. Atagun and A. Sezgin. Soft Substructures of Rings, Fields and Modules, Computers and Mathematics with Applications, Vol. 61, pp. 592 – 601, 2011.
A. Sezgin and A. O. Atagun. On operation of Soft Sets, Computers and Mathematics with Applications Vol. 61, 1457 – 1467, 2011.
D. A. Molodtsov. Soft Set Theory- First Results, Computers and Mathematics with Applications 37 (4/5), 19 – 31, 1999.
A. C. Davis, A characterization of complete lattices, pacific J. Math. 5(1955) 311-319.
A. Tarski, A lattice- theoretical fixpoint theorem and its applications, pacific J. Math., (1955) 285- 309.
Copyright (c) 2021 FUDMA JOURNAL OF SCIENCES
This work is licensed under a Creative Commons Attribution 4.0 International License.
FUDMA Journal of Sciences
