Jump to content

Primitive recursive set function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by R.e.b. (talk | contribs) at 03:10, 19 July 2014 (Created page with 'In mathematics, '''primitive recursive set functions''' or '''primitive recursive ordinal functions''' are analogs of primitive recursive functions, define...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Definition

References