An analysis of Ruspini partitions in Gödel logic

Abstract: By a Ruspini partition we mean a finite family of fuzzy sets

f_{1}, l d o t s, f_{n}

,

f_{i} : [0, 1] o [0, 1]

, such that

s u m_{i = 1}^{n} f_{i} (x) = 1

for all

x i n [0, 1]

, where

[0, 1]

denotes the real unit interval. We analyze such partitions in the language of G"odel logic. Our first 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"odel logic. Our second main result extends this analysis to Ruspini partitions fulfilling the natural additional condition that each

f_{i}

has at most one left and one right neighbour, meaning that

m i n_{x i n [0, 1]} f_{i_{1}} (x), f_{i_{2}} (x), f_{i_{3}} (x) = 0

holds for

i_{1} e q i_{2} e q i_{3}

.

Review text

A finite sequence \((f_1,\dots,f_n)\) of fuzzy subsets of a set \(X\) is a Ruspini partition of \(X\) iff for each \(x\in{X}\) the sum of the membership degrees \(f_1(x),\dots,f_n(x)\) equals 1. For a certain class of generalized Ruspini partitions the authors give, using infinite-valued Gödel logic, a characterization of such generalized Ruspini partitions as models of suitable formal theories. For those generalized Ruspini partitions that are 2-overlapping, i.e., have an empty min-intersection for any three partition sets, the same type of characterization is proved to be possible in 4-valued Gödel logic.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

Uses Software

OEIS

This page was built for publication: An analysis of Ruspini partitions in Gödel logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962901)