Cordón Franco, AndrésFernández Margarit, AlejandroLara Martín, Francisco Félix2019-06-242019-06-242014Cordón Franco, A., Fernández Margarit, A. y Lara Martín, F.F. (2014). On axiom schemes for T-provably Δ1 formulas. Archive for Mathematical Logic, 53 (3-4), 327-349.0933-5846https://hdl.handle.net/11441/87552This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are Δ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Δ0+¬exp implies BΣ1 to a purely recursion-theoretic question.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Fragments of Peano arithmeticΔ1 formulasProvably total computable functionsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/s00153-014-0368-9