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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decidability, partial decidability and sharpness relation for L-subsets
scientific article

    Statements

    Decidability, partial decidability and sharpness relation for L-subsets (English)
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    decidable fuzzy sets
    0 references
    recursively enumerable fuzzy sets
    0 references
    sharpening of fuzzy sets
    0 references
    0 references