Subdirect product construction of concept lattices
Discrete Mathematics
Information flow: the logic of distributed systems
Information flow: the logic of distributed systems
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
The tensor product as a lattice of regular galois connections
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Functorial Properties of Formal Concept Analysis
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
P-products for selection of ship designers
E-ACTIVITIES'09/ISP'09 Proceedings of the 8th WSEAS International Conference on E-Activities and information security and privacy
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
Lattices of rough set abstractions as P-products
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Order ideals of a quasi-ordered set and graywater
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
Galois connections in axiomatic aggregation
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Approximations in concept lattices
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
The Category of L-Chu Correspondences and the Structure of L-Bonds
Fundamenta Informaticae - Concept Lattices and Their Applications
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
Galois connections can be defined for lattices and for ordered sets. We discuss a rather wide generalisation, which was introduced by Weiqun Xia and has been reinvented under different names: Relational Galois connections between relations. It turns out that the generalised notion is of importance for the original one and can be utilised, e.g., for computing Galois connections. The present paper may be understood as an attempt to bring together ideas of Wille [15], Xia [16], Domenach and Leclerc [3], and others and to suggest a unifying language.