A new proof of Ajtai's completeness theorem for nonstandard finite structures. - Michal Garlík (Arch. Math. Log., 2015)

Construction of models of bounded arithmetic by restricted reduced powers. - Michal Garlík (Arch. Math. Log., 2016)

Some Subsystems of Constant-Depth Frege with Parity. - Michal Garlík; Leszek Aleksander Kolodziejczyk (ACM Trans. Comput. Log., 2018)

Resolution Lower Bounds for Refutation Statements. - Michal Garlík (Electron. Colloquium Comput. Complex., 2019)

Failure of Feasible Disjunction Property for $k$-DNF Resolution and NP-hardness of Automating It. - Michal Garlík (Electron. Colloquium Comput. Complex., 2020)

Lower bounds for regular resolution over parities. - Klim Efremenko; Michal Garlík; Dmitry Itsykson (Electron. Colloquium Comput. Complex., 2023)