2 papers
cs.LO2025
Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
Georg Schindling
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics w…
cs.LO2024
Finite Variable Counting Logics with Restricted Requantification
Simon RaÃmann, Georg Schindling, Pascal Schweitzer
Counting logics with a bounded number of variables form one of the central concepts in descriptive complexity theory. Although they restrict the number of variables that a formula…