Skip to main content

On Some Fuzzy Binary Relations Related to Implication Functions

  • Chapter
Fuzzy Logic

Part of the book series: Theory and Decision Library ((TDLD,volume 12))

  • 276 Accesses

Abstract

MAX and MIN operations are two extreme cases of aggregation procedures in the problem of synthesizing implication functions. In this paper, we study a particular class of so-called product implication functions and characterize completely implication functions obtained as results of MAX and MIN aggregations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aczel, J. and Alsina, C, Synthesizing judgements: a functional equation approach, Mathematical Modelling 6 (1987), 311–320.

    Article  MathSciNet  Google Scholar 

  2. Alsina, C. and Trillas, E., Synthesizing implications, to appear in Journal of Artificial Intelligence.

    Google Scholar 

  3. Fodor, J. and Roubens, M., Preference modelling and aggregation procedures with valued binary relations, (to appear).

    Google Scholar 

  4. Hardy, G.H., Littlewood, J.E., and Polya, G., Inequalities (Cambridge, The University Press, 1934)

    Google Scholar 

  5. Mirkin, B.G., Group Choice (Winston, Washington, D.C., 1979)

    MATH  Google Scholar 

  6. Ovchinnikov, S.V., Choice theory for cardinal scales, in: M.M. Gupta and E. Sanchez (eds.), Fuzzy Information and Decision Processes (North-Holland Publishing Company, 1982), 323–336.

    Google Scholar 

  7. Ovchinnikov, S.V., Representations of transitive fuzzy relations, in: H.J. Skala, S. Termini, and E. Trillas (eds.), Aspects of Vagueness (D. Reidel Publishing Company, 1984), 105–118.

    Google Scholar 

  8. Ovchinnikov, S., Means and social welfare functions in fuzzy binary relation spaces, in: J. Kacprzyk and M. Fedrizzi (eds.), Multiperson Decision Making Using Fuzzy Sets and Possibility Theory (Kluwer Academic Publishers, 1990), 143–154.

    Google Scholar 

  9. Szpilrajn, E., Sur l’extension de l’ordre partiel, Fund. Math. 16 (1930), 386–389.

    MATH  Google Scholar 

  10. Trillas, E. and Alsina, C., Some remarks on approximate entailment, International Journal of Approximate reasoning, 6(4), 525–533.

    Google Scholar 

  11. Trillas, E. and Valverde, L., On implication and indistinguishability in the setting of fuzzy logic, in: Management Decision Support Systems Using Fuzzy Sets and Possibility Theory, Verlag TUV Rheinland (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Ovchinnikov, S. (1993). On Some Fuzzy Binary Relations Related to Implication Functions. In: Lowen, R., Roubens, M. (eds) Fuzzy Logic. Theory and Decision Library, vol 12. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2014-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-2014-2_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4890-3

  • Online ISBN: 978-94-011-2014-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics