Premium
Decidability, Recursive Enumerability and Kleene Hierarchy For L ‐Subsets
Author(s) -
Biacino Loredana,
Gerla Giangiacomo
Publication year - 1989
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19890350107
Subject(s) - decidability , hierarchy , computer science , humanities , combinatorics , discrete mathematics , mathematics , theoretical computer science , philosophy , political science , law
A constructive approach to fuzzy set theory requires an extension to fuzzy subsets of the basic notions of recursiveness theory such as the concept of decidability, recursive enumerability, computability and so on. The first steps in this direction have been made by E. T. LEE, L. A. ZADEH, E. S. SANTOS and other authors by the notions of fuzzy algorithm, fuzzy and probabilistic Turing machine, fuzzy program, fuzzy grammar and so on (see [7], [ll], [12], [13] and [IS]). A different approach is proposed in [l], [2] and [6] by the notions of decidability and recursive enumerability.