Fedor Pakhomov

According to our database, Fedor Pakhomov authored at least 16 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Feferman's Completeness Theorem.

Fedor Pakhomov, Michael Rathjen, Dino Rossegger

Bull. Symb. Log., 2025

2024

Generalized fusible numbers and their ordinals.

Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov

Ann. Pure Appl. Log., January, 2024

There are no minimal essentially undecidable theories.

Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser

J. Log. Comput., 2024

2023

Corrigendum to Reducing ω-model reflection to iterated syntactic reflection.

Fedor Pakhomov, James Walsh

J. Math. Log., December, 2023

Reducing ω-model reflection to iterated syntactic reflection.

Fedor Pakhomov, James Walsh

J. Math. Log., August, 2023

2022

Arithmetical and Hyperarithmetical Worm Battles.

David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weiermann

J. Log. Comput., 2022

Reflection algebras and conservation results for theories of iterated truth.

Lev D. Beklemishev, Fedor Pakhomov

Ann. Pure Appl. Log., 2022

2021

Reflection ranks and Ordinal Analysis.

Fedor Pakhomov, James Walsh

J. Symb. Log., 2021

2020

Short Proofs for Slow Consistency.

Anton Freund, Fedor Pakhomov

Notre Dame J. Formal Log., 2020

Multi-dimensional Interpretations of Presburger Arithmetic in Itself.

Fedor Pakhomov, Alexander Zapryagaev

J. Log. Comput., 2020

2019

On a Question of Krajewski's.

Fedor Pakhomov, Albert Visser

J. Symb. Log., 2019

Complexity of the interpretability logic IL.

Luka Mikec, Fedor Pakhomov, Mladen Vukovic

Log. J. IGPL, 2019

Truth, disjunction, and induction.

Ali Enayat, Fedor Pakhomov

Arch. Math. Log., 2019

2018

Interpretations of Presburger Arithmetic in Itself.

Alexander Zapryagaev, Fedor Pakhomov

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017

Solovay's Completeness Without Fixed Points.

Fedor Pakhomov

Proceedings of the Logic, Language, Information, and Computation, 2017

2014

On the complexity of the closed fragment of Japaridze's provability logic.

Fedor Pakhomov

Arch. Math. Log., 2014