Home page
Home page
Home page
Russian page
English page
Math-Net.Ru | MMS | Web of Science | Scopus | MathSciNet | zbMATH | Web-mail 

   
 About the Institute
 Staff publications
 Administration
 Academic Council
 Dissertation Councils
 Departments
Staff 
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 Charter
 Library


    Address
8 Gubkina St. Moscow,
119991, Russia
Tel.: +7(495) 984 81 41
Fax: +7(495) 984 81 39
Web site: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

View Map
Directions

   
Pakhomov Fedor Nikolaevich
(recent publications)
| by years | scientific publications | by types |



   2019
1. Luka Mikec, Fedor Pakhomov, Mladen Vuković, “Complexity of the interpretability logic IL”, Log. J. IGPL, 27:1 (2019), 1–7 , arXiv: 1710.05599  mathnet  crossref  isi
2. Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log., 84:1 (2019), 343–358 , arXiv: 1712.01713  mathnet  crossref  isi  scopus
3. Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766 , arXiv: 1805.09890  mathnet  crossref  isi  scopus

   2018
4. 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  mathnet  crossref  scopus
5. Fedor Pakhomov, James Walsh, Reflection Ranks and Ordinal Analysis, 2018 , 32 pp., submitted to the journal “Review of Symbolic Logic”, arXiv: 1805.02095

   2017
6. 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  mathnet  crossref  isi  scopus
7. Anton Freund, Fedor Pakhomov, Short Proofs for Slow Consistency., 2017 , 18 pp., accepted to “Notre Dame Journal of Formal Logic”, arXiv: 1712.03251

   2016
8. F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199  mathnet  crossref  crossref  mathscinet  adsnasa  isi  elib  scopus

   2015
9. F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212  mathnet  crossref  crossref  isi (cited: 4)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 5)
10. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036

   2014
11. Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic, 53:7 (2014), 949–967  mathnet  crossref  mathscinet  zmath  isi (cited: 4)  scopus (cited: 1)
12. 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
13. 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
14. F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 2)  elib (cited: 2)  scopus (cited: 2)


Full list of publications
Home page

© Steklov Mathematical Institute of RAS, 2004–2019