Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
From MaRDI portal
Recommendations
Cited in
(22)- Decidability, partial decidability and sharpness relation for L-subsets
- The word problem for Smullyan's lark combinator is decidable
- Fuzzy subsets: A constructive approach
- Inferences in probability logic
- Fuzzy refutations for probability and multivalued logics
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
- Simple permutations: Decidability and unavoidable substructures
- KBOs, ordinals, subrecursive hierarchies and all that
- FUZZY RECURSION, RET'S, AND ISOLS
- scientific article; zbMATH DE number 5485222 (Why is no real title available?)
- scientific article; zbMATH DE number 3918355 (Why is no real title available?)
- Recursively EnumerableL-Sets
- scientific article; zbMATH DE number 4087648 (Why is no real title available?)
- The decidable properties of subrecursive functions
- PARADIGM, FORMAL PROPERTIES AND LIMITS OF FUZZY LOGIC
- scientific article; zbMATH DE number 7089069 (Why is no real title available?)
- Decidability results for sets with atoms
- Effectiveness and multivalued logics
- Fundamentals of Computation Theory
- On reduction of the decision problem of recursively enumerable sets to the separability problem
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
This page was built for publication: Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794172)