Revision as of 08:24, 28 February 2024 edit Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Elimination of parameters Tag: Reverted ← Previous edit		Revision as of 08:26, 28 February 2024 edit undo Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Use in first-order Peano arithmetic Tag: Reverted Next edit →
Line 241: == Use in first-order Peano arithmetic == {{expert needed\|computer science\|section\|reason=properly explain the purpose of using the β function (the text only explains how it is used, not what for - I guess in some Gödelian (un)computability proof)\|date=November 2021}} In [[first-order logic\|first-order]] [[Peano arithmetic]], there are infinitely many variables (0-ary symbols) but no [[arity\|k-ary]] non-logical symbols with k>0 other than S, +, *, and ≤. Thus in order to define primitive recursive functions one has to use the following trick by Gödel.

Primitive recursive function: Difference between revisions