Weakest reduction for P-completeness
There is first-order reductions.

See Immerman's book, Chapter 3, Theorem 3.26 which states that $\mathrm{REACH}_a$ is complete for $\mathrm{P}$ via first-order reductions.

Also, see my question, for related information on $\mathrm{NP}$.