The base field $\mathbb F$ is probably not important, but I'm using the rational expressions over the binary field, $\mathbb F=\mathbb F_2(x)$.
One subfield of $\mathbb G$ consists of ratios of polynomials in roots of $x$, with coefficients in $\mathbb F_2$, such as
$$\frac{x^{2/5}+x^{-1/3}+x^2}{x^{-2/3}+1}=\frac{x^{16/15}+x^{1/3}+x^{8/3}}{1+x^{2/3}}=\frac{\sqrt[15]x^{40}+\sqrt[15]x^{16}+\sqrt[15]x^5}{\sqrt[15]x^{10}+1},$$
and such expressions are added and multiplied using the usual rules for rational functions, and $x^ax^b=x^{a+b}$ for $a,b\in\mathbb Q$.
Squaring and square roots are linear over $\mathbb F_2$, so we can simply halve the exponents on $x$ to get a square root of the expression. Thus, any $2^n$th root always exists. For example,
$$x+1=(x^{1/2}+1)^2=(x^{1/4}+1)^4=(x^{1/8}+1)^8.$$
But this doesn't work for other $n$th roots; it's not possible to write
$$x+1=\frac{p(x^{1/m})^3}{q(x^{1/m})^3}$$
where $p,q$ are polynomials and $m\in\mathbb N$. So it's necessary to formally adjoin $\sqrt[3]{x+1}$ to the field, or instead $\sqrt[3]{x^{1/2}+1}$, etc.
Is there a unique, well-defined field $\mathbb G$ of such algebraic expressions over $\mathbb F$?
Note that I don't want $n$ different $n$th roots of each element, just a single root (unless $\mathbb F$ already has roots of unity; but I chose $\mathbb F_2$ to avoid this).
Given the algebraic closure $\mathbb A\supseteq\mathbb F$, we might just take the intersection $\mathbb G\overset?=\bigcap\{\mathbb B\}$ of all intermediate fields $\mathbb A\supseteq\mathbb B\supseteq\mathbb F$ with the property $\forall n\in\mathbb N,\,\forall a\in\mathbb B,\,\exists b\in\mathbb B,\,a=b^n$. But this doesn't work because different fields have different roots of $a$, so their intersection contains no root of $a$. Presumably there's some way to use the axiom of choice to construct $\mathbb G$, either through $\mathbb A$, or directly from $\mathbb F$. Is this the case? Can the Wiki proof of existence (I haven't followed it in detail) be modified to give $n$th roots of everything without introducing new roots of unity? And what about uniqueness?
Is there a simpler construction of $\mathbb G$ for the special case of $\mathbb F_2(x)$, that doesn't use the axiom of choice? Here I don't require uniqueness. See for example this answer; we would be using polynomials of the form $x^p-a$ which are irreducible over the field defined by the previous polynomials.
Having several $n$th roots of $a\neq0$ is equivalent to having an $n$th root of unity: If $x_1^n=x_2^n=a$ and $x_1\neq x_2$, then $(x_1/x_2)^n=1$ and $(x_1/x_2)\neq1$. Conversely, if $\omega^n=1$ and $\omega\neq1$, and $x_1^n=a$, then $(\omega x_1)^n=a$ and $x_1\neq\omega x_1$.
If $\mathbb F$ has a primitive $mn$th root of unity, then it also has a primitive $n$th root of unity; so we need only consider prime numbers. Fix two primes $p\neq q$. If $\mathbb F$ has a primitive $p$th root of unity $\omega_1$, then $\mathbb G$ should have a primitive $p^n$th root of unity $\omega_n$ for all $n$, since non-primitive $p^n$th roots of unity can never reach $\omega_{n-1}$ as a $p$th power. If $\mathbb F$ doesn't have a primitive $q$th root of unity, then $\mathbb G$ shouldn't either, since we already have $1^q=1$ and $(\omega_n^r)^q=\omega_n$ where $r=q^{-1}\bmod p^n$.