Page "Fuzzy logic" Paragraph 42

It is an open question to give supports for a Church thesis for fuzzy mathematics the proposed notion of recursive enumerability for fuzzy subsets is the adequate one.

To this aim, an extension of the notions of fuzzy grammar and fuzzy Turing machine should be necessary ( see for example Wiedermann's paper ).

Another open question is to start from this notion to find an extension of Gödel's theorems to fuzzy logic.