Fedor Pakhomov's Home Page.

Welcome to my homepage!


Steklov Mathematical Institute, Moscow.

Research Papers.

  1. Ali Enayat, Fedor Pakhomov. Truth, Disjunction, and Induction. Preprint, arXiv:1805.09890, 2018. PDF.
  2. Fedor Pakhomov, James Walsh. Reflection Ranks and Ordinal Analysis. Preprint, arXiv:1805.02095, 2018. PDF.
  3. Anton Freund, Fedor Pakhomov. Short Proofs for Slow Consistency. Preprint, arXiv:1712.03251, 2017. PDF.
  4. Fedor Pakhomov, Albert Visser. On a question of Krajewski's. Preprint, arXiv:1712.01713, 2017. PDF.
  5. Luka Mikec, Fedor Pakhomov, Mladen Vuković. Complexity of the Interpretability Logic IL. To appear in Logic Journal of the IGPL. PDF (preprint)
  6. Alexander Zapryagaev, Fedor Pakhomov. Interpretations of Presburger Arithmetic in Itself. In International Symposium on Logical Foundations of Computer Science (pp. 354-367). Springer. 2018. PDF (preprint)
  7. 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).
  8. Fedor Pakhomov. Linear GLP-algebras and their elementary theories Izv. RAN. Ser. Mat., 80(6):173-216, 2016.
  9. P. Henk and Fedor Pakhomov. Slow and ordinary provability for Peano arithmetic. Preprint. arXiv:1602.1822, 2016. PDF.
  10. Fedor Pakhomov. Ordinal Notations in Caucal Hierarchy. Preprint, arXiv:1512.05036, 2015. PDF.
  11. 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,PDF in Russian.
  12. 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).
  13. Fedor Pakhomov. Undecidability of the elementary theory of the semilattice of GLP-words. Sb. Math., 203(8):1211-1229, 2012.

e-mail: pakhfn 'at' gmail.com
Last time edited: August the 2nd, 2018