I'm a little out of my depth here, so sorry if my comments don't make sense.

I'm not an expert either, so I'm probably just being unclear

That's supposed to be a r.e. set of axioms, not a single axiom, right? I can easily imagine the program that successively prints the axioms R(x) for all x in L, but how do you enumerate the axioms not R(x) for all x not in L, given that L is only r.e. and not recursive? Or am I missing some easy way to have the whole thing as a single axiom without pulling in the machinery for running arbitrary programs and such?

The axioms don't need to be r.e. If they were, the oracle would never be more helpful than a halting oracle, no?

I don't completely understand why there won't be an accidental smart thing among all the silly things...

I don't either. It's just a strong intuition which I'm not sure I can justify, and which might be wrong.

ETA: By silly, I don't necessarily mean as simple as the examples I gave. Basically if you have a formula phi(S(x), T, F), which holds for arbitrary sentences S(x), provably true T, and provably false S, then you can replace S(x) with R(x), T with R(x in L), and S with R(x not in L). Not sure if that was well explained, but yeah.

At least it looks like my answer is correct :). Also my proof should generalize, if it does work. So I would have guessed that Feferman's (stronger) result was true, and I wouldn't be surprised if the argument was along these lines, though maybe the details are harder.