Hostname: page-component-77f85d65b8-6c7dr Total loading time: 0 Render date: 2026-03-29T05:59:30.467Z Has data issue: false hasContentIssue false

Computable soft separation axioms

Published online by Cambridge University Press:  12 October 2023

S. M. Elsayed*
Affiliation:
Maths Department, Faculty of Science, Aswan University, Aswan, Egypt
Keng Meng Ng
Affiliation:
SPMS School, NTU University, Jurong West, Singapore
*
Corresponding author: S. M. Elsayed; Email: profsalah55@yahoo.com

Abstract

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.

Information

Type
Paper
Copyright
© The Author(s), 2023. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable