On the complexity of the closed fragment of Japaridze's provability logic. - Fedor Pakhomov (Arch. Math. Log., 2014)

Solovay's Completeness Without Fixed Points. - Fedor Pakhomov (WoLLIC, 2017)

Interpretations of Presburger Arithmetic in Itself. - Alexander Zapryagaev; Fedor Pakhomov (LFCS, 2018)

Truth, disjunction, and induction. - Ali Enayat; Fedor Pakhomov (Arch. Math. Log., 2019)

Complexity of the interpretability logic IL. - Luka Mikec; Fedor Pakhomov; Mladen Vukovic (Log. J. IGPL, 2019)

On a Question of Krajewski's. - Fedor Pakhomov; Albert Visser (J. Symb. Log., 2019)

Multi-dimensional Interpretations of Presburger Arithmetic in Itself. - Fedor Pakhomov; Alexander Zapryagaev (J. Log. Comput., 2020)

Short Proofs for Slow Consistency. - Anton Freund; Fedor Pakhomov (Notre Dame J. Formal Log., 2020)

Reflection ranks and Ordinal Analysis. - Fedor Pakhomov; James Walsh 007 (J. Symb. Log., 2021)

Reflection algebras and conservation results for theories of iterated truth. - Lev D. Beklemishev; Fedor Pakhomov (Ann. Pure Appl. Log., 2022)

Arithmetical and Hyperarithmetical Worm Battles. - David Fernández-Duque; Joost J. Joosten; Fedor Pakhomov; Konstantinos Papafilippou; Andreas Weiermann (J. Log. Comput., 2022)

Reducing ω-model reflection to iterated syntactic reflection. - Fedor Pakhomov; James Walsh 007 (J. Math. Log., 2023)

Corrigendum to Reducing ω-model reflection to iterated syntactic reflection. - Fedor Pakhomov; James Walsh 007 (J. Math. Log., 2023)

There are no minimal essentially undecidable theories. - Juvenal Murwanashyaka; Fedor Pakhomov; Albert Visser (J. Log. Comput., 2024)

Generalized fusible numbers and their ordinals. - Alexander I. Bufetov; Gabriel Nivasch; Fedor Pakhomov (Ann. Pure Appl. Log., 2024)