A non-boolean lattice derived by double indiscernibility

Yukio Pegio Gunji*, Taichi Haruna

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)


The central notion of a rough set is the indiscernibility that is based on an equivalence relation. Because an equivalence relation shows strong bondage in an equivalence class, it forms a Galois connection and the difference between the upper and lower approximations is lost. Here, we introduce two different equivalence relations, one for the upper approximation and one for the lower approximation, and construct a composite approximation operator consisting of different equivalence relations. We show that a collection of fixed points with respect to the operator is a lattice and there exists a representation theorem for that construction.

Original languageEnglish
Title of host publicationTransactions on Rough Sets XII
Number of pages15
Publication statusPublished - 2010
Externally publishedYes
EventRough Set and Knowledge Technology Conference, RSKT 2008 - Chengdu, China
Duration: 2008 May 12008 May 1

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6190 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceRough Set and Knowledge Technology Conference, RSKT 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'A non-boolean lattice derived by double indiscernibility'. Together they form a unique fingerprint.

Cite this