 Some simple recursive functions may be defined as follows. The  predecessor function \(P\) on numbers is “\(-1\)” (i.e., subtracting one) for all numbers greater than or equal to \(1\), and the predecessor of \(0\) is set to be \(0\). The next term defines the predecessor function which is abbreviated by \(P\).