Персоналии: Пахомов Фёдор Николаевич, Список публикаций

RUS ENG

Полная версия

ПЕРСОНАЛИИ

Пахомов Фёдор Николаевич

Публикации

по годам




2025
1.	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
2.	F. Pakhomov, G. Solda, “On Nash-Williams' Theorem regarding sequences with finite range”, Transactions of the AMS, 2025, 30 (to appear), arXiv: 2405.13842
3.	Hanul Jeon, Patrick Lutz, Fedor Pakhomov, James Walsh, Ranking theories via encoded β-models, 2025, 21 pp., arXiv: 2503.20470
4.	Fedor Pakhomov, Giovanni Soldà, Generalized Higman's Theorem and iterated ideals, 2025, 22 pp., arXiv: 2512.07685

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

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	2 ^[x]
11.	Fedor Pakhomov, James Walsh, “Reducing $\omega$-model reflection to iterated syntactic reflection”, J. Math. Log., 23:2 (2023), 2250001, 38 pp.	2 ^[x]
12.	Anton Freund, Alberto Marcone, Fedor Pakhomov, Giovanni Soldà, 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.
14.	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
15.	С. О. Сперанский, Ф. Н. Пахомов, “Об отношении взаимной простоты с точки зрения монадической логики второго порядка”, Изв. РАН. Сер. матем., 86:6 (2022), 207–222 ; 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	1 ^[x]
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.	9 ^[x]
17.	Fedor Pakhomov, Albert Visser, “Finitely axiomatized theories lack self-comprehension”, Bull. Lond. Math. Soc., 54:6 (2022), 2513–2531, arXiv: 2109.02548	3 ^[x]

2021
18.	Fedor Pakhomov, James Walsh, “Reflection ranks and ordinal analysis”, J. Symb. Log., 86:4 (2021), 1350–1384, arXiv: 1805.02095	8 ^[x]
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	2 ^[x]
21.	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
22.	Luka Mikec, Fedor Pakhomov, Mladen Vuković, “Complexity of the interpretability logic IL”, Log. J. IGPL, 27:1 (2019), 1–7, arXiv: 1710.05599
23.	Fedor Pakhomov, Albert Visser, “On a question of Krajewski's”, J. Symb. Log., 84:1 (2019), 343–358, arXiv: 1712.01713	4 ^[x]
24.	Ali Enayat, Fedor Pakhomov, “Truth, disjunction, and induction”, Arch. Math. Logic, 58 (2019), 753–766, arXiv: 1805.09890	16 ^[x]
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	2 ^[x]

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	2 ^[x]

2016
29.	Ф. Н. Пахомов, “Линейные $\mathrm{GLP}$-алгебры и их элементарные теории”, Изв. РАН. Сер. матем., 80:6 (2016), 173–216 ; F. N. Pakhomov, “Linear $\mathrm{GLP}$-algebras and their elementary theories”, Izv. Math., 80:6 (2016), 1159–1199	3 ^[x]

2015
30.	Ф. Н. Пахомов, “Об элементарных теориях систем ординальных обозначений на основе схем рефлексии”, Избранные вопросы математики и механики, Сборник статей. К 150-летию со дня рождения академика Владимира Андреевича Стеклова, Тр. МИАН, 289, МАИК, М., 2015, 206–226 ; F. N. Pakhomov, “On Elementary Theories of Ordinal Notation Systems Based on Reflection Principles”, Proc. Steklov Inst. Math., 289 (2015), 194–212	5 ^[x]
31.	Fedor Pakhomov, Ordinal notations in Caucal hierarchy, 2015, 15 с., 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	9 ^[x]
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 Gö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.	Ф. Н. Пахомов, “Неразрешимость элементарной теории полурешетки $\mathrm{GLP}$-слов”, Матем. сб., 203:8 (2012), 141–160 ; F. N. Pakhomov, “Undecidability of the elementary theory of the semilattice of GLP-words”, Sb. Math., 203:8 (2012), 1211–1229	4 ^[x]