| Display title | Primitive recursive set function |
| Default sort key | Primitive recursive set function |
| Page length (in bytes) | 4,696 |
| Namespace ID | 0 |
| Page ID | 190755 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Sherlock |
| Date of page creation | 07:12, 10 March 2023 |
| Latest editor | imported>Sherlock |
| Date of latest edit | 07:12, 10 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, primitive recursive set functions or primitive recursive ordinal functions are analogs of primitive recursive functions, defined for sets or ordinals rather than natural numbers. They were introduced by (Jensen Karp). |
