Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability
From MaRDI portal
Publication:5164857
DOI10.3233/FI-2021-2023OpenAlexW3153583557MaRDI QIDQ5164857
Minghui Ma, Mihir Kumar Chakraborty, Zhe Lin
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2023
Related Items
Cites Work
- Covering-based rough sets and modal logics. I.
- Categories of rough sets and textures
- Algebraic structures in the vicinity of pre-rough algebra and their logics
- Covering based rough set approximations
- Residuated lattices. An algebraic glimpse at substructural logics
- The word problem for \(Heyting^ *\) algebras
- The word and generator problems for lattices
- An algebraic approach to non-classical logics
- Constructive and algebraic methods of the theory of rough sets
- Covering-based rough sets and modal logics. II.
- Algebraic structures in the vicinity of pre-rough algebra and their logics. II
- Relational interpretations of neighborhood operators and rough set approximation operators
- Generalized rough sets based on relations
- The word problem for free distributive lattices
- Interpolation and FEP for logics of residuated algebras
- On the algorithmic insolvability of the word problem in group theory
- Monads Can Be Rough
- Some Decision Problems in the Theory of Syntactic Categories
- Rough sets
- Recursive Unsolvability of a problem of Thue
- UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
- The Word Problem for Abstract Algebras
- The decision problem for some classes of sentences without quantifiers
- Bounded lattice expansions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
