Finitism and primitive recursive arithmetic

[Lawrence Paulson]

On 10 Dec 2021, at 15:24, martdowd at aol.com wrote:
> 
> One can argue that Ackermann's function if finitist because there is a "self-evident" proof that the recursion terminates.  Here's an interesting paper on the subject, by Lawrence Paulson:
>   https://www.cl.cam.ac.uk/~lp15/papers/Formath/Ackermann.pdf
> 
> Martin Dowd

Thanks for that mention. More self-contained versions of this paper are available:

https://doi.org/10.1017/bsl.2021.47
https://arxiv.org/abs/2104.11157

It’s accepted to the Bulletin of Symbolic Logic.

Larry Paulson