Abstract
A Ruspini partition is a finite family of fuzzy sets {f 1, ..., f n }, f i : [0, 1] →[0, 1], such that \(\sum^n_{i=1} f_i(x) = 1\) for all x ∈ [0, 1]. We analyze such partitions in the language of Gödel logic. Our main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition by a theory in Gödel logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only