Page "L (complexity)" Paragraph 2

Every non-trivial problem in L is complete under log-space reductions so weaker reductions are required to identify meaningful notions of L-completeness, the most common being first-order reductions.