相关论文: Representation of Nelson Algebras by Rough Sets De…
Rough sets induced by quasiorders appear in several constructions using binary relations in computer science. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras…
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…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
In recent years, many papers have been published showing relationships between rough sets and some lattice theoretical structures. We present here some strong relations between rough sets and three-valued {\L}ukasiewicz algebras.
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
For several types of information relations, the induced rough sets system RS does not form a lattice but only a partially ordered set. However, by studying its Dedekind-MacNeille completion DM(RS), one may reveal new important properties of…
We answer the question what properties a collection $\mathcal{F}$ of three-valued functions on a set $U$ must fulfill so that there exists a quasiorder $\leq$ on $U$ such that the rough sets determined by $\leq$ coincide with the…
We show that for any tolerance $R$ on $U$, the ordered sets of lower and upper rough approximations determined by $R$ form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only…
In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…
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…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
Finite rational $\cw$ algebras are very natural structures appearing in coset constructions when a Kac-Moody subalgebra is factored out. In this letter we address the problem of relating these algebras to integrable hierarchies of…
We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irredundant covering.
Moisil in 1941, while constructing the algebraic models of n-valued {\L}ukasiewicz logic defined the set $B^{[n]}$,where $B$ is a Boolean algebra and `n' being a natural number. Further it was proved by Moisil himself the representations of…
To a tree of semi-simple algebras we associate a qurve (or formally smooth algebra) S. We introduce a Zariski- and etale quiver describing the finite dimensional representations of S. In particular, we show that all quotient varieties of…
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…
We study a finite dimensional quadratic graded algebra R defined from a finite ranked poset. This algebra has been central to the study of the splitting algebra of the poset, A, as introduced by Gelfand, Retakh, Serconek and Wilson . The…
Let R be a von Neumann algebra acting on a Hilbert space H and let R_sa be the set of selfadjoint elements of R. It is well known that R_sa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define…
Let $A$ be an algebra with iso-class of simple modules $\mathcal{S}$ of cardinality $n$. A total ordering on $\mathcal{S}$ making every Weyl module Schurian and every indecomposable projective module filtered by the Weyl modules is called…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…