Switch to: References

Add citations

You must login to add citations.
  1. Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
    is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Origin of life as the first MST—control hierarchies and Interlevel relation.Jon Umerez & Alvaro Moreno - 1995 - World Futures 45 (1):139-154.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On axiom schemes for T-provably $${\Delta_{1}}$$ Δ 1 formulas.A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín - 2014 - Archive for Mathematical Logic 53 (3):327-349.
    This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are $${\Delta_1}$$ provably in an arithmetic theory T. In particular, we determine the provably total computable functions of this kind of theories. As an application, we obtain a reduction of the problem whether $${I\Delta_0 + \neg \mathit{exp}}$$ implies $${B\Sigma_1}$$ to a purely recursion-theoretic question.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Characterizing the elementary recursive functions by a fragment of Gödel's T.Arnold Beckmann & Andreas Weiermann - 2000 - Archive for Mathematical Logic 39 (7):475-491.
    Let T be Gödel's system of primitive recursive functionals of finite type in a combinatory logic formulation. Let $T^{\star}$ be the subsystem of T in which the iterator and recursor constants are permitted only when immediately applied to type 0 arguments. By a Howard-Schütte-style argument the $T^{\star}$ -derivation lengths are classified in terms of an iterated exponential function. As a consequence a constructive strong normalization proof for $T^{\star}$ is obtained. Another consequence is that every $T^{\star}$ -representable number-theoretic function is elementary (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations