Page "P-complete" Paragraph 3

Formally, a decision problem is P-complete ( complete for the complexity class P ) if it is in P and that every problem in P can be reduced to it by using an appropriate reduction.