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-27T09:41:49Z | |
dc.date.available | 2019-06-27T09:41:49Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Cordón Franco, A., Fernández Margarit, A. y Lara Martín, F.F. (2004). On the quantifier complexity of Δ n+1 (T)– induction. Archive for Mathematical Logic, 43 (3), 371-398. | |
dc.identifier.issn | 0933-5846 | es |
dc.identifier.uri | https://hdl.handle.net/11441/87645 | |
dc.description.abstract | In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that IΔ n+1 (T) is Π n+2 –axiomatizable. In particular, IΔ n+1 (IΔ n+1 ) gives an axiomatization of Th Π n+2 (IΔ n+1 ) and is not finitely axiomatizable. This fact relates the fragment IΔ n+1 (IΔ n+1 ) to induction rule for Δ n+1 –formulas. Our arguments, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons’ conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for Π n+2 and Δ n+1 formulas (see [2]). | es |
dc.description.sponsorship | Ministerio de Educación y Cultura DGES PB96-1345 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Archive for Mathematical Logic, 43 (3), 371-398. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Induction | es |
dc.subject | Δ n+1 | es |
dc.subject | Formulas | es |
dc.subject | Quantifier complexity | es |
dc.title | On the quantifier complexity of Δ n+1 (T)– induction | 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 | DGES PB96-1345 | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s00153-003-0198-7 | es |
dc.identifier.doi | 10.1007/s00153-003-0198-7 | es |
idus.format.extent | 28 | es |
dc.journaltitle | Archive for Mathematical Logic | es |
dc.publication.volumen | 43 | es |
dc.publication.issue | 3 | es |
dc.publication.initialPage | 371 | es |
dc.publication.endPage | 398 | es |