Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Concept Analysis

ICFCA 2019: Formal Concept Analysis pp 290–303Cite as

A Relational Extension of Galois Connections

  • Conference paper
  • First Online:

  • 481 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11511))

Abstract

In this paper, we focus on a twofold relational generalization of the notion of Galois connection. It is twofold because it is defined between sets endowed with arbitrary transitive relations and, moreover, both components of the connection are relations as well. Specifically, we introduce the notion of relational Galois connection between two transitive digraphs, study some of its properties and its relationship with other existing approaches in the literature.

Partially supported by the Spanish research projects TIN15-70266-C2-P-1, PGC2018-095869-B-I00 and TIN2017-89023-P of the Science and Innovation Ministry of Spain and the European Social Fund.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   74.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Notes

  1. 1.

    Notice that, as usual, we use the same symbol to denote both binary relations which need not be equal.

  2. 2.

    A digraph is often called a relational system.

References

  1. Abramsky, S.: Big toy models: representing physical systems as Chu spaces. Synthese 186(3), 697–718 (2012)

    Article  MathSciNet  Google Scholar 

  2. Antoni, L., Krajči, S., Krídlo, O.: Representation of fuzzy subsets by Galois connections. Fuzzy Sets Syst. 326, 52–68 (2017)

    Article  MathSciNet  Google Scholar 

  3. Cabrera, I.P., Cordero, P., García-Pardo, F., Ojeda-Aciego, M., De Baets, B.: On the construction of adjunctions between a fuzzy preposet and an unstructured set. Fuzzy Sets Syst. 320, 81–92 (2017)

    Article  MathSciNet  Google Scholar 

  4. Cabrera, I.P., Cordero, P., García-Pardo, F., Ojeda-Aciego, M., De Baets, B.: Adjunctions between a fuzzy preposet and an unstructured set with underlying fuzzy equivalence relations. IEEE Trans. Fuzzy Syst. 26(3), 1274–1287 (2018)

    Article  Google Scholar 

  5. Cabrera, I.P., Cordero, P., Ojeda-Aciego, M.: Relation-based Galois connections: towards the residual of a relation. In: Proceedings of Computational and Mathematical Methods in Science and Engineering (CMMSE 2017) (2017)

    Google Scholar 

  6. Denniston, J.T., Melton, A., Rodabaugh, S.E.: Formal contexts, formal concept analysis, and Galois connections. Electr. Proc. Theor. Comput. Sci. 129, 105–120 (2013)

    Article  MathSciNet  Google Scholar 

  7. Domenach, F., Leclerc, B.: Biclosed binary relations and Galois connections. Order 18(1), 89–104 (2001)

    Article  MathSciNet  Google Scholar 

  8. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-59830-2

    Book  MATH  Google Scholar 

  9. Ganter, B.: Relational Galois connections. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 1–17. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70901-5_1

    Chapter  Google Scholar 

  10. García-Pardo, F., Cabrera, I.P., Cordero, P., Ojeda-Aciego, M.: On Galois connections and soft computing. In: Rojas, I., Joya, G., Cabestany, J. (eds.) IWANN 2013. LNCS, vol. 7903, pp. 224–235. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38682-4_26

    Chapter  Google Scholar 

  11. García-Pardo, F., Cabrera, I.P., Cordero, P., Ojeda-Aciego, M.: On closure systems and adjunctions between fuzzy preordered sets. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS (LNAI), vol. 9113, pp. 114–127. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19545-2_7

    Chapter  Google Scholar 

  12. García-Pardo, F., Cabrera, I.P., Cordero, P., Ojeda-Aciego, M., Rodríguez-Sanchez, F.J.: On the existence of isotone Galois connections between preorders. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) ICFCA 2014. LNCS (LNAI), vol. 8478, pp. 67–79. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07248-7_6

    Chapter  Google Scholar 

  13. García, F., Cabrera, I.P., Cordero, P., Ojeda-Aciego, M., Rodriguez, F.: On the definition of suitable orderings to generate adjunctions over an unstructured codomain. Inf. Sci. 286, 173–187 (2014)

    Article  MathSciNet  Google Scholar 

  14. Jeřábek, E.: Galois connection for multiple-output operations. Algebra Univers. 79, 17 (2018)

    Article  MathSciNet  Google Scholar 

  15. Krídlo, O., Ojeda-Aciego, M.: Formal concept analysis and structures underlying quantum logics. In: Medina, J., et al. (eds.) IPMU 2018. CCIS, vol. 853, pp. 574–584. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91473-2_49

    Chapter  Google Scholar 

  16. Krídlo, O., Ojeda-Aciego, M.: Relating Hilbert-Chu correspondences and big toy models for quantum mechanics. In: Kóczy, L., Medina-Moreno, J., Ramírez-Poussa, E., Šostak, A. (eds.) Computational Intelligence and Mathematics for Tackling Complex Problems. SCI, vol. 819, pp. 75–80. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16024-1_10

    Chapter  Google Scholar 

  17. Ore, O.: Galois connexions. Trans. Am. Math. Soc. 55(3), 493–513 (1944)

    Article  MathSciNet  Google Scholar 

  18. Wille, R.: Subdirect product constructions of concept lattices. Discrete Math. 63, 305–313 (1987)

    Article  MathSciNet  Google Scholar 

  19. Xia, W.: Morphismen als formale Begriffe-Darstellung und Erzeugung. Verlag Shaker, Aachen (1993)

    MATH  Google Scholar 

  20. Zhang, G.-Q.: Logic of Domains. Springer, Boston (1991). https://doi.org/10.1007/978-1-4612-0445-9

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Matemática Aplicada, Universidad de Málaga, Málaga, Spain

    Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco & Manuel Ojeda-Aciego

Authors
  1. Inma P. Cabrera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pablo Cordero
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Emilio Muñoz-Velasco
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Manuel Ojeda-Aciego
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manuel Ojeda-Aciego .

Editor information

Editors and Affiliations

  1. Babeș-Bolyai University, Cluj-Napoca, Romania

    Diana Cristea

  2. University of Strasbourg, ENGEES, Strasbourg, France

    Florence Le Ber

  3. Frankfurt University of Applied Sciences, Frankfurt, Germany

    Baris Sertkaya

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cabrera, I.P., Cordero, P., Muñoz-Velasco, E., Ojeda-Aciego, M. (2019). A Relational Extension of Galois Connections. In: Cristea, D., Le Ber, F., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2019. Lecture Notes in Computer Science(), vol 11511. Springer, Cham. https://doi.org/10.1007/978-3-030-21462-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21462-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21461-6

  • Online ISBN: 978-3-030-21462-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation