A note on Nguyen–Fullér–Keresztfalvi theorem and Zadeh's extension principle

Adam Bzowski , Michał Urbański


This paper is devoted to the analysis of the generalised form of the Nguyen–Fullér–Keresztfalvi theorem (NFK theorem). The classical NFK theorem expresses the Zadeh extension principle in terms of α -cuts of fuzzy sets, but it is subjected to some constraining assumptions. These assumptions concern all data in the problem: shape of fuzzy sets, topology of underlying spaces, and regularity of functions and t-norms. In this paper we analyse consequences of dropping these assumptions. In order to prove the generalised version of the NFK theorem, we introduce a notion of level sets as a generalisation of the collection of α -cuts. We discuss properties of the level sets and then we formulate the general NFK theorem, which does not require assumptions on the shape of fuzzy sets, t-norms, nor topology of underlying spaces. Finally, we return to the classical formulation of the NFK theorem and we show that it can be extended to the class of fuzzy sets with unbounded supports.
Author Adam Bzowski - [Institute for Theoretical Physics Amsterdam]
Adam Bzowski,,
, Michał Urbański (FP / SRD)
Michał Urbański,,
- Structural Research Division
Journal seriesFuzzy Sets and Systems, ISSN 0165-0114
Issue year2013
Publication size in sheets0.5
Keywords in Englisht-Norms, Zadeh's extension principle
ASJC Classification1702 Artificial Intelligence; 2609 Logic
URL http://www.sciencedirect.com/science/article/pii/S0165011412003922
Languageen angielski
Bzowski,Urbanski.pdf 222.85 KB
Score (nominal)40
Score sourcejournalList
ScoreMinisterial score = 40.0, 23-01-2020, ArticleFromJournal
Ministerial score (2013-2016) = 40.0, 23-01-2020, ArticleFromJournal
Publication indicators Scopus Citations = 3; WoS Citations = 3; Scopus SNIP (Source Normalised Impact per Paper): 2013 = 2.089; WoS Impact Factor: 2013 = 1.88 (2) - 2013=2.263 (5)
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?