Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.08157

A novel axiomatic approach to L-valued rough sets within an L-universe via inner product and outer product of L-subsets

Lingqiang Li·Qiu Jin
View original source ↗Read source document ↗Export metadata ↓

Abstract

The fuzzy rough approximation operator serves as the cornerstone of fuzzy rough set theory and its practical applications. Axiomatization is a crucial approach in the exploration of fuzzy rough sets, aiming to offer a clear and direct characterization of fuzzy rough approximation operators. Among the fundamental tools employed in this process, the inner product and outer product of fuzzy sets stand out as essential components in the axiomatization of fuzzy rough sets. In this paper, we will develop the axiomatization of a comprehensive fuzzy rough set theory, that is, the so-called L-valued rough sets with an L-set serving as the foundational universe (referred to as the L-universe) for defining L-valued rough approximation operators, where L typically denotes a GL-quantale. Firstly, we give the notions of inner product and outer product of two L-subsets within an L-universe and examine their basic properties. It is shown that these notions are extensions of the corresponding notion of fuzzy sets within a classical universe. Secondly, leveraging the inner product and outer product of L-subsets, we respectively characterize L-valued upper and lower rough approximation operators generated by general, reflexive, transitive, symmetric, Euclidean, and median L-value relations on L-universe as well as their compositions. Finally, utilizing the provided axiomatic characterizations, we present the precise examples for the least and largest equivalent L-valued upper and lower rough approximation operators. Notably, many existing axiom characterizations of fuzzy rough sets within classical universe can be viewed as direct consequences of our findings.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Lingqiang Li, Qiu Jin. 2024-08-15. A novel axiomatic approach to L-valued rough sets within an L-universe via inner product and outer product of L-subsets. https://arxiv.org/abs/2408.08157

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗