Primitive recursive set function: Difference between revisions

Content deleted Content added
Adding/removing wikilink(s)
m stray comma cleanup + WP:GENFIXES, replaced: publisher=Amer. Math. Soc.,| → publisher=Amer. Math. Soc.|, added underlinked tag
Line 1:
{{Underlinked|date=January 2019}}
 
In mathematics, '''primitive recursive set functions''' or '''primitive recursive ordinal functions''' are analogs of [[primitive recursive function]]s, defined for sets or ordinals rather than natural numbers. They were introduced by {{harvtxt|Jensen|Karp|1971}}.
 
Line 27 ⟶ 29:
*{{citation|mr=0281602
|last=Jensen|first= Ronald B.|last2= Karp|first2= Carol
|chapter=Primitive recursive set functions|year= 1971 |title=Axiomatic Set Theory |series=Proc. Sympos. Pure Math.|volume= XIII, Part I|pages= 143–176 |publisher=Amer. Math. Soc.,|place= Providence, R.I.|isbn=9780821802458}}
 
[[Category:Computability theory]]