I'm having trouble with the notation in Sacks' Higher Recursion Theory. I've asked specific questions from page 4. Instead of reading my question in detail and trying to understand my confusion (which would be appreciated), one could probably just read the blockquotes below and tell me exactly what they're supposed to mean in "everyday" mathematical language.
Sacks writes
A predicate $R(f,x)$ is recursive if there is an $e$ such that:
(i) $(f)(x)[\{e\}^{f}(x) \text{ is defined}]$
(ii) $(f)(x)[R(f,x) \leftrightarrow \{e\}^{f}(x)=0]$
What is the purpose/function of the $(f)(x)$ at the beginning of each of items (i) and (ii)? It seems that the purpose is to denote that those are free variables, but then he says
Thus
$ \begin{equation} (Ex)(f)(Eg)R(x,y,f,g,h) \text{ and } (Ef)(h)S(f,h,z) \tag{1} \end{equation} $ are analytical if $R$ and $S$ are recursive.
If my hypothesis about free variables is correct, then I wonder why there is no $(h)(y)$ before $(Ex)(f)(Eg)R(x,y,f,g,h)$ (and similarly for the second conjunct). (I bolded what is intended to be an implicit question; if someone'd like me to make it explicit, I will.)
Finally, Theorem 1.3 reads
If $P(f,x)$ is analytical, then it can be put in one of the following forms: $ (Eg)(y)R(f,x,g,y), \quad (Eg)(h)(Ey)R(f,x,g,h,y)\ldots $ $A(f,x)$ $ (g)(Ey)R(f,x,g,y), \quad (g)(Eh)(y)R(f,x,g,h,y)\ldots $ where $A$ is arithmetic and $R$ is recursive.
Why is the $A(f,x)$ left justified and on its own line?