A partial function is invertible if and only if it is one-to-one. The authors provide a formalism for the invertible partial recursive functions of one argument. They show that this class of partial recursive functions is the class generated from six specified basic partial functions by means of composition and a kind of functional iteration. The paper treats “word” functions over a two-letter alphabet; identification with partial recursive functions over integers is canonical.