Relational Galois Connections
B. Ganter.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

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.

URL

http://dx.doi.org/10.1007/978-3-540-70901-5_1

search on

This publication has not been reviewed yet.

rating distribution

average user rating0.0 out of 5.0 based on 0 reviews

Please log in to take part in the discussion (add own reviews or comments).

@incollection{ganter2007relational,
  abstract = {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.},
  added-at = {2015-04-16T17:07:37.000+0200},
  author = {Ganter, Bernhard},
  biburl = {https://puma.uni-kassel.de/bibtex/25d4d028f5cc93398e2acb5d3cb939bfc/stephandoerfel},
  booktitle = {Formal Concept Analysis},
  description = {Relational Galois Connections - Springer},
  doi = {10.1007/978-3-540-70901-5_1},
  editor = {Kuznetsov, Sergei O. and Schmidt, Stefan},
  interhash = {03a1b0464331a319f3ef868bc280aa67},
  intrahash = {5d4d028f5cc93398e2acb5d3cb939bfc},
  isbn = {978-3-540-70828-5},
  keywords = {2007 icfca},
  language = {English},
  pages = {1-17},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  timestamp = {2015-04-16T17:07:37.000+0200},
  title = {Relational Galois Connections},
  url = {http://dx.doi.org/10.1007/978-3-540-70901-5_1},
  volume = 4390,
  year = 2007
}

%0 Book Section
%1 ganter2007relational
%A Ganter, Bernhard
%B Formal Concept Analysis
%D 2007
%E Kuznetsov, Sergei O.
%E Schmidt, Stefan
%I Springer Berlin Heidelberg
%K 2007 icfca
%P 1-17
%R 10.1007/978-3-540-70901-5_1
%T Relational Galois Connections
%U http://dx.doi.org/10.1007/978-3-540-70901-5_1
%V 4390
%X 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.
%@ 978-3-540-70828-5

PUMA

Relational Galois Connections
B. Ganter.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

Tags

Users

Comments and Reviews

Cite this publication

PUMA

Relational Galois ConnectionsB. Ganter. Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

Tags

Users

Comments and Reviews

Cite this publication

Relational Galois Connections
B. Ganter.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)