On decidable algebraic fields
Abstract
We prove the following propositions. Theorem 1: Let M be a subfield of a fixed algebraic closure of whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive (resp. primitive recursive) subfield L ⊂ . Theorem 2: For each positive integer e there are infinitely many e-tuples σ ∈ ()e such that the field ( σ) -- the fixed field of σ, is recursive in and its elementary theory is decidable. Moreover, ( σ) is PAC and (( σ)) is isomorphic to the free profinite group on e generators.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.