Fedor N. Pakhomov

From MaRDI portal
Person:2120975

Available identifiers

zbMath Open pakhomov.fedor-nMaRDI QIDQ2120975

List of research outcomes





PublicationDate of PublicationType
The logical strength of minimal bad arrays2025-01-08Paper
There are no minimal essentially undecidable theories2024-11-12Paper
Correction to: ``Arithmetical and hyperarithmetical worm battles2024-11-12Paper
Functorial Fast-Growing Hierarchies2024-02-07Paper
Generalized fusible numbers and their ordinals2023-10-12Paper
Finitely axiomatized theories lack self‐comprehension2023-09-20Paper
On the coprimeness relation from the viewpoint of monadic second-order logic2023-09-02Paper
The Π21$\Pi ^1_2$ consequences of a theory2023-08-23Paper
Provable better quasi orders2023-05-01Paper
The logical strength of minimal bad arrays2023-04-01Paper
Arithmetical and Hyperarithmetical Worm Battles2023-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 truth2022-04-01Paper
Multi-dimensional Interpretations of Presburger Arithmetic in Itself2020-12-15Paper
Short proofs for slow consistency2020-05-04Paper
Multi-Dimensional Interpretations of Presburger Arithmetic in Itself2020-04-05Paper
Complexity of the interpretability logic IL2019-11-04Paper
Reflection algebras and conservation results for theories of iterated truth2019-08-27Paper
Truth, disjunction, and induction2019-07-04Paper
A weak set theory that proves its own consistency2019-07-01Paper
ON A QUESTION OF KRAJEWSKI’S2019-03-15Paper
Reflection ranks and ordinal analysis2018-05-05Paper
Interpretations of Presburger arithmetic in itself2018-04-06Paper
Solovay's completeness without fixed points2017-12-20Paper
Linear $ \mathrm{GLP}$-algebras and their elementary theories2017-03-08Paper
On elementary theories of ordinal notation systems based on reflection principles2016-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 logic2014-12-15Paper
On Elementary Theories of GLP-Algebras2014-12-14Paper
Undecidability of the elementary theory of the semilattice of GLP-words2012-11-23Paper
The Logic of Correct ModelsN/APaper

Research outcomes over time

This page was built for person: Fedor N. Pakhomov