Skip to main content
Springer Nature Link
Log in

Decidability, partial decidability and sharpness relation for L-subsets

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

If X is set and L a lattice, then an L-subset or fuzzy subset of X is any map from X to L, [11]. In this paper we extend some notions of recursivity theory to fuzzy set theory, in particular we define and examine the concept of almost decidability for L-subsets. Moreover, we examine the relationship between imprecision and decidability. Namely, we prove that there exist infinitely indeterminate L-subsets with no “more precise” decidable versions and classical subsets whose unique shaded decidable versions are the L-subsets almost-everywhere indeterminate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. De Luca and S. Termini, A definition of nonprobabilistic entropy in the setting of fuzzy set theory, Information and Control 20 (1972), pp. 301–312.

    Google Scholar 

  2. L. Biacino and G. Gerla, Recursively enumerable L-sets, to appear in Zeitschrift fur mathematische Logik und Grundlagen der Mathematik.

  3. G. Gerla, Sharpness relation and decidable fuzzy sets, IEEE Trans. Automat. Contr., AC-27 (1982), p. 1113.

    Google Scholar 

  4. G. Gerla, Turing L-machines and recursive computability for L-maps Pubbl. Dip. Mat. Appl. 5 (1986).

  5. G. Gerla, Recursively enumerable L-languages and L-grammars, Pubbl. Dip. Mat. Appl. R. Caccioppoli 13 (1986).

  6. J. A. Goguen, L-fuzzy sets, J. Math. Anal. Appl. 18 (1987), pp. 145–171.

    Google Scholar 

  7. L. Arkleroad, Fuzzy recursion, RET's and Isols, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, Bd. 30, S.(1984), pp. 425–436.

    Google Scholar 

  8. C. V. Negoita and D. A. Ralescu, Applications of Fuzzy Sets to Systems Analysis, Birkhauser Verlag, Basel, 1975.

    Google Scholar 

  9. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York 1967.

    Google Scholar 

  10. E. S. Santos, Fuzzy algorithms, Information and Control 17 (1970), pp. 326–339.

    Google Scholar 

  11. E. S. Santos, Fuzzy and probabilistic programs, Inform. Sciences 10 (1976), pp. 331–335.

    Google Scholar 

  12. L. A. Zadeh, Fuzzy sets, Information and Control 12 (1965), pp. 338–353.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni, Universita Degli Studi Di Napoli, 80134, Napoli, Italy

    Giangiacomo Gerla

Authors
  1. Giangiacomo Gerla
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by M. P. I. of Italy (60% and 40% 1986).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerla, G. Decidability, partial decidability and sharpness relation for L-subsets. Stud Logica 46, 227–238 (1987). https://doi.org/10.1007/BF00372547

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00372547

Keywords