Skip to main content
fixed grammar
Source Link
Kaveh
  • 5.5k
  • 2
  • 37
  • 52

Carl's answer is correct.

There is also a to more direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even for far weaker theories like $IOpen$ plus some number theoretic principles, but not for $IOpen$, a result due to Shepherdson). $I\Delta_0+Exp$
$I\Delta_0+exp$ is finitely axiomatization due to a result byaxiomatizable, see Haim Gaifman and Constantine Dimitracopoulos in their paper, "Fragments of Peano's Arithmetic and the MRDP Theorem" and it. It is also a sub-theory of $PA$.

###Edit

TakeFor more on Tennenbaum's theorem and weak arithmetics, have a look at this paper for what is known about the weak theories and Tennenbaum's theorem:
Shahram Mohsenipour, "Hierarchies of Subsystems of Weak Arithmetic", to appear
to appear in Setin "Set theory, Arithmetic, Philosophy: Essays in Memory of Stanley TennenbaumTennenbaum" (edited by J. Kennedy and R. Kossak), Cambridge University Press.

Carl's answer is correct.

There is also a more direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even far weaker theories $IOpen$ plus some number theoretic principles). $I\Delta_0+Exp$ is finitely axiomatization due to a result by Haim Gaifman and Constantine Dimitracopoulos in their paper "Fragments of Peano's Arithmetic and the MRDP Theorem" and it is also a sub-theory of $PA$.

###Edit

Take a look at this paper for what is known about the weak theories and Tennenbaum's theorem:
Shahram Mohsenipour, "Hierarchies of Subsystems of Weak Arithmetic",
to appear in Set theory, Arithmetic, Philosophy: Essays in Memory of Stanley Tennenbaum (edited by J. Kennedy and R. Kossak), Cambridge University Press.

Carl's answer is correct.

There is also a to more direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even for far weaker theories like $IOpen$ plus some number theoretic principles, but not for $IOpen$, a result due to Shepherdson).
$I\Delta_0+exp$ is finitely axiomatizable, see Haim Gaifman and Constantine Dimitracopoulos, "Fragments of Peano's Arithmetic and the MRDP Theorem". It is also a sub-theory of $PA$.

For more on Tennenbaum's theorem and weak arithmetics, have a look at this paper:
Shahram Mohsenipour, "Hierarchies of Subsystems of Weak Arithmetic", to appear
in "Set theory, Arithmetic, Philosophy: Essays in Memory of Stanley Tennenbaum" (edited by J. Kennedy and R. Kossak), Cambridge University Press.

fixed grammar
Source Link
Kaveh
  • 5.5k
  • 2
  • 37
  • 52

Carl's answer is correct.

There is also more a more direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even far weaker theories $IOpen$ plus some number theoretic principles). $I\Delta_0+Exp$ is finitely axiomatization due to a result by Haim Gaifman and Constantine Dimitracopoulos in their paper "Fragments of Peano's Arithmetic and the MRDP Theorem" and it is also a sub-theory of $PA$.

###Edit

Take a look at this paper for what is known about the weak theories and Tennenbaum's theorem:
Shahram Mohsenipour, "Hierarchies of Subsystems of Weak Arithmetic",
to appear in Set theory, Arithmetic, Philosophy: Essays in Memory of Stanley Tennenbaum (edited by J. Kennedy and R. Kossak), Cambridge University Press.

Carl's answer is correct.

There is also more a direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even far weaker theories $IOpen$ plus some number theoretic principles). $I\Delta_0+Exp$ is finitely axiomatization due to a result by Haim Gaifman and Constantine Dimitracopoulos in their paper "Fragments of Peano's Arithmetic and the MRDP Theorem" and it is also a sub-theory of $PA$.

Carl's answer is correct.

There is also a more direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even far weaker theories $IOpen$ plus some number theoretic principles). $I\Delta_0+Exp$ is finitely axiomatization due to a result by Haim Gaifman and Constantine Dimitracopoulos in their paper "Fragments of Peano's Arithmetic and the MRDP Theorem" and it is also a sub-theory of $PA$.

###Edit

Take a look at this paper for what is known about the weak theories and Tennenbaum's theorem:
Shahram Mohsenipour, "Hierarchies of Subsystems of Weak Arithmetic",
to appear in Set theory, Arithmetic, Philosophy: Essays in Memory of Stanley Tennenbaum (edited by J. Kennedy and R. Kossak), Cambridge University Press.

Source Link
Kaveh
  • 5.5k
  • 2
  • 37
  • 52

Carl's answer is correct.

There is also more a direct way to achieve the same thing. The Tennenbaum's theorem holds for much weaker theories, e.g. $I\Delta_0$ (even far weaker theories $IOpen$ plus some number theoretic principles). $I\Delta_0+Exp$ is finitely axiomatization due to a result by Haim Gaifman and Constantine Dimitracopoulos in their paper "Fragments of Peano's Arithmetic and the MRDP Theorem" and it is also a sub-theory of $PA$.