Revision as of 13:33, 28 February 2024 edit Janburse (talk \| contribs) Extended confirmed users 1,136 edits →All the "what for" are there ← Previous edit		Revision as of 13:34, 28 February 2024 edit undo Janburse (talk \| contribs) Extended confirmed users 1,136 edits →All the "what for" are there Next edit →
Line 392: :: 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) :: To reduce complexity of the article I would split off Gödel, and I would also split off LOOP/WHILE. Devote separate articles to the two, would make the primitive recursive article more readable and less cluttered with applications of the ~~nation~~notion ~~and~~in ~~alternative~~Gödels theorem and computational devices such as LOOP, that show primitive recursive behaviour. :: [[User:Janburse\|Jan Burse]] ([[User talk:Janburse\|talk]]) 13:26, 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