Discrete dualities for some algebras from rough sets
By: Ivo Düntsch, Ewa Orłowska
Potential Business Impact:
Finds hidden patterns in messy information.
A discrete duality is a relationship between classes of algebras and classes of relational systems (frames) resulting in two representation theorems building on the early work of Jónsson and Tarski, Kripke, and van Benthem. In this section we recall discrete dualities for various types of algebras arising from rough sets.
Similar Papers
Duality theory and representations for distributive quasi relation algebras and DInFL-algebras
Logic in Computer Science
Makes math ideas easier to understand.
Dualities for finite abelian groups and applications to coding theory
Information Theory
Makes computer codes stronger and more reliable.
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.