Related papers: On $\delta\mathbb{P}$-approximation Spaces
Soft set theory is an important and emerging area within soft computing, owing to its attribute-oriented mathematical framework and its wide applicability in diverse domains, including science and social sciences. The theoretical…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
The theory introduced, presented and developed in this paper, is concerned with an enriched extension of the theory of Rough Sets pioneered by Zdzislaw Pawlak. The enrichment discussed here is in the sense of valuated categories as…
Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…
We introduce the concept of a soft aura topological space $(X, \tilde{\tau}, \mathfrak{a}_E)$, obtained by equipping a soft topological space $(X, \tilde{\tau}, E)$ with a soft scope function $\mathfrak{a}_E : X \to \tilde{\tau}$ satisfying…
The concept of Soft set theory was introduced by Molodtsov in the study [8]. Soft real numbers and properties were introduced inthe study [6] and soft normed space was defined in [11]. In this study, firstly we obtain a soft normed space by…
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…
The purpose of this paper is to continue studying the properties of $\gamma$-regular open sets introduced and explored in [6]. The concept of $\gamma$-closed spaces have also been defined and discussed.
Increasing amounts of available data have led to a heightened need for representing large-scale probabilistic knowledge bases. One approach is to use a probabilistic database, a model with strong assumptions that allow for efficiently…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
We develop two algebraic semantics for bitten rough set theory (\cite{SW}) over similarity spaces and their abstract granular versions. Connections with choice based generalized rough semantics developed in \cite{AM69} by the present author…
The application of rough set theory in incomplete information systems is a key problem in practice since missing values almost always occur in knowledge acquisition due to the error of data measuring, the limitation of data collection, or…
The notion of soft sets is introduced as a general mathematical tool for dealing with uncertainty. In this paper, we consider the concepts of soft compactness, countably soft compactness and obtain some results. We study some soft…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
We consider tolerances $T$ compatible with an equivalence $E$ on $U$, meaning that the relational product $E \circ T$ is included in $T$. We present the essential properties of $E$-compatible tolerances and study rough approximations…
The concept of I-statistical convergence of a double sequence was first introduced and study by Das et. el [2]. Here in this paper we discuss some results on rough ideal statistical convergence and also we introduce the notion of rough…