[FOM] Finite axiomatisation
urquhart at cs.toronto.edu
Wed Aug 20 15:27:49 EDT 2008
> Also, there is some independent interest, I would think, in knowing
> the shortest, or close to the shortest, finite axiomatisation of PA.
> Does anyone have any ideas on how it would look? Does anyone want to try it?
Perhaps the simplest way would be to apply the same trick that
generates NBG set theory from ZFC, that is to say, add a set of
axioms defining first-order properties. It could be that this
has been already done in the literature.
More information about the FOM