Effectiveness and Multivalued Logics
|Title:||Effectiveness and Multivalued Logics|
|Journal:||Journal of Symbolic Logic|
One defines the notion of recursive enumerability and decidability for fuzzy subsets. This enables us to prove that the fuzzy subset of theorems of an axiomatizable fuzzy theory is recursively enumerable. In particular, the fuzzy subset of logically true formulas of the main fuzzy logics is recursively enumerable. This shows the effectivenes of the main fuzzy logics in contrast with the general opinion.