Fedor Pakhomov's Home Page.


Affilations.

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

Research Papers.

  1. Fedor Pakhomov and Albert Visser. Finitely axiomatized theories lack self-comprehension. Preprint, arXiv:2109.02548, 2021 (PDF)
  2. Fedor Pakhomov and James Walsh. Reflection ranks via infinitary derivations. Preprint, arXiv:2107.03521, 2021 (PDF)
  3. Fedor Pakhomov and James Walsh. Reducing ω-model reflection to iterated syntactic reflection. Preprint, arXiv:2103.12147, 2021 (PDF)
  4. 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).
  5. Fedor Pakhomov and James Walsh. Reflection Ranks and Ordinal Analysis. The Journal of Symbolic Logic, 1-34, 2020 (published on-line). PDF (preprint).
  6. Anton Freund and Fedor Pakhomov. Short Proofs for Slow Consistency. Notre Dame Journal of Formal Logic, 61(1):31-49, 2020. PDF (preprint).
  7. Lev Beklemishev and Fedor Pakhomov. Reflection algebras and conservation results for theories of iterated truth. Preprint, arXiv:1908.10302, 2019. PDF.
  8. Fedor Pakhomov. A weak set theory that proves its own consistency. Preprint, arXiv:1907.00877, 2019. PDF.
  9. Ali Enayat and Fedor Pakhomov. Truth, Disjunction, and Induction. Archive for Mathematical Logic, 58(5-6):753-766, 2019. PDF.
  10. Fedor Pakhomov and Albert Visser. On a question of Krajewski's. Journal of Symbolic Logic, 84(1):343-358, 2019. PDF (preprint).
  11. 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).
  12. 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)
  13. 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).
  14. Fedor Pakhomov. Linear GLP-algebras and their elementary theories Izv. RAN. Ser. Mat., 80(6):173-216, 2016. PDF in Russian.
  15. P. Henk and Fedor Pakhomov. Slow and ordinary provability for Peano arithmetic. Preprint. arXiv:1602.1822, 2016. PDF.
  16. Fedor Pakhomov. Ordinal Notations in Caucal Hierarchy. Preprint, arXiv:1512.05036, 2015. PDF.
  17. 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.
  18. 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).
  19. 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: September 8th, 2021