| 1. | Let denote the unary primitive recursive function given by this definition.
|
| 2. | When M = 1 Golomb coding is equivalent to unary coding.
|
| 3. | P is a value and the rest are unary-functions.
|
| 4. | B is a value, and the rest are unary functions.
|
| 5. | An algebra all of whose operations are unary is called a presheaf.
|
| 6. | This can be remedied by adding unary inverse functions to the language.
|
| 7. | Inversion also commutes with unary operation of suprema and infima.
|
| 8. | Bijective base-1 is the same as unary.
|
| 9. | So instead let us merge the unary functions together into a binary function.
|
| 10. | I'm surprised it doesn't say unary rather than singulary.
|
