Abstract
AbstractSoft sets were introduced as a means to study objects that are not defined in an absolute way and have found applications in numerous areas of mathematics, decision theory, and in statistical applications. Soft topological spaces were first considered in Shabir and Naz ((2011). Computers & Mathematics with Applications61 (7) 1786–1799) and soft separation axioms for soft topological spaces were studied in El-Shafei et al. ((2018). Filomat32 (13) 4755–4771), El-Shafei and Al-Shami ((2020). Computational and Applied Mathematics39 (3) 1–17), Al-shami ((2021). Mathematical Problems in Engineering2021). In this paper, we introduce the effective versions of soft separation axioms. Specifically, we focus our attention on computable u-soft and computable p-soft separation axioms and investigate various relations between them. We also compare the effective and classical versions of these soft separation axioms.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference30 articles.
1. Soft set theory—First results
2. Applications of soft sets in ideal theory of bck/bci-algebras;Jun;Information Sciences,2008
3. On computable numbers, with an application to the entscheidungsproblem;Turing;Journal of Mathematics,1936
4. Elsayed, S. M. M. (2022). Applications of effective methods in computable mathematics. PhD thesis. NTU University.
5. An application of soft sets in a decision making problem