Fedor Pakhomov's Home Page.

Affilations.

Ghent University.
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow.

Research Papers.

  1. Alexander I. Bufetov, Gabriel Nivasch, and Fedor Pakhomov. Generalized fusible numbers and their ordinals. Annals of Pure and Applied Logic, 175(1A), 2024. PDF (preprint)
  2. Juan Pablo Aguilera, Fedor Pakhomov. The Π¹₂ consequences of a theory. Journal of the London Mathematical Society, 107(3), 2023, 1045-1073. PDF (preprint)
  3. Juan Pablo Aguilera, Fedor Pakhomov. The spectrum of Π¹₃-soundness. Philosophical Transactions of the Royal Society A, 381(2248), 2023.
  4. Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser. There are no minimal essentially undecidable theories. Journal of Logic and Computation, 2023. PDF (preprint)
  5. Juan Pablo Aguilera, Fedor Pakhomov, Andreas Weiermann. Modern perspectives in Proof Theory. Philosophical Transactions of the Royal Society A, 381(2248), 2023.
  6. Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà. Provable better quasi orders. Preprint, arXiv:2305.01066, 2023. PDF.
  7. Anton Freund, Fedor Pakhomov, Giovanni Soldà. The logical strength of minimal bad arrays. Preprint, arXiv:2304.00278, 2023. PDF.
  8. David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weierman. Arithmetical and Hyperarithmetical Worm Battles. Journal of Logic and Computation, 32(8), 2022. PDF (preprint)
  9. Fedor Pakhomov. How to escape Tennenbaum's theorem. Preprint, arXiv arXiv:2209.00967, 2022 PDF
  10. Fedor Pakhomov, Juvenal Murwanashyaka, and Albert Visser. There are no minimal essentially undecidable theories.Preprint, arXiv arXiv:2207.08174, 2022
  11. Fedor Pakhomov and Albert Visser. Finitely axiomatized theories lack self-comprehension. Bull. London Math. Soc., 2022 Published on-line, PDF (preprint)
  12. Lev Beklemishev and Fedor Pakhomov. Reflection algebras and conservation results for theories of iterated truth. Annals of Pure and Applied Logic, 173(5), 2022.PDF (preprint)
  13. Stanislav Speranski and Fedor Pakhomov. On the coprimeness relation from the viewpoint of modnadic second-order logic. Izv. Ran. Ser. Mat. link
  14. Juan Pablo Aguilera, Fedor Pakhomov, and Andreas Weiermann. Functorial Fast Growing Hierarchy.
    15. Preprint, arXiv:2201.04536, 2021 PDF
  15. Fedor Pakhomov and James Walsh. Reflection ranks via infinitary derivations. Preprint, arXiv:2107.03521, 2021 PDF
  16. Fedor Pakhomov and James Walsh. Reducing ω-model reflection to iterated syntactic reflection. Journal of Mathematical Logic, 2021 PDF(preprint)
  17. Fedor Pakhomov and Alexandr Zapryagaev. Multi-Dimensional Interpretations of Presburger Arithmetic in Itself. Journal of Logic and Computation, 30(8):1681-1693, 2020. PDF (preprint).
  18. Fedor Pakhomov and James Walsh. Reflection Ranks and Ordinal Analysis. The Journal of Symbolic Logic, 1-34, 2020 published on-line. PDF (preprint).
  19. Anton Freund and Fedor Pakhomov. Short Proofs for Slow Consistency. Notre Dame Journal of Formal Logic, 61(1):31-49, 2020. PDF (preprint).
    20. PDF.
  20. Fedor Pakhomov. A weak set theory that proves its own consistency. Preprint, arXiv:1907.00877, 2019. PDF.
  21. Ali Enayat and Fedor Pakhomov. Truth, Disjunction, and Induction. Archive for Mathematical Logic, 58(5-6):753-766, 2019. PDF.
  22. Fedor Pakhomov and Albert Visser. On a question of Krajewski's. Journal of Symbolic Logic, 84(1):343-358, 2019. PDF (preprint).
  23. Luka Mikec, Fedor Pakhomov, and Mladen Vuković. Complexity of the Interpretability Logic IL. Logic Journal of the IGPL, 27(1):1-7, 2019. PDF (preprint).
  24. Fedor Pakhomov and Alexander Zapryagaev. Interpretations of Presburger Arithmetic in Itself. In International Symposium on Logical Foundations of Computer Science (pp. 354-367). Springer. 2018. PDF (preprint)
  25. Fedor Pakhomov. Solovay’s Completeness Without Fixed Points. In International Workshop on Logic, Language, Information, and Computation (pp. 281-294). Springer, Berlin, Heidelberg. 2017. PDF (preprint).
  26. Fedor Pakhomov. Linear GLP-algebras and their elementary theories Izv. RAN. Ser. Mat., 80(6):173-216, 2016. PDF in Russian.
  27. P. Henk and Fedor Pakhomov. Slow and ordinary provability for Peano arithmetic. Preprint. arXiv:1602.1822, 2016. PDF.
  28. Fedor Pakhomov. Ordinal Notations in Caucal Hierarchy. Preprint, arXiv:1512.05036, 2015. PDF.
  29. Fedor Pakhomov. On elementary theories of ordinal notation systems based on reflection principles. Proceedings of the Steklov Institute of Mathematics, 289(1):194-212, 2015. PDF (preprint),PDF in Russian.
  30. Fedor Pakhomov. On the complexity of the closed fragment of Japaridze’s provability logic. Archive for Mathematical Logic, 53(7-8):949-967, 2014. PDF (preprint).
  31. Fedor Pakhomov. Undecidability of the elementary theory of the semilattice of GLP-words. Sb. Math., 203(8):1211-1229, 2012. PDF in Russian.
e-mail: pakhfn 'at' gmail.com
Last time edited: October 6th, 2023