Lattice representations with set partitions induced by pairings (Q2290345)

In the paper, quadruples $W= (F, U, \Omega, \Lambda)$ are considered usually refered to as (among others) information systems [\textit{Z. Pawlak}, Rough sets. Theoretical aspects of reasoning about data. Dordrecht: Kluwer Academic Publishers Group (1991; Zbl 0758.68054)] or relational data tables [\textit{D. A. Simovici} and \textit{C. Djeraba}, Mathematical tools for data mining. Set theory, partial orders, combinatorics. 2nd ed. London: Springer (2014; Zbl 1303.68006)]. In this structure, $U$, $\Omega$ and $\Lambda$ are finite non-empty sets and $F$ is a mapping (pairing) from the Cartesian product of $U$ and $\Omega$ to $\Lambda$. $W$ can be regarded as a table indexed by $U$ and $\Omega$ with entries $F(u, a)$. The study reveals some linkages among granular computing (GrC), closure systems and algebraic order theory. The authors use some algebraic granular computing techniques on these quadruples in order to provide two lattice representations with set partitions induced by pairings. The study is self-contained by providing required prerequisites on lattices, closures, families of subsets and pairings. Some illustrative material is also included.