|
|
|
|
|
 2024 |
| 1. |
Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov, “Generalized fusible numbers and their ordinals”, Ann. Pure Appl. Logic, 175 (2024), 103355 , 25 pp.   ; |
| 2. |
Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser, “There are no minimal essentially undecidable theories”, J. Logic Comput., 34:6 (2024), 1159–1171 ; |
|
| 2023 |
| 3. |
J. P. Aguilera, F. Pakhomov, “The $\Pi^1_2$ consequences of a theory”, J. London Math. Soc., 107:3 (2023), 1045–1073 , arXiv: 2109.11652  ; |
| 4. |
Fedor Pakhomov, James Walsh, “Reducing $\omega$-model reflection to iterated syntactic reflection”, J. Math. Log., 23:2 (2023), 2250001 , 38 pp.  ; |
| 5. |
Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà, Provable better quasi orders, 2023 , 3 pp., arXiv: 2305.01066 |
| 6. |
Anton Freund, Fedor Pakhomov, Giovanni Soldà, The logical strength of minimal bad arrays, 2023 , 11 pp., arXiv: 2304.00278 |
| 7. |
J. P. Aguilera, F. Pakhomov, A. Weiermann, “Modern perspectives in Proof Theory”, Philos. Trans. R. Soc. A, 381 (2023), 20220020 , 11 pp. ; |
| 8. |
J. P. Aguilera, F. Pakhomov, “The spectrum of $\Pi^1_3$-soundness”, Philos. Trans. R. Soc. A, 381 (2023), 20220013 , 18 pp. ; |
|
| 2022 |
| 9. |
S. O. Speranski, F. N. Pakhomov, “On the coprimeness relation from the viewpoint of monadic second-order logic”, Izv. Math., 86:6 (2022), 1225–1239    |
| 10. |
Lev D. Beklemishev, Fedor N. Pakhomov, “Reflection algebras and conservation results for theories of iterated truth”, Ann. Pure Appl. Logic, 173:5 (2022), 103093 , 41 pp. ; |
| 11. |
Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc., 54:6 (2022), 2513–2531 , arXiv: 2109.02548 ; |
|
| 2021 |
| 12. |
Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 86:4 (2021), 1350–1384 , arXiv: 1805.02095 ; |
| 13. |
Fedor Pakhomov and James Walsh, Reflection ranks via infinitary derivations, 2021 , 11 pp., arXiv: 2107.03521 |
|
| 2020 |
| 14. |
A. Freund, F. Pakhomov, “Short proofs for slow consistency”, Notre Dame J. Formal Logic, 61:1 (2020), 31–49 , arXiv: 1712.03251 ; |
| 15. |
Fedor Pakhomov, Alexander Zapryagaev, “Multi-dimensional Interpretations of Presburger Arithmetic in Itself”, J. Logic Comput., 30:8 (2020), 1681–1693 , arXiv: 2004.03404 ; |
|
| 2019 |
| 16. |
Luka Mikec, Fedor Pakhomov, Mladen Vuković, “Complexity of the interpretability logic IL”, Log. J. IGPL, 27:1 (2019), 1–7 , arXiv: 1710.05599 |
| 17. |
Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log., 84:1 (2019), 343–358 , arXiv: 1712.01713 |
| 18. |
Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766 , arXiv: 1805.09890 |
| 19. |
Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019 , 48 pp., arXiv: 1908.10302 |
| 20. |
F. Pakhomov, A weak set theory that proves its own consistency, 2019 , 25 pp., arXiv: 1907.00877 |
|
| 2018 |
| 21. |
Alexander Zapryagaev, Fedor Pakhomov, “Interpretations of Presburger Arithmetic in Itself”, International Symposium on Logical Foundations of Computer Science (Deerfield Beach, FL, USA, January 8–11, 2018), Lecture Notes in Comput. Sci., 10703, Springer, 2018, 354–367 , arXiv: 1709.07341 |
|
| 2017 |
| 22. |
Fedor Pakhomov, “Solovay’s completeness without fixed points”, Logic, Language, Information, and Computation, 24th International Workshop, WoLLIC 2017 (London, UK, July 18-21, 2017), Lecture Notes in Comput. Sci., 10388, eds. Kennedy J., de Queiroz R., Springer, Berlin, 2017, 281–294 arxiv: 1703.10262 |
|
| 2016 |
| 23. |
F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199  |
|
| 2015 |
| 24. |
F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212 |
| 25. |
Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036 |
|
| 2014 |
| 26. |
Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic, 53:7 (2014), 949–967 |
| 27. |
F. Pakhomov, “Ordinal Notations and Fundamental Sequences in Caucal Hierarchy”, Logic Colloquium, Logic, Algebra and Truth Degrees. Abstract Booklet (Vienna, July 14–19), Kurt Gödel Society, 2014, 88 |
| 28. |
Fedor Pakhomov, “Complexity of Fragments of the Logic GLP”, Proof Theory, Modal Logic and Re ection Principles (Mexico City, September 29 – October 2, 2014), ITAM, 2014, 4 |
|
| 2012 |
| 29. |
F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229 |
|
