Computable soft separation axioms

Soft 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 Applications 61 (7) 1786-1799) and soft separation axioms for soft topological spaces were studied in El-Shafei et al. ((2018). Filomat 32 (13) 4755-4771), El-Shafei and Al-Shami ((2020). Computational and Applied Mathematics 39 (3) 1-17), Al-shami ((2021). Mathematical Problems in Engineering 2021). 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.

Automated summary

Soft sets are used to study objects that are not defined in an absolute way and have applications in various areas. This paper introduces the effective versions of soft separation axioms and investigates their relationships.