1 citations · 1 across the 21 of their papers we have counts for
4 papers · 1 filter
Infinitary provability logic
Mojtaba Mojtahedi, Fedor Pakhomov, Giovanni Soldà
Gödel-Löb provability logic $\GL$ is a propositional modal system that on one hand enjoys completeness with respect to conversely well-founded Kripke frames and on the other hand c…
Lévy-Montague reflection is -conservative over
Fedor Pakhomov
We study a Lévy-Montague reflection scheme in second-order arithmetic: for each formula , the scheme asserts that every set belongs to a countable coded -model…
Speedups for Presburger Arithmetic and Real Closed Fields
Fedor Pakhomov, Julien Daoud
In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natura…
Well-quasi-orders on finite trees and transfinite sequences
Alakh Dhruv Chopra, Fedor Pakhomov
We study the well-quasi-order (wqo) consisting of the set of finite trees with leaf labels coming from an arbitrary wqo , ordered by tree homomorphisms which respect the order o…