Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets
- 1 January 1989
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 35 (1) , 49-62
- https://doi.org/10.1002/malq.19890350107
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Sharpness relation and decidable fuzzy setsIEEE Transactions on Automatic Control, 1982
- Applications of Fuzzy Sets to Systems AnalysisPublished by Springer Nature ,1975
- Computability by Probabilistic Turing MachinesTransactions of the American Mathematical Society, 1971
- Computability by probabilistic Turing machinesTransactions of the American Mathematical Society, 1971
- Fuzzy algorithmsInformation and Control, 1970
- Note on fuzzy languagesInformation Sciences, 1969
- Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functionsThe Journal of Symbolic Logic, 1969
- Fuzzy algorithmsInformation and Control, 1968
- L-fuzzy setsJournal of Mathematical Analysis and Applications, 1967
- Fuzzy setsInformation and Control, 1965