University of Cambridge > > Logic & Semantics for Dummies > A Galois connection for operations and relations

A Galois connection for operations and relations

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Nathanael Arkor.

Galois connections are a relatively simple type of duality that are plentiful in maths and computer science. In this talk, I’ll give some background on these, their history and generalisations, before focusing on an example of particular importance to logic and theoretical computer science: the Pol-Inv connection. This simple construction relates finitary operations on a set to finitary relations on the same set in a way that allows you to turn questions about algebraic structure into questions about logical/relational structure, and vice versa. I’ll outline some nice features and recent applications of this connection, including to the (recently resolved) CSP Dichotomy Conjecture.

This talk is part of the Logic & Semantics for Dummies series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity