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 
 Chair at MIPT
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 Charter


    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 |



   2022
1. S. O. Speranski, F. N. Pakhomov, “On the coprimeness relation from the viewpoint of monadic second-order logic”, Izv. RAN. Ser. Mat., 86:6 (2022)  mathnet  crossref
2. Lev D. Beklemishev, Fedor N. Pakhomov, “Reflection algebras and conservation results for theories of iterated truth”, Ann. Pure Appl. Logic, 173:5 (2022), 103093 , 41 pp.  mathnet  crossref;
3. Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc., 2022, 1–13 (Published online) , arXiv: 2109.02548  mathnet  crossref; (Published online)

   2021
4. Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 86:4 (2021), 1350–1384 , arXiv: 1805.02095  mathnet  crossref  isi (cited: 1)  scopus (cited: 1);
5. Fedor Pakhomov and James Walsh, Reflection ranks via infinitary derivations, 2021 , 11 pp., arXiv: 2107.03521
6. Juan Pablo Aguilera and Fedor Pakhomov, The $\Pi_2^1$ Consequences of a Theory, 2021 , 26 pp., arXiv: 2109.11652
7. Fedor Pakhomov, James Walsh, “Reducing $\omega$-model reflection to iterated syntactic reflection”, J. Math. Log., 2021, 1–38 (Published online)  mathnet  crossref  scopus; (Published online)

   2020
8. A. Freund, F. Pakhomov, “Short proofs for slow consistency”, Notre Dame J. Formal Logic, 61:1 (2020), 31–49 , arXiv: 1712.03251  mathnet  crossref  mathscinet  isi (cited: 1)  scopus (cited: 3);
9. Fedor Pakhomov, Alexander Zapryagaev, “Multi-dimensional Interpretations of Presburger Arithmetic in Itself”, J. Logic Comput., 30:8 (2020), 1681–1693 , arXiv: 2004.03404  mathnet  crossref  mathscinet  isi  scopus (cited: 1);

   2019
10. 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  mathscinet  isi  scopus (cited: 1)
11. Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log., 84:1 (2019), 343–358 , arXiv: 1712.01713  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 2)
12. Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766 , arXiv: 1805.09890  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 7)
13. Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019 , 48 pp., arXiv: 1908.10302
14. F. Pakhomov, A weak set theory that proves its own consistency, 2019 , 25 pp., arXiv: 1907.00877

   2018
15. 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  mathscinet  zmath  isi  scopus (cited: 1)

   2017
16. 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  mathscinet  isi (cited: 2)  scopus (cited: 2)

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

   2015
18. 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: 5)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 5)
19. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015 , 15 pp., arXiv: 1512.05036

   2014
20. 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: 5)  scopus (cited: 1)
21. 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
22. 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
23. 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–2022