JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Pakhomov, Fedor Nikolaevich
Total publications:
29 (29)
in MathSciNet:
18 (18)
in zbMATH:
5 (5)
in Web of Science:
13 (13)
in Scopus:
14 (14)
Cited articles:
18
Citations:
68
Presentations:
71
Number of views:
This page: 2925 Abstract pages: 2520 Full texts: 392 References: 187
Senior Researcher
Candidate of physico-mathematical sciences
Birth date:
15.07.1990
E-mail:
email
Keywords:
mathematical logic,
proof theory,
modal logic,
decision problems.
Subject:
Proof theory, modal logic, decision problems.
https://www.mathnet.ru/eng/person64334
https://scholar.google.com/citations?user=Srnnd-oAAAAJ&hl=en
https://zbmath.org/authors/?q=ai:pakhomov.f-n
https://mathscinet.ams.org/mathscinet/MRAuthorID/1003226
https://www.webofscience.com/wos/author/record/Q-5602-2016
https://www.scopus.com/authid/detail.url?authorId=55457524000
Full list of publications:
Citations (Crossref Cited-By Service + Math-Net.Ru )
2024
1.
Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov, “Generalized fusible numbers and their ordinals”, Ann. Pure Appl. Logic , 175 (2024), 103355 , 25 pp. ;
1
[x]
2023
2.
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 ;
2
[x]
3.
Fedor Pakhomov, James Walsh, “Reducing $\omega$ -model reflection to iterated syntactic reflection”, J. Math. Log. , 23 :2 (2023), 2250001 , 38 pp. ;
1
[x]
4.
Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà, Provable better quasi orders , 2023 , 3 pp., arXiv: 2305.01066
5.
Anton Freund, Fedor Pakhomov, Giovanni Soldà, The logical strength of minimal bad arrays , 2023 , 11 pp., arXiv: 2304.00278
6.
Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser, “There are no minimal essentially undecidable theories”, J. Logic Comput. , 2023, 1–13 (Published online) ; (Published online)
3
[x]
7.
J. P. Aguilera, F. Pakhomov, A. Weiermann, “Modern perspectives in Proof Theory”, Philos. Trans. R. Soc. A , 381 (2023), 20220020 , 11 pp. ;
8.
J. P. Aguilera, F. Pakhomov, “The spectrum of $\Pi^1_3$ -soundness”, Philos. Trans. R. Soc. A , 381 (2023), 20220013 , 18 pp. ;
1
[x]
2022
9.
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
10.
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. ;
8
[x]
11.
Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc. , 54 :6 (2022), 2513–2531 , arXiv: 2109.02548 ;
2
[x]
2021
12.
Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log. , 86 :4 (2021), 1350–1384 , arXiv: 1805.02095 ;
5
[x]
13.
Fedor Pakhomov and James Walsh, Reflection ranks via infinitary derivations , 2021 , 11 pp., arXiv: 2107.03521
2020
14.
A. Freund, F. Pakhomov, “Short proofs for slow consistency”, Notre Dame J. Formal Logic , 61 :1 (2020), 31–49 , arXiv: 1712.03251 ;
2
[x]
15.
Fedor Pakhomov, Alexander Zapryagaev, “Multi-dimensional Interpretations of Presburger Arithmetic in Itself”, J. Logic Comput. , 30 :8 (2020), 1681–1693 , arXiv: 2004.03404 ;
3
[x]
2019
16.
Luka Mikec, Fedor Pakhomov, Mladen Vuković, “Complexity of the interpretability logic IL”, Log. J. IGPL , 27 :1 (2019), 1–7 , arXiv: 1710.05599
17.
Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log. , 84 :1 (2019), 343–358 , arXiv: 1712.01713
3
[x]
18.
Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic , 58 (2019), 753–766 , arXiv: 1805.09890
15
[x]
19.
Lev D. Beklemishev, Fedor N. Pakhomov, Reflection algebras and conservation results for theories of iterated truth , 2019 , 48 pp., arXiv: 1908.10302
20.
F. Pakhomov, A weak set theory that proves its own consistency , 2019 , 25 pp., arXiv: 1907.00877
2018
21.
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
2
[x]
2017
22.
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
2
[x]
2016
23.
F. N. Pakhomov, “Linear $\mathrm{GLP}$ -algebras and their elementary theories”, Izv. Math. , 80 :6 (2016), 1159–1199
2015
24.
F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math. , 289 (2015), 194–212
25.
Fedor Pakhomov, Ordinal notations in Caucal hierarchy , 2015 , 15 pp., arXiv: 1512.05036
2014
26.
Fedor Pakhomov, “On the complexity of the closed fragment of Japaridze's provability logic”, Arch. Math. Logic , 53 :7 (2014), 949–967
8
[x]
27.
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
28.
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
29.
F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math. , 203 :8 (2012), 1211–1229
Presentations in Math-Net.Ru
1.
Dilators, Reflection, and Forcing: A Proof-Theoretic Analysis of $\Pi^1_1-\mathsf{CA}_0$ (continuation) F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" March 27, 2023 18:30
2.
Dilators, Reflection, and Forcing: A Proof-Theoretic Analysis of $\Pi^1_1-\mathsf{CA}_0$ F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" March 20, 2023 18:30
3.
Алгебры рефлексии для предикативных расширений арифметики Пеано L. D. Beklemishev, F. N. Pakhomov
Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2022 November 23, 2022 11:00
4.
How to escape Tennenbaum's Theorem? F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" November 21, 2022 18:30
5.
Generalized Fusible Numbers F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" April 12, 2021 18:30
6.
Reflection ranks and ordinal analysis F. N. Pakhomov
Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2020 November 25, 2020 11:15
7.
Iterated $\omega$ -model reflection and $\Pi^1_2$ proof-theoretic analysis F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 19, 2020 18:30
8.
О полноте трансфинитных итераций схем рефлексии F. N. Pakhomov
Seminar of the Laboratory of Mathematical Logic (Saint Petersburg) May 12, 2020 18:30
9.
Бар-индукция для классов в арифметике второго порядка F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 28, 2019 18:30
10.
Бар-индукция для классов в арифметике второго порядка F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 21, 2019 18:30
11.
Аксиома детерминированности, занятие 4 F. N. Pakhomov
July 25, 2019 15:30
12.
Аксиома детерминированности, занятие 3 F. N. Pakhomov
July 23, 2019 09:30
13.
Аксиома детерминированности, занятие 2 F. N. Pakhomov
July 21, 2019 11:15
14.
Аксиома детерминированности, занятие 1 F. N. Pakhomov
July 19, 2019 11:15
15.
Лекция 26. Ординальный анализ теории $\mathsf{ATR}_0$ . F. N. Pakhomov
May 20, 2019 16:30
16.
Лекция 25. Ординальный анализ теории $\mathsf{ACA}$ . F. N. Pakhomov
May 13, 2019 16:30
17.
Лекция 24. Некоторые факты о системе $\mathsf{ATR}_0$ . Доказательство фундированности в $\mathsf{ATR}_0$ для ординалов $<\Gamma_0$ . F. N. Pakhomov
April 29, 2019 16:30
18.
Лекция 23. $\mathsf{HYP}$ , как наименьшая $\omega$ -модель теории $\Sigma^1_1\textrm{-}\mathsf{AC}_0$ . Теория $\mathsf{ATR}_0$ и детерминированность открытых игр. F. N. Pakhomov
April 22, 2019 16:30
19.
Итерации $\Pi^1_1$ -рефлексии F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" April 15, 2019 18:30
20.
Лекция 22. F. N. Pakhomov
April 15, 2019 16:30
21.
Итерации $\Pi^1_1$ -рефлексии F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" April 8, 2019 18:30
22.
О границах применимости второй теоремы Гёделя о неполноте F. N. Pakhomov
Meetings of the Moscow Mathematical Society April 2, 2019 18:30
23.
Лекция 20. $\alpha$ -большие множества и фундированность. Нормальные формы $\Pi^1_1$ -формул. F. N. Pakhomov
April 1, 2019 16:30
24.
Лекция 19. $\Pi_2$ -консервативность $\mathsf{WKL}_0$ над $\mathsf{PRA}$ . F. N. Pakhomov
March 25, 2019 18:40
25.
Лекция 18. Стандартные системы, множества Скотта и $\alpha$ -большие множества. F. N. Pakhomov
March 18, 2019 16:30
26.
Лекция 17. Системы арифметики второго порядка $\mathsf{ACA}_0$ , $\mathsf{RCA}_0$ и $\mathsf{WKL}_0$ . F. N. Pakhomov
March 11, 2019 16:45
27.
О коротких доказательствах медленной непротиворечивости F. N. Pakhomov
Traditional winter session MIAN–POMI devoted to the topic "Mathematical logic" December 24, 2018 15:25
28.
Лекция 12 Лемма об ограниченности для $\omega$ -выводов и свойства $\Pi^1_1$ -ординалов теорий F. N. Pakhomov
December 17, 2018 16:30
29.
Лекция 11. $\omega$ -выводы. F. N. Pakhomov
December 10, 2018 16:30
30.
Лекция 10. Система обозначений для ординала $\Gamma_0$ . Доказательства трансфинитной индукции вплоть до $\varepsilon_0$ в $\mathsf{PA}$ . F. N. Pakhomov
December 3, 2018 16:30
31.
О новом методе ординального анализа теории множеств Крипке-Платека F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" November 26, 2018 18:30
32.
О новом методе ординального анализа теории множеств Крипке-Платека F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" November 12, 2018 18:30
33.
Лекция 7. Теорема Парсонса-Минца-Такеути о доказуемо вычислимых функциях $\mathsf{I}\Sigma_1$ (Часть 2). F. N. Pakhomov, L. D. Beklemishev
November 12, 2018 16:30
34.
Лекция 6. Теорема Парсонса-Минца-Такеути о доказуемо вычислимых функциях $\mathsf{I}\Sigma_1$ (Часть 1). F. N. Pakhomov
October 29, 2018 16:30
35.
Лекция 5. Теорема об устранении сечения для исчисления Тейта. F. N. Pakhomov
October 22, 2018 16:30
36.
Лекция 4. Исчисление секвенций в формате Тейта и теорема о полноте для него. L. D. Beklemishev, F. N. Pakhomov
October 15, 2018 16:30
37.
Об аксиоме ограниченности в слабых теориях множеств F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" March 26, 2018 18:30
38.
Теоремы об ускорении доказательств в арифметике Пресбургера F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) February 27, 2018 18:30
39.
О некоторых результатах о принципах рефлексии в арифметике F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" December 18, 2017 18:30
40.
Solovay’s completeness without fixed points F. Pakhomov
Workshop on Proof Theory, Modal Logic and Reflection Principles October 20, 2017 12:50
41.
Об индукции в теориях итерированных определений истины F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 9, 2017 18:30
42.
Об интерпретациях арифметики Пресбургера в самой себе A. Zapryagaev, F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) October 3, 2017 18:30
43.
Об индукции в теориях итерированных определений истины F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 2, 2017 18:35
44.
Цепи из утверждений о медленной непротиворечивости F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" April 3, 2017 18:30
45.
О неразрешимых элементарных теориях полугрупп со свободным одноместным предикатом F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) February 28, 2017 18:30
46.
О новом классе теорий, удовлетворяющих второй теореме Гёделя о неполноте F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" December 19, 2016 18:30
47.
Linear $GLP$ -algebras and their elementary theories F. N. Pakhomov
Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2016 November 16, 2016 14:15
48.
Новое доказательство теоремы Соловея об арифметической полноте логики GL F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) November 15, 2016 18:30
49.
Семантика квазидоказуемости для полных по Крипке расширений логики GL F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) November 8, 2016 18:30
50.
О новом доказательстве теоремы Соловея F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" September 26, 2016 18:30
51.
Predicative subsystem of second-order arithmetic. Lecture 10 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 April 29, 2016 17:30
52.
Predicative subsystem of second-order arithmetic. Lecture 9 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 April 22, 2016 17:30
53.
Системы ординальных обозначений в иерархии Кукаля F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) April 19, 2016 18:30
54.
Predicative subsystem of second-order arithmetic. Lecture 8 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 April 15, 2016 17:30
55.
Predicative subsystem of second-order arithmetic. Lecture 7 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 April 1, 2016 18:00
56.
Predicative subsystem of second-order arithmetic. Lecture 6 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 March 25, 2016 17:30
57.
Predicative subsystem of second-order arithmetic. Lecture 5 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 March 18, 2016 17:30
58.
Predicative subsystem of second-order arithmetic. Lecture 4 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 March 11, 2016 17:30
59.
Predicative subsystem of second-order arithmetic. Lecture 3 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 March 4, 2016 17:30
60.
Predicative subsystem of second-order arithmetic. Lecture 2 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 February 26, 2016 17:30
61.
Predicative subsystem of second-order arithmetic. Lecture 1 F. N. Pakhomov
F. M. Pakhomov course "Predicative subsystem of second-order arithmetic", spring semester 2015/2016 February 19, 2016 17:30
62.
Биинтерпретируемость для расширений ZF F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" February 15, 2016 18:30
63.
О некоторых нестандартных предикатах доказуемости для формальной арифметики Пеано F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) October 27, 2015 18:30
64.
Итерации медленной непротиворечивости. Часть 2 F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 26, 2015 18:30
65.
Итерации медленной непротиворечивости. Часть 1 F. N. Pakhomov
Seminars
"Proof Theory" and "Logic Online Seminar" October 19, 2015 18:30
66.
Lambda calculus, or computational proof theory. Lecture 9 F. N. Pakhomov
Special course "Lambda calculus, or computational proof theory", 2015 April 15, 2015 18:00
67.
Decidability of the elementary theory of the free GLP-algebra generated by constants F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) March 3, 2015 18:30
68.
On the decidability of elementary theories of some ordinal notation systems based on the logic GLP F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) February 24, 2015 18:30
69.
On the computational complexity of the closed fragment of the provability logic GLP F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) April 9, 2013 18:30
70.
On the decidability of elementary theories of provability algebras and their fragments F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) October 23, 2012 18:30
71.
On a class of decidable monadic theories of graphs F. N. Pakhomov
"Algorithmic problems in algebra and logic" (S.I.Adian seminar) March 20, 2012 18:30
Organisations