Abstract
We present a mathematical model of sets with incomplete information about identity of elements and the membership relation. The model is based on L-valued sets where L is a complete atomic Boolean algebra. We present general foundations of the theory with emphasis on partially ordered sets and complete lattices. As an application, we show a method for constructing structures that represent the concept lattice of an incomplete binary dataset.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have