The Woods–Erdös conjecture for polynomial rings Original Research Article

The elementary theories of polynomial rings over finite fields with the coprimeness predicate and two kinds of “successor” functions are studied. It is proved that equality is definable in these languages. This gives an affirmative answer to the polynomial analogue of the Woods–Erdös conjecture. It is also proved that these theories are undecidable.