Skip to main content
SpringerLink
Log in

TuringL-machines and recursive computability forL-maps

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

We propose the notion of partial recursiveness and strong partial recursiveness for fuzzy maps. We prove that a fuzzy mapf is partial recursive if and only if it is computable by a Turing fuzzy machine and thatf is strongly partial recursive and deterministic if and only if it is computable via a deterministic Turing fuzzy machine. This gives a simple and manageable tool to investigate about the properties of the fuzzy machines.

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

Access this article

Log in via an institution

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. L. Biacino andG. Gerla,Recursively enumerable L-sets,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 33 (1987), pp. 107–113.

    Article  Google Scholar 

  2. B. Clares Rodriguez,Una introduccion a la W-calculabilidad: Operaciones basicas,Sochastica 2 (1983), pp. 111–135.

    Google Scholar 

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

    Article  Google Scholar 

  4. G. Gerla,Pavelka's fuzzy logic and free L-subsemigroups,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 31 (1985), pp. 123–129.

    Article  Google Scholar 

  5. G. Gerla L-Grammars and Recursively Enumerable L-Subsets, Pubbl. Dip. Mat. ed Appl. “R. Caccioppoli” 13 (1986).

  6. G. Gerla,Decidability, partial decidability and sharpness relation for L-subsets,Studia Logica 46 (1987), pp. 227–238.

    Article  Google Scholar 

  7. J. A. Goguen,L-fuzzy sets,Journal of Mathematical Analysis and Applications 18 (1967), pp. 145–171.

    Article  Google Scholar 

  8. L. Harkleroad,Fuzzy recursion, RET's and isols,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 30 (1984), pp. 425–436.

    Article  Google Scholar 

  9. C. V. Negoita andD. A. Ralescu,Applications of Fuzzy Sets to Systems Analysis, Birkhauser Verlag, Basel (1975).

    Google Scholar 

  10. J. Pavelka,On fuzzy logic Izmany valued rules of inference,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 2 (1979), pp. 119–134.

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  15. L. A. Zadeh,Fuzzy algorithms,Information and Control 15 (1968), pp. 94–102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Mathematica ed Applicazioni, Universita Degli Studi di Napoli, Via Mezzocannone 8, 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

Research supported by the M. P. I. of Italy (60% and 40%, 1988)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gerla, G. TuringL-machines and recursive computability forL-maps. Stud Logica 48, 179–192 (1989). https://doi.org/10.1007/BF02770511

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation