Home page
Font:
A A A
Color:
A A A
Images:
Special mode Special mode Special mode

Clear mode

  Home page
Home page
Russian page
English page
Math-Net.Ru | 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 Str. Moscow,
119333, Russia
Tel.: +7(495) 984 81 41
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 |



   2026
1. J. P. Aguilera, F. Pakhomov, “The logic of correct models”, Journal of Mathematical Logic, 26:2 (2026), 2550004, 20 pp. https://www.worldscientific.com/doi/abs/10.1142/S0219061325500047?casa_token=X9neTYK_oKsAAAAA:KRrf4ABca80xPxYhQJUTS7604-PZZORRJqYxkHjx-UcoWbiw_3MXroi79Uomn-XG3NXCXnaoCxkb, arXiv: 2402.15382  crossref

   2025
2. Lev D. Beklemishev, Fedor N. Pakhomov, “Automatic structures and the problem of natural well-orderings”, Model Theory, Computer Science, and Graph Polynomials: Festschrift in honor of Johann A. Makowsky, Trends in Mathematics, eds. K. Meyer, A. Rabinovich, E. Ravve, A. Villaveces, Birkhäuser, 2025, 91–109, arXiv: 2407.10198  crossref 1
3. F. Pakhomov, G. Solda, “On Nash-Williams' Theorem regarding sequences with finite range”, Transactions of the AMS, 2025, 30 (to appear), arXiv: 2405.13842
4. Hanul Jeon, Patrick Lutz, Fedor Pakhomov, James Walsh, Ranking theories via encoded β-models, 2025, 21 pp., arXiv: 2503.20470
5. Fedor Pakhomov, Giovanni Soldà, Generalized Higman's Theorem and iterated ideals, 2025, 22 pp., arXiv: 2512.07685

   2024
6. Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov, “Generalized fusible numbers and their ordinals”, Ann. Pure Appl. Logic, 175 (2024), 103355, 25 pp.  mathnet  crossref  mathscinet 1
7. Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser, “There are no minimal essentially undecidable theories”, J. Logic Comput., 34:6 (2024), 1159–1171  mathnet  crossref  mathscinet 5
8. J. P. Aguilera, F. Pakhomov, A. Weiermann, “Functorial fast-growing hierarchies”, Forum Math. Sigma, 12 (2024), 15, 16 pp.  mathnet  crossref  mathscinet 2
9. Anton Freund, Fedor Pakhomov, Giovanni Soldà, “The logical strength of minimal bad arrays”, Proc. Amer. Math. Soc., 152 (2024), 4993–5005, arXiv: 2304.00278  mathnet  crossref 2

   2023
10. J. P. Aguilera, F. Pakhomov, “The $\Pi^1_2$ consequences of a theory”, J. London Math. Soc., 107:3 (2023), 1045–1073, arXiv: 2109.11652  mathnet  crossref  mathscinet 2
11. Fedor Pakhomov, James Walsh, “Reducing $\omega$-model reflection to iterated syntactic reflection”, J. Math. Log., 23:2 (2023), 2250001, 38 pp.  mathnet  crossref  mathscinet  scopus 2
12. Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà, Provable better quasi orders, 2023, 3 pp., arXiv: 2305.01066
13. J. P. Aguilera, F. Pakhomov, A. Weiermann, “Modern perspectives in Proof Theory”, Philos. Trans. R. Soc. A, 381 (2023), 20220020, 11 pp.  mathnet  crossref  mathscinet
14. J. P. Aguilera, F. Pakhomov, “The spectrum of $\Pi^1_3$-soundness”, Philos. Trans. R. Soc. A, 381 (2023), 20220013, 18 pp.  mathnet  crossref  mathscinet 1

   2022
15. S. O. Speranski, F. N. Pakhomov, “On the coprimeness relation from the viewpoint of monadic second-order logic”, Izv. Math., 86:6 (2022), 1225–1239  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  scopus
16. 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  mathscinet 11
17. Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc., 54:6 (2022), 2513–2531, arXiv: 2109.02548  mathnet  crossref  mathscinet 4

   2021
18. Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 86:4 (2021), 1350–1384, arXiv: 1805.02095  mathnet  crossref  mathscinet  isi  scopus 10
19. Fedor Pakhomov and James Walsh, Reflection ranks via infinitary derivations, 2021, 11 pp., arXiv: 2107.03521

   2020
20. 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  scopus 2
21. 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 4

   2019
22. 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
23. 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  scopus 5
24. Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766, arXiv: 1805.09890  mathnet  crossref  mathscinet  zmath  isi  scopus 17
25. Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth, 2019, 48 pp., arXiv: 1908.10302
26. F. Pakhomov, A weak set theory that proves its own consistency, 2019, 25 pp., arXiv: 1907.00877

   2018
27. 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 2

   2017
28. 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  scopus 2

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

   2015
30. 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  elib  elib  scopus
31. Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015, 15 pp., arXiv: 1512.05036

   2014
32. 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  scopus 9
33. 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
34. 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
35. 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  elib  elib  scopus


Full list of publications
Home page

© Steklov Mathematical Institute of RAS, 2004–2026