kanovei at wmwap1.math.uni-wuppertal.de
Fri Sep 28 02:17:20 EDT 2001
> From: JoeShipman at aol.com
> Date: Thu, 27 Sep 2001 16:24:13 EDT
> By the way, are there any nice finitely axiomatizable systems which stand in the same relation to Peano Arithmetic or to Finite Set Theory as Godel-Bernays set theory stands to ZFC? (that is, they may introduce new predicates but are conservative extensions with respect to sentences which don't use the new predicates).
A suitably predicative version of 2nd order PA should be such
(I know no references).
More information about the FOM