Lovász-Type Theorems and Game Comonads

Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after, Pultr (1973) proved a categorical generalisation of this fact. We...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Dawar, Anuj, Jakl, Tomas, Reggio, Luca
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computational modeling Computer science Forestry Games Semantics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!