Artículo
Fragments of Arithmetic and true sentences
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 | 2005 |
Fecha de depósito | 2019-06-24 |
Publicado en |
|
Resumen | By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class
of the ¦n+1–sentences true in the standard model is the only (up to deductive
equivalence) consistent ¦n+1–theory which extends the scheme of induction ... By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is the only (up to deductive equivalence) consistent ¦n+1–theory which extends the scheme of induction for parameter free ¦n+1–formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first–order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. As a consequence, we obtain results on the quantifier complexity, (non)finite axiomatizability and relative strength of schemes for ¢n+1–formulas. |
Identificador del proyecto | TIC-137 |
Cita | Cordón Franco, A., Fernández Margarit, A. y Lara Martín, F.F. (2005). Fragments of Arithmetic and true sentences. Mathematical Logic Quaterly, 51 (3), 313-328. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
mlq-2005.pdf | 253.7Kb | [PDF] | Ver/ | |