Does there exist a very weak axiomatic theory of arithmetic-weaker than (but possibly a sub-theory of) Robinson's theory Q-which can be interpreted in the first order fragment of Frege logic? If so, what are the axioms of such a theory? By "the first order fragment of Frege logic" I mean the system discussed on pages 251-252 of the book "One Hundred years of Russell's Paradox" (edited by Godehard Link).
$\begingroup$
$\endgroup$
4
asked May 3, 2010 at 19:36
-
$\begingroup$ I don't have a copy of this book. Is the list of axioms too long to post here? $\endgroup$– François G. DoraisCommented May 3, 2010 at 21:54
-
$\begingroup$ How weak will you allow? For example, the empty theory? After all, Q is already extremely weak (the weakest known theory to support the incompleteness theorem). $\endgroup$– Joel David HamkinsCommented May 3, 2010 at 23:08
-
1$\begingroup$ Presburger arithmetic is weaker in some sense than Q, but I don't know if one can interpret Frege's FOL in it. See math.stackexchange.com/questions/4107/… $\endgroup$– Rachid AtmaiCommented Oct 10, 2010 at 7:52
-
$\begingroup$ My question is actually the reverse of this. Can one interpret Presburger Arithmetic in Frege's FOL? $\endgroup$– Garabed GulbenkianCommented Jun 3, 2011 at 20:29
Add a comment
|