Decidability, partial decidability and sharpness relation for L-subsets (Q1102954)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4051608
Language Label Description Also known as
default for all languages
No label defined
    English
    Decidability, partial decidability and sharpness relation for L-subsets
    scientific article; zbMATH DE number 4051608

      Statements

      Decidability, partial decidability and sharpness relation for L-subsets (English)
      0 references
      0 references
      1987
      0 references
      For finite subsets L of the unit interval and finite sets A, fuzzy subsets of a free monoid A * generated by A are considered. Such a fuzzy subset s: A *\(\to L\) is called decidable iff it is a recursive function and is called almost decidable iff its restriction to the set \(\{\) \(x\in A\) *\(|\) s(x)\(\neq 1/2\}\) is a recursive function. Those properties are studied together with relations between such recursiveness properties and the sharpening of fuzzy sets.
      0 references
      decidable fuzzy sets
      0 references
      recursively enumerable fuzzy sets
      0 references
      sharpening of fuzzy sets
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references