We discuss logical connectives on bounded lattices of truth values which allow to model unsharpness inherent when treating information granules. We mainly focus on negation, conjunction, disjunction, and implication operators first for arbitrary bounded lattice in order to elaborate the logical framework. Finally, we deal with particular operations on discrete chains, intervals, interval-valued truthvalue lattices, as well as some particular constructed lattices.
Forschungs-