Skip to main content
Springer Nature Link
Log in

Decidability and recursive enumerability for fuzzy subsets

  • Fuzzy Sets And Possibility Theory
  • Conference paper
  • First Online:
Uncertainty and Intelligent Systems (IPMU 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 313))

  • 140 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biacino L. and Gerla G., Recursively Enumerable L-Sets, Zeit. f. math. Logik und Grundl. d. Math. 33 (1987) 107–113.

    Google Scholar 

  2. Biacino L. and Gerla G., "Decidability, Recursive Enumerability and Kleene Hierarchy for L-subsets"., unpublished paper.

    Google Scholar 

  3. Gerla G., "Turing L-Machines and Recursive Computability for L-maps", Pubbl. Dip. Mat. Appl. R. Caccioppoli 5 (1986).

    Google Scholar 

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

    Google Scholar 

  5. Goguen J.A., "L-fuzzy sets", J.Math.Anal.Appl., 18 (1967) 145–171.

    Google Scholar 

  6. Harkleroad L., "Fuzzy Recursion, RET's and Isols", Zeitschr. f. math. Logik und Grundlagen d. Math. 30 (1984) 425–436.

    Google Scholar 

  7. Lee E. T., Zadeh L.A., "Note on Fuzzy Languages", Inform. Sci. 1 (1968) 145–171.

    Google Scholar 

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

    Google Scholar 

  9. Pavelka J., "On fuzzy logic I:many valued rules of inference", Zeitschr. f. math. Logik und Grundlagen d. Math. 25 (1979) 119–134.

    Google Scholar 

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

    Google Scholar 

  11. Santos E.S., "Fuzzy Algorithms", Inform.Control, 17 (1970) 326–339.

    Google Scholar 

  12. Santos E.S., "Fuzzy and Probabilistic Programs", Inform.Sciences, 10 (1976) 331–335.

    Google Scholar 

  13. Zadeh L.A., "Fuzzy Sets", Inform.Control, 12 (1965) 338–353.

    Google Scholar 

  14. Zadeh L.A., "Fuzzy Algorithms", Inform.Control, 12 (1968) 94–102.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni R.Caccioppoli, via Mezzocannone 8, 80134, Napoli, Italy

    Loredana Biacino & Giangiacomo Gerla

Authors
  1. Loredana Biacino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giangiacomo Gerla
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Bouchon L. Saitta R. R. Yager

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biacino, L., Gerla, G. (1988). Decidability and recursive enumerability for fuzzy subsets. In: Bouchon, B., Saitta, L., Yager, R.R. (eds) Uncertainty and Intelligent Systems. IPMU 1988. Lecture Notes in Computer Science, vol 313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19402-9_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-19402-9_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19402-6

  • Online ISBN: 978-3-540-39255-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics