Reflection algebras and conservation results for theories of iterated truth LD Beklemishev, FN Pakhomov Annals of Pure and Applied Logic 173 (5), 103093, 2022 | 22 | 2022 |
Truth, disjunction, and induction A Enayat, F Pakhomov Archive for Mathematical Logic 58, 753-766, 2019 | 21 | 2019 |
Reflection ranks and ordinal analysis F Pakhomov, J Walsh The Journal of Symbolic Logic 86 (4), 1350-1384, 2021 | 20 | 2021 |
On the complexity of the closed fragment of Japaridze’s provability logic F Pakhomov Archive for Mathematical Logic 53, 949-967, 2014 | 20 | 2014 |
Slow and Ordinary Provability for Peano Arithmetic P Henk, F Pakhomov arXiv preprint arXiv:1602.01822, 2016 | 13 | 2016 |
A weak set theory that proves its own consistency F Pakhomov arXiv preprint arXiv:1907.00877, 2019 | 11 | 2019 |
Reducing -model reflection to iterated syntactic reflection F Pakhomov, J Walsh Journal of Mathematical Logic 23 (02), 2250001, 2023 | 9 | 2023 |
Complexity of the interpretability logic IL L Mikec, F Pakhomov, M Vuković Logic Journal of the IGPL 27 (1), 1-7, 2019 | 9 | 2019 |
Multi-dimensional interpretations of Presburger arithmetic in itself F Pakhomov, A Zapryagaev Journal of Logic and Computation 30 (8), 1681-1693, 2020 | 8 | 2020 |
On a question of Krajewski’s F Pakhomov, A Visser The Journal of Symbolic Logic 84 (1), 343-358, 2019 | 8 | 2019 |
On elementary theories of ordinal notation systems based on reflection principles FN Pakhomov Proceedings of the Steklov Institute of Mathematics 289 (1), 194-212, 2015 | 8 | 2015 |
There are no minimal essentially undecidable theories J Murwanashyaka, F Pakhomov, A Visser Journal of Logic and Computation, 2023 | 7* | 2023 |
Finitely axiomatized theories lack self‐comprehension F Pakhomov, A Visser Bulletin of the London Mathematical Society 54 (6), 2513-2531, 2022 | 6 | 2022 |
Interpretations of Presburger arithmetic in itself A Zapryagaev, F Pakhomov International Symposium on Logical Foundations of Computer Science, 354-367, 2017 | 6 | 2017 |
Short proofs for slow consistency A Freund, F Pakhomov Notre Dame Journal of Formal Logic 61 (1), 31-49, 2020 | 5 | 2020 |
Undecidability of the elementary theory of the semilattice of GLP-words FN Pakhomov Sbornik: Mathematics 203 (8), 1211, 2012 | 5 | 2012 |
The Π¹₂ consequences of a theory JP Aguilera, F Pakhomov Journal of the London Mathematical Society 107 (3), 1045-1073, 2023 | 4* | 2023 |
Solovay’s completeness without fixed points F Pakhomov International Workshop on Logic, Language, Information, and Computation, 281-294, 2017 | 3 | 2017 |
Generalized fusible numbers and their ordinals AI Bufetov, G Nivasch, F Pakhomov Annals of Pure and Applied Logic 175 (1), 103355, 2024 | 2 | 2024 |
Functorial fast-growing hierarchies JP Aguilera, F Pakhomov, A Weiermann Forum of Mathematics, Sigma 12, e15, 2024 | 2 | 2024 |