14 citations · 33 across the 9 of their papers we have counts for
Showing 2015 · math.LOShow all
2 papers · 2 filters
math.LO2015
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…
math.LO2015★ 4 cited
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…