Fedor Pakhomov

Orcid: 0000-0002-9629-9259

According to our database1, Fedor Pakhomov authored at least 15 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Generalized fusible numbers and their ordinals.
Ann. Pure Appl. Log., January, 2024

There are no minimal essentially undecidable theories.
J. Log. Comput., 2024

2023
Corrigendum to Reducing ω-model reflection to iterated syntactic reflection.
J. Math. Log., December, 2023

Reducing ω-model reflection to iterated syntactic reflection.
J. Math. Log., August, 2023

2022
Arithmetical and Hyperarithmetical Worm Battles.
J. Log. Comput., 2022

Reflection algebras and conservation results for theories of iterated truth.
Ann. Pure Appl. Log., 2022

2021
Reflection ranks and Ordinal Analysis.
J. Symb. Log., 2021

2020
Short Proofs for Slow Consistency.
Notre Dame J. Formal Log., 2020

Multi-dimensional Interpretations of Presburger Arithmetic in Itself.
J. Log. Comput., 2020

2019
On a Question of Krajewski's.
J. Symb. Log., 2019

Complexity of the interpretability logic IL.
Log. J. IGPL, 2019

Truth, disjunction, and induction.
Arch. Math. Log., 2019

2018
Interpretations of Presburger Arithmetic in Itself.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017
Solovay's Completeness Without Fixed Points.
Proceedings of the Logic, Language, Information, and Computation, 2017

2014
On the complexity of the closed fragment of Japaridze's provability logic.
Arch. Math. Log., 2014


  Loading...