Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy

DOI10.1007/978-3-030-88708-7_1OpenAlexW3205727729MaRDI QIDQ2148810

Luca San Mauro, S. S. Ospichev, Nikolay Bazhenov, Manat Mustafa

Publication date: 24 June 2022

Full work available at URL: https://arxiv.org/abs/2107.10033

zbMATH Keywords

fuzzy setcomputability theoryErshov hierarchy\(n\)-computably enumerable set

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hierarchy of sets. III
• Turing Computability
• Algorithmic Randomness and Complexity
• FUZZY RECURSION, RET'S, AND ISOLS
• Classical Computability and Fuzzy Turing Machines
• Fuzzy Regressivity and Retraceability
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
• Fuzzy sets
• Fuzzy algorithms
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Fuzzy algorithms
• Recursive Predicates and Quantifiers
• Fuzzy logic. Mathematical tools for approximate reasoning

This page was built for publication: Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy