Decidability, partial decidability and sharpness relation for L-subsets

DOI10.1007/BF00372547zbMath0645.03053OpenAlexW2053762111MaRDI QIDQ1102954

Giangiacomo Gerla

Publication date: 1987

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00372547

zbMATH Keywords

decidable fuzzy setsrecursively enumerable fuzzy setssharpening of fuzzy sets

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Fuzzy grammars and recursively enumerable fuzzy languages ⋮ Fuzzy subsets: A constructive approach ⋮ Fuzzy logic programming and fuzzy control ⋮ Turing L-machines and recursive computability for L-maps ⋮ Effectiveness and multivalued logics

Cites Work

• Unnamed Item
• Unnamed Item
• Fuzzy and probabilistic programs
• L-fuzzy sets
• Recursively EnumerableL-Sets
• Sharpness relation and decidable fuzzy sets
• Fuzzy sets
• Fuzzy algorithms
• A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory