35 citations · 86 across the 22 of their papers we have counts for
3 papers · 1 filter
A Computable Functor From Graphs to Fields
Russell Miller, Bjorn Poonen, Hans Schoutens +1
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory,…
Computable functors and effective interpretability
Matthew Harrison-Trainor, Alexander Melnikov, Russell Miller +1
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theo…
On computable field embeddings and difference closed fields
Matthew Harrison-Trainor, Russell Miller, Alexander Melnikov
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply ou…