Switch to: References

Add citations

You must login to add citations.
  1. Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
    It is well known that in any nonstandard model of $\mathsf{PA}$ (Peano arithmetic) neither addition nor multiplication is recursive. In this paper we focus on the recursiveness of unary functions and find several pairs of unary functions which cannot be both recursive in the same nonstandard model of $\mathsf{PA}$ (e.g., $\{2x,2x+1\}$, $\{x^2,2x^2\}$, and $\{2^x,3^x\}$). Furthermore, we prove that for any computable injection $f(x)$, there is a nonstandard model of $\mathsf{PA}$ in which $f(x)$ is recursive.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computational Structuralism &dagger.Volker Halbach & Leon Horsten - 2005 - Philosophia Mathematica 13 (2):174-186.
    According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by models that do not instantiate this structure. Proponents of structuralism have put forward various accounts of how we succeed in fixing one single structure as the intended interpretation of our arithmetical language. We shall look at a proposal that involves Tennenbaum's theorem, which says that any model with addition and multiplication as recursive operations is isomorphic to the standard model of arithmetic. On (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations