Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets

DOI10.1002/malq.19890350107zbMath0649.03031OpenAlexW1998073351MaRDI QIDQ3794172

Loredana Biacino, Giangiacomo Gerla

Publication date: 1989

Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19890350107

zbMATH Keywords

fuzzy grammarsfuzzy machinesdecidabilityfuzzy computabilityrecursive enumerabilityKleene hierarchyconstructive approach to fuzzy set theory

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Theory of fuzzy sets, etc. (03E72) Decidability of theories and sets of sentences (03B25) Many-valued logic (03B50) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

Inferences in probability logic ⋮ Fuzzy refutations for probability and multivalued logics ⋮ Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy ⋮ PARADIGM, FORMAL PROPERTIES AND LIMITS OF FUZZY LOGIC ⋮ Fuzzy subsets: A constructive approach ⋮ Effectiveness and multivalued logics

This page was built for publication: Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets