Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets
Combinatorics
2019-04-18 v2 Formal Languages and Automata Theory
Logic in Computer Science
Representation Theory
Abstract
We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irredundant covering.
Cite
@article{arxiv.1610.09847,
title = {Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets},
author = {Jouni Järvinen and Sándor Radeleczki},
journal= {arXiv preprint arXiv:1610.09847},
year = {2019}
}
Comments
Title modified from the first version. Repaired one proof. Changes in terminology