Core Concepts
The authors aim to provide a comprehensive survey of Nelson algebras, residuated lattices, and rough sets, focusing on recent developments in the field over the past two decades.
Abstract
This paper explores the theory of Nelson algebras as an algebraic counterpart to Nelson's constructive logic with strong negation. It delves into generalizations like N4-lattices corresponding to paraconsistent versions of Nelson's logic. The study highlights connections with other algebraic models of non-classical logics and applications to areas like duality and rough set theory. The representation theorem states that each Nelson algebra is isomorphic to a subalgebra of a rough set-based Nelson algebra induced by a quasiorder. Additionally, it discusses the completeness result with the finite model property for Nelson logic.
Stats
Over the past 50 years, Nelson algebras have been extensively studied.
Helena Rasiowa initiated the investigation of algebraic models of Nelson logic.
Sergei Odintsov characterized algebraic models of paraconsistent weakening of Nelson logic.
Each Nelson algebra is isomorphic to a subalgebra of a rough set-based Nelson algebra induced by a quasiorder.
A formula is a theorem of Nelson logic if it is valid in every finite Nelson algebra induced by a quasiorder.
Quotes
"Each Nelson algebra is isomorphic to a subalgebra of a rough set-based Nelson algebra." - Authors