Fedor N. Pakhomov

From MaRDI portal
(Redirected from Person:2120975)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Feferman's completeness theorem
The Bulletin of Symbolic Logic
2025-11-18Paper
The logical strength of minimal bad arrays
Proceedings of the American Mathematical Society
2025-01-08Paper
There are no minimal essentially undecidable theories
Journal Of Logic And Computation
2024-11-12Paper
Correction to: ``Arithmetical and hyperarithmetical worm battles
Journal Of Logic And Computation
2024-11-12Paper
Functorial Fast-Growing Hierarchies
Forum of Mathematics, Sigma
2024-02-07Paper
Generalized fusible numbers and their ordinals
Annals of Pure and Applied Logic
2023-10-12Paper
Finitely axiomatized theories lack self‐comprehension
Bulletin of the London Mathematical Society
2023-09-20Paper
On the coprimeness relation from the viewpoint of monadic second-order logic
Izvestiya: Mathematics
2023-09-02Paper
The Π21$\Pi ^1_2$ consequences of a theory
Journal of the London Mathematical Society
2023-08-23Paper
Provable better quasi orders2023-05-01Paper
The logical strength of minimal bad arrays2023-04-01Paper
Arithmetical and Hyperarithmetical Worm Battles
Journal Of Logic And Computation
2023-01-04Paper
Linear Orders in Presburger Arithmetic2022-09-23Paper
How to escape Tennenbaum's theorem2022-09-02Paper
There are no minimal essentially undecidable Theories2022-07-17Paper
Reflection algebras and conservation results for theories of iterated truth
Annals of Pure and Applied Logic
2022-04-01Paper
Multi-dimensional Interpretations of Presburger Arithmetic in Itself
Journal Of Logic And Computation
2020-12-15Paper
Short proofs for slow consistency
Notre Dame Journal of Formal Logic
2020-05-04Paper
Short proofs for slow consistency
Notre Dame Journal of Formal Logic
2020-05-04Paper
Multi-Dimensional Interpretations of Presburger Arithmetic in Itself
(available as arXiv preprint)
2020-04-05Paper
Complexity of the interpretability logic IL
Logic Journal of the IGPL
2019-11-04Paper
Reflection algebras and conservation results for theories of iterated truth
(available as arXiv preprint)
2019-08-27Paper
Truth, disjunction, and induction
Archive for Mathematical Logic
2019-07-04Paper
A weak set theory that proves its own consistency2019-07-01Paper
On a question of Krajewski's
Journal of Symbolic Logic
2019-03-15Paper
Reflection ranks and ordinal analysis
(available as arXiv preprint)
2018-05-05Paper
Interpretations of Presburger arithmetic in itself
(available as arXiv preprint)
2018-04-06Paper
Solovay's completeness without fixed points
(available as arXiv preprint)
2017-12-20Paper
Linear \(\mathrm{GLP}\)-algebras and their elementary theories
Izvestiya: Mathematics
2017-03-08Paper
On elementary theories of ordinal notation systems based on reflection principles
Proceedings of the Steklov Institute of Mathematics
2016-05-10Paper
Slow and Ordinary Provability for Peano Arithmetic2016-02-04Paper
Ordinal Notations in Caucal Hierarchy2015-12-15Paper
On the complexity of the closed fragment of Japaridze's provability logic
Archive for Mathematical Logic
2014-12-15Paper
On Elementary Theories of GLP-Algebras2014-12-14Paper
Undecidability of the elementary theory of the semilattice of GLP-words
Sbornik: Mathematics
2012-11-23Paper
The Logic of Correct Models
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Fedor N. Pakhomov