1
$\begingroup$

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).

$\endgroup$
4
  • $\begingroup$ I don't have a copy of this book. Is the list of axioms too long to post here? $\endgroup$ 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$ 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$ 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$ Jun 3, 2011 at 20:29

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.