1 citations · 2 across the 6 of their papers we have counts for
6 papers
The Logic of Correct Models
Juan Pablo Aguilera, Fedor Pakhomov
For each , let mean "the sentence is true in all -correct transitive sets." Assuming Gödel's axiom , we prove the following graded varian…
Provable better quasi orders
Anton Freund, Alberto Marcone, Fedor Pakhomov +1
It has recently been shown that fairly strong axiom systems such as cannot prove that the antichain with three elements is a better quasi order (). I…
The logical strength of minimal bad arrays
Anton Freund, Fedor Pakhomov, Giovanni Soldà
This paper studies logical aspects of the notion of better quasi order, which has been introduced by C. Nash-Williams (Mathematical Proceedings of the Cambridge Philosophical Socie…
How to escape Tennenbaum's theorem
Fedor Pakhomov
We construct a theory definitionally equivalent to first-order Peano arithmetic PA and a non-standard computable model of this theory. The same technique allows us to construct a t…
There are no minimal essentially undecidable Theories
Fedor Pakhomov, Juvenal Murwanashyaka, Albert Visser
We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
On Elementary Theories of GLP-Algebras
Fedor Pakhomov
There is a polymodal provability logic . We consider generalizations of this logic: the logics , where ranges over linear ordered sets and play the role of the set…