Revision as of 23:05, 28 February 2024 edit Janburse (talk \| contribs) Extended confirmed users 1,136 edits →All the "what for" are there ← Previous edit		Revision as of 23:06, 28 February 2024 edit undo Janburse (talk \| contribs) Extended confirmed users 1,136 edits →All the "what for" are there Next edit →
Line 393: :: According to [[Second-order_arithmetic]] there is more than one PA. Which might be contextually relevant, since the principia used higher order logic, as noted by Gödel 2.1 Definitions https://hirzels.com/martin/papers/canon00-goedel.pdf :: [[User:Janburse\|Jan Burse]] ([[User talk:Janburse\|talk]]) 12:33, 28 February 2024 (UTC) :: Nobody uses the terminology "multivariate" in recursion theory. The term n-ary means a function with n-arguments. The ~~Cnantor~~Cantor [[Pairing_function]] can be used to encode two or more arguments in one argument, and its also possible to reverse the process. The function is itself primitive recursive, so are its projections. :: [[User:Janburse\|Jan Burse]] ([[User talk:Janburse\|talk]]) 23:02, 28 February 2024 (UTC) About the used references in the article. Instead of Rose as reference for Elimination of Parameters, its seems you could also use Moschovakis 1994, ch. 5.

Talk:Primitive recursive function: Difference between revisions