default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFedor Pakhomov
Person information
- affiliation: Ghent University, Ghent, Belgium
- affiliation: Russian Academy of Sciences, Steklov Mathematical Institute, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j15]Fedor Pakhomov, Alexander Zapryagaev:
Linear orders in Presburger arithmetic. Log. J. IGPL 34(4) (2026)- 2025
- [j14]Fedor Pakhomov
, Michael Rathjen, Dino Rossegger:
Feferman's Completeness Theorem. Bull. Symb. Log. 31(3): 462-487 (2025) - [p1]Lev D. Beklemishev, Fedor N. Pakhomov:
Automatic Structures and the Problem of Natural Well-orderings. Festschrift in Honor of Johann A. Makowsky 2025: 91-109 - 2024
- [j13]Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov:
Generalized fusible numbers and their ordinals. Ann. Pure Appl. Log. 175(Issue 1, Part A): 103355 (2024) - [j12]Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser:
There are no minimal essentially undecidable theories. J. Log. Comput. 34(6): 1159-1171 (2024) - 2023
- [j11]Fedor Pakhomov, James Walsh:
Reducing ω-model reflection to iterated syntactic reflection. J. Math. Log. 23(2): 2250001:1-2250001:40 (2023) - [j10]Fedor Pakhomov, James Walsh:
Corrigendum to Reducing ω-model reflection to iterated syntactic reflection. J. Math. Log. 23(3): 2392001:1-2392001:11 (2023) - 2022
- [j9]Lev D. Beklemishev, Fedor N. Pakhomov:
Reflection algebras and conservation results for theories of iterated truth. Ann. Pure Appl. Log. 173(5): 103093 (2022) - [j8]David Fernández-Duque, Joost J. Joosten, Fedor Pakhomov, Konstantinos Papafilippou, Andreas Weiermann:
Arithmetical and Hyperarithmetical Worm Battles. J. Log. Comput. 32(8): 1558-1584 (2022) - [i1]Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov:
Generalized fusible numbers and their ordinals. CoRR abs/2205.11017 (2022) - 2021
- [j7]Fedor Pakhomov, James Walsh:
Reflection ranks and Ordinal Analysis. J. Symb. Log. 86(4): 1350-1384 (2021) - 2020
- [j6]Fedor Pakhomov, Alexander Zapryagaev:
Multi-dimensional Interpretations of Presburger Arithmetic in Itself. J. Log. Comput. 30(8): 1681-1693 (2020) - [j5]Anton Freund, Fedor Pakhomov:
Short Proofs for Slow Consistency. Notre Dame J. Formal Log. 61(1): 31-49 (2020)
2010 – 2019
- 2019
- [j4]Ali Enayat, Fedor Pakhomov:
Truth, disjunction, and induction. Arch. Math. Log. 58(5-6): 753-766 (2019) - [j3]Luka Mikec, Fedor Pakhomov, Mladen Vukovic:
Complexity of the interpretability logic IL. Log. J. IGPL 27(1): 1-7 (2019) - [j2]Fedor Pakhomov, Albert Visser:
On a Question of Krajewski's. J. Symb. Log. 84(1): 343-358 (2019) - 2018
- [c2]Alexander Zapryagaev, Fedor Pakhomov:
Interpretations of Presburger Arithmetic in Itself. LFCS 2018: 354-367 - 2017
- [c1]Fedor Pakhomov:
Solovay's Completeness Without Fixed Points. WoLLIC 2017: 281-294 - 2014
- [j1]Fedor Pakhomov:
On the complexity of the closed fragment of Japaridze's provability logic. Arch. Math. Log. 53(7-8): 949-967 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-04 01:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
