Related papers: Rough sets and three-valued structures
We give some inclusion relations for arbitrary fuzzy sets with reference to famous inequalities. In particular, we can know that the bounded sum and the algebraic product go well together. We would like to propose the concept of `Fuzzy Set…
We consider three types of set-systems that have interesting applications in algebraic combinatorics and representation theory: maximal collections of the so-called strongly separated, weakly separated, and chord separated subsets of a set…
In this thesis, the connection between recently introduced algebraic structures (tridiagonal algebra, $q$-Onsager algebra, generalized $q-$Onsager algebras), related representation theory (tridiagonal pair, Leonard pair, orthogonal…
In this paper we discuss the structure of weighted weak Lebesgue spaces and weighted weak Orlicz spaces on $\mathbb{R}^n$. First, we present sufficient and necessary conditions for inclusion relation between weighted weak Lebesgue spaces.…
We consider three examples of families of curves over a non-archimedean valued field which admit a non-trivial group action. These equivariant deformation spaces can be described by algebraic parameters (in the equation of the curve), or by…
We develop an algebraic structure modeling local operators in a three-dimensional quantum field theory which is partially holomorphic and partially topological. The geometric space organizing our algebraic structure is called the raviolo…
We provide a rough sets semantics for the three-valued extension of first-order Priest's da Costa logic, which we studied in [Castiglioni, J.L. and Ertola-Biraben, R.C. Modalities combining two negations. {\em Journal of Logic and…
In relational approach to general rough sets, ideas of directed relations are supplemented with additional conditions for multiple algebraic approaches in this research paper. The relations are also specialized to representations of general…
In this paper, the definition of fuzzy rough relation on a set will be introduced and then it would be proved that the collection of such relations is closed under different binary compositions such as, algebraic sum, algebraic product etc.…
The problem of comparing concepts of dependence in general rough sets with those in probability theory had been initiated by the present author in some of her recent papers. This problem relates to the identification of the limitations of…
In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of…
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…
This survey presents a necessarily incomplete (and biased) overview of results at the intersection of arithmetic circuit complexity, structured matrices and deep learning. Recently there has been some research activity in replacing…
In this paper, we give a classification of the 3-dimensional associative algebras over the complex numbers, including a construction of the moduli space, using versal deformations to determine how the space is glued together.
We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion forms a spatial and completely distributive lattice. We derive…
In Pawlak's rough set theory, a set is approximated by a pair of lower and upper approximations. To measure numerically the roughness of an approximation, Pawlak introduced a quantitative measure of roughness by using the ratio of the…
We introduce the concept of a quasiresiduated lattice and prove that every lattice effect algebra can be organized into a commutative quasiresiduated lattice with divisibility. Also conversely, every such a lattice can be converted into a…
In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…
We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…
Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…