Fuzzy subsets: A constructive approach

DOI10.1016/0165-0114(92)90115-KzbMath0763.03016MaRDI QIDQ1192476

Loredana Biacino, Giangiacomo Gerla

Publication date: 27 September 1992

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

zbMATH Keywords

fuzzy grammarsdecidabilityfuzzy Turing machinesrecursive enumerabilitycomputability of fuzzy maps

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Theory of fuzzy sets, etc. (03E72) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items (6)

On the computing power of fuzzy Turing machines ⋮ Fuzzy refutations for probability and multivalued logics ⋮ Fuzzy logics as families of bivaluated logics ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ On a class of fuzzy computable functions ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Cites Work

• Unnamed Item
• Unnamed Item
• Decidability, partial decidability and sharpness relation for L-subsets
• Fuzzy grammars and recursively enumerable fuzzy languages
• Fuzzy and probabilistic programs
• Turing L-machines and recursive computability for L-maps
• L-fuzzy sets
• FUZZY RECURSION, RET'S, AND ISOLS
• Recursively EnumerableL-Sets
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
• On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
• Sharpness relation and decidable fuzzy sets
• Fuzzy sets
• Fuzzy algorithms
• Fuzzy algorithms

This page was built for publication: Fuzzy subsets: A constructive approach