References
- Balbes, R., & Dwinger, P. (1974). Distributive lattices. University of Missouri Press.
- Banerjee, M. (1997). Rough sets and 3-valued Łukasiewicz logic. Fundamenta Informaticae, 31(3–4), 213–220. https://doi.org/10.3233/FI-1997-313401
- Banerjee, M., & Chakraborty, M. K. (1996). Rough sets through algebraic logic. Fundamenta Informaticae, 28(3–4), 211–221. https://doi.org/10.3233/FI-1996-283401
- Banerjee, M., & Chakraborty, M. K. (2004). Algebras from rough sets. In S. K. Pal, L. Polkowski & A. Skowron (eds.), Rough-neuro computing: Techniques for computing with words (pp. 157–184). Springer-Verlag.
- Davey, B. A., & Priestley, H. A. (2002). Introduction to lattices and order. Cambridge University Press.
- Dunn, J. (1994). Star and Perp: Two treatments of negation. In J. Tomberlin (ed.), Philosophical perspectives (Vol. 7, pp. 331–357). Ridgeview Publishing Company.
- Dunn, J. (1999). A comparative study of various model-theoretic treatments of negation: A history of formal negations. In D. Gabbay H. Wansing (eds.), What is negation? (pp. 23–51). Kluwer Academic Publishers.
- Dunn, J. (2005). Negation in the context of gaggle theory. Studia Logica, 80(2–3), 235–264. https://doi.org/10.1007/s11225-005-8470-y
- Gratzer, G., & Schmidt, E. T. (1957). On a problem of M.H. Stone. Acta Mathematica Academiae Scientiarum Hungaricae, 8(3–4), 455–460. https://doi.org/10.1007/BF02020328
- Kumar, A. (2020). A study of algebras and logics of rough sets based on classical and generalized approximation spaces. In Transactions on rough sets XXII, LNCS (Vol. 12485, pp. 123–251). Springer.
- Kumar, A., & Banerjee, M. (2012). Definable and rough sets in covering-based approximation spaces. In T. Li, et al. (eds.), Rough sets and knowledge technology (pp. 488–495). Springer-Verlag.
- Kumar, A., & Banerjee, M. (2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55. https://doi.org/10.3233/FI-2015-1262
- Kumar, A., & Banerjee, M. (2017). Kleene algebras and logic: Boolean and rough set representations, 3-valued, rough set and perp semantics. Studia Logica, 105(3), 439–469. https://doi.org/10.1007/s11225-016-9696-6
- Kumar, A., & Kumari, S. (2021). Stone algebras: 3-valued logic and rough sets. Soft Computing, 25(20), 12685–12692. https://doi.org/10.1007/s00500-021-06068-7
- Lee, K. (1970). Equational classes of distributive pseudo-complemented lattices. Canadian Journal of Mathematics, 22(4), 881–891. https://doi.org/10.4153/CJM-1970-101-4
- Lin, T., & Liau, C. J.. (2005). Granular computing and rough sets. In O. Maimon L. Rokach (eds.), Data mining and knowledge discovery handbook (pp. 535–561). Springer.
- More, A., & Banerjee, M. (2023). Contrapositionally complemented Heyting algebras and intuitionistic logic with minimal negation. Logic Journal of the IGPL, 31(3), 441–474. https://doi.org/10.1093/jigpal/jzac041
- Pawlak, Z. (1982). Rough sets. International Journal of Computer and Information Sciences, 11(5), 341–356. https://doi.org/10.1007/BF01001956
- Pawlak, Z. (1991). Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishers.
- Rasiowa, H. (1974). An algebraic approach to non-classical logics. North-Holland.
- Saha, A., Sen, J., & Chakraborty, M. K. (2014). Algebraic structures in the vicinity of pre-rough algebra and their logics. Information Sciences, 282, 296–320. https://doi.org/10.1016/j.ins.2014.06.004
- Saha, A., Sen, J., & Chakraborty, M. K. (2016). Algebraic structures in the vicinity of pre-rough algebra and their logics II. Information Sciences, 333, 44–60. https://doi.org/10.1016/j.ins.2015.11.018
- Samanta, P., & Chakraborty, M. K. (2011). Generalized rough sets and implication lattices. In Transactions on rough sets XIV, LNCS (Vol. 6600, pp. 183–201). Springer.