Turing L-machines and recursive computability for L-maps
From MaRDI portal
Publication:1263577
DOI10.1007/BF02770511zbMath0688.03025MaRDI QIDQ1263577
Publication date: 1989
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02770511
03D20: Recursive functions and relations, subrecursive hierarchies
03D10: Turing machines and related notions
Related Items
On a class of fuzzy computable functions, Fuzzy grammars and recursively enumerable fuzzy languages, Fuzzy subsets: A constructive approach, A family of fuzzy programming languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability, partial decidability and sharpness relation for L-subsets
- Fuzzy and probabilistic programs
- L-fuzzy sets
- FUZZY RECURSION, RET'S, AND ISOLS
- Pavelka's Fuzzy Logic and Free L‐Subsemigroups
- Recursively EnumerableL-Sets
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- Sharpness relation and decidable fuzzy sets
- Fuzzy sets
- Fuzzy algorithms
- Fuzzy algorithms