Fedor Pakhomov's Home Page.


Affilations.

Institute of Mathematics of the Czech Academy of Sciences, Prague.
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow.

Research Papers.

  1. Lev Beklemishev and Fedor Pakhomov. Reflection algebras and conservation results for theories of iterated truth. Preprint, arXiv:1908.10302, 2019. PDF.
  2. Fedor Pakhomov. A weak set theory that proves its own consistency. Preprint, arXiv:1907.00877, 2019. PDF.
  3. Ali Enayat and Fedor Pakhomov. Truth, Disjunction, and Induction. Archive for Mathematical Logic, 58(5-6):753-766, 2019. PDF.
  4. Fedor Pakhomov and Albert Visser. On a question of Krajewski's. Journal of Symbolic Logic, 84(1):343-358, 2019. PDF (preprint).
  5. 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).
  6. Fedor Pakhomov and James Walsh. Reflection Ranks and Ordinal Analysis. Preprint, arXiv:1805.02095, 2018. PDF.
  7. Anton Freund and Fedor Pakhomov. Short Proofs for Slow Consistency. Preprint, arXiv:1712.03251, 2017 (accepted to Notre Dame Journal of Formal Logic). PDF.
  8. 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)
  9. 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).
  10. Fedor Pakhomov. Linear GLP-algebras and their elementary theories Izv. RAN. Ser. Mat., 80(6):173-216, 2016. PDF in Russian.
  11. P. Henk and Fedor Pakhomov. Slow and ordinary provability for Peano arithmetic. Preprint. arXiv:1602.1822, 2016. PDF.
  12. Fedor Pakhomov. Ordinal Notations in Caucal Hierarchy. Preprint, arXiv:1512.05036, 2015. PDF.
  13. 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.
  14. 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).
  15. 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: August the 28th, 2019