12 citations · 33 across the 23 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.LO2015
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,…
math.LO2015
On decidable algebraic fields
Moshe Jarden, Alexandra Shlapentokh
We prove the following propositions. Theorem 1: Let be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primi…
math.NT2015★ 3 cited
On definitions of polynomials over function fields of positive characteristi
Alexandra Shlapentokh
We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$…