The Model-Theoretic Expressiveness of Propositional Proof Systems. - Erich Grädel; Benedikt Pago; Wied Pakusa (CSL, 2017)

A Finite-Model-Theoretic View on Propositional Proof Complexity. - Erich Grädel; Martin Grohe; Benedikt Pago; Wied Pakusa (Log. Methods Comput. Sci., 2019)

Choiceless Computation and Symmetry: Limitations of Definability. - Benedikt Pago (CSL, 2021)

Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. - Benedikt Pago (CSL, 2023)

Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. - Benedikt Pago (MFCS, 2023)

Limitations of Game Comonads via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CoRR, 2023)

Limitations of choiceless computation. - Benedikt Pago (2023)

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CSL, 2024)

A Logic for P: Are we Nearly There Yet? - Anuj Dawar; Benedikt Pago (ACM SIGLOG News, 2024)

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. - Moritz Lichter; Benedikt Pago (ICALP, 2025)

Symmetric Proofs in the Ideal Proof System. - Anuj Dawar; Erich Grädel; Leon Kullmann; Benedikt Pago (MFCS, 2025)

Symmetric Algebraic Circuits and Homomorphism Polynomials. - Anuj Dawar; Benedikt Pago; Tim Seppelt (CoRR, 2025)