Primitive recursive arithmetic: Difference between revisions

Revision as of 03:59, 20 January 2017

Revision as of 03:49, 2 February 2017

Line 48:

== Logic-free calculus ==

It is possible to formalise PRA in such a way that it has no logical connectives at all - aall—a sentence of PRA is just an equation between two terms. In this setting a term is a primitive recursive function of zero or more variables. In 1941 [[Haskell Curry]] gave the first such system.<ref>{{citation

| last = Curry | first = Haskell B. | author-link = Haskell Curry

| doi = 10.2307/2371522