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:16, 19 July 2014 (→References: Adding/improving reference(s)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  • Jensen, Ronald B.; Karp, Carol, "Primitive recursive set functions", 1971 Axiomatic Set Theory, Proc. Sympos. Pure Math., vol. XIII, Part I, Providence, R.I.: Amer. Math. Soc., pp. 143–176, ISBN 9780821802458, MR 0281602{{citation}}: CS1 maint: extra punctuation (link)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Primitive_recursive_set_function&oldid=617534305"