Search arXiv⌕ 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

Explore connections, maps & timelines

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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗