Counting functions (Q689218)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting functions |
scientific article |
Statements
Counting functions (English)
0 references
14 June 1994
0 references
The proof by \textit{F. J. Pelletier} and \textit{N. M. Martin} [ibid. 31, 462- 475 (1990; Zbl 0745.03007)] of Post's Functional Completeness Theorem contains a very complex argument that shows in effect that counting functions are closed under composition. The purpose of this note is to give a simple proof of this result.
0 references
counting functions
0 references
