Artículo
On axiom schemes for T-provably Δ1 formulas
Autor/es | Cordón Franco, Andrés
Fernández Margarit, Alejandro Lara Martín, Francisco Félix |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2014 |
Fecha de depósito | 2019-06-24 |
Publicado en |
|
Resumen | 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 Δ1 provably in an arithmetic theory T. In ... 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 Δ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. |
Identificador del proyecto | MTM2008-06435 |
Cita | Cordó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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On axiom schemes.pdf | 512.7Kb | [PDF] | Ver/ | |