English

On decidable algebraic fields

Logic 2015-02-16 v1 Number Theory

Abstract

We prove the following propositions. Theorem 1: Let MM be a subfield of a fixed algebraic closure \Q~\tilde \Q of \Q\Q whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive (resp. primitive recursive) subfield L\Q~L \subset \tilde \Q. Theorem 2: For each positive integer ee there are infinitely many ee-tuples σ\Gal(\Q)e\boldsymbol \sigma \in \Gal(\Q)^e such that the field \Q~(σ)\tilde \Q( {\boldsymbol \sigma}) -- the fixed field of σ\boldsymbol \sigma, is recursive in \Q~\tilde\Q and its elementary theory is decidable. Moreover, \Q~(σ)\tilde \Q(\boldsymbol \sigma) is PAC and \Gal(\Q~(σ))\Gal(\tilde\Q(\boldsymbol \sigma)) is isomorphic to the free profinite group on ee generators.

Keywords

Cite

@article{arxiv.1502.03885,
  title  = {On decidable algebraic fields},
  author = {Moshe Jarden and Alexandra Shlapentokh},
  journal= {arXiv preprint arXiv:1502.03885},
  year   = {2015}
}
R2 v1 2026-06-22T08:28:52.094Z