Transactions of the American Mathematical Society · 1980 · 50 citations · 8 references
Natural SciencesComputer ScienceMathematicsLogicNumber TheoryTheory Of ComputationAlgebraic Number TheoryLocal FieldsAlgebraic IntegersArithmetic TheoryGlobal FieldsHasse Norm TheoremNumber ObjectsRing Of IntegersTheories Of Arithmetic
We prove that the theory of global fields is essentially undecidable, using predicates based on Hasse’s Norm Theorem to define valuations. Polynomial rings or the natural numbers are uniformly defined in all global fields, as well as Gödel functions encoding finite sequences of elements.
8
John Tyrrell · Journal of the London Mathematical Society · 1969 · 394 citations
Definability and decision problems in arithmetic
Julia Robinson · Journal of Symbolic Logic · 1949 · 325 citations
On the Decision Problem for Algebraic Rings
Julia Robinson, Gábor Szegő, Charles Loewner et al. · 1970 · 27 citations