On axiom schemes for T-provably   Δ1  formulas

Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix

doi:10.1007/s00153-014-0368-9

Artículo

dc.creator	Cordón Franco, Andrés	es
dc.creator	Fernández Margarit, Alejandro	es
dc.creator	Lara Martín, Francisco Félix	es
dc.date.accessioned	2019-06-24T09:19:16Z
dc.date.available	2019-06-24T09:19:16Z
dc.date.issued	2014
dc.identifier.citation	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.
dc.identifier.issn	0933-5846	es
dc.identifier.uri	https://hdl.handle.net/11441/87552
dc.description.abstract	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.	es
dc.description.sponsorship	Ministerio de Ciencia e Innovación MTM2008–06435	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Springer	es
dc.relation.ispartof	Archive for Mathematical Logic, 53 (3-4), 327-349.
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Fragments of Peano arithmetic	es
dc.subject	Δ1 formulas	es
dc.subject	Provably total computable functions	es
dc.title	On axiom schemes for T-provably Δ1 formulas	es
dc.type	info:eu-repo/semantics/article	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial	es
dc.relation.projectID	MTM2008-06435	es
dc.relation.publisherversion	https://link.springer.com/article/10.1007/s00153-014-0368-9	es
dc.identifier.doi	10.1007/s00153-014-0368-9	es
idus.format.extent	23	es
dc.journaltitle	Archive for Mathematical Logic	es
dc.publication.volumen	53	es
dc.publication.issue	3-4	es
dc.publication.initialPage	327	es
dc.publication.endPage	349	es

Ficheros	Tamaño	Formato	Ver	Descripción
On axiom schemes.pdf	512.7Kb	[PDF]	Ver/Abrir

Este registro aparece en las siguientes colecciones

Artículos (Ciencias de la Computación e Inteligencia Artificial)

Mostrar el registro sencillo del ítem

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional