[FOM] reinquiry

[David Isles]

The following is a slightly changed version of an April 8 inquiry to FOM:


Within a first-order system of Peano arithmetic such as that given in
Kleene’s book which has as function constants only ‘(successor), +
(addition), and x (multiplication) can one prove the existence of functions
of growth rate faster than polynomial without first establishing the
existence of a common multiple for any n of the integers in the sequence
1,...,n?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20120501/93c79b3f/attachment.html>