Listar por autor "Fernández Margarit, Alejandro"
Mostrando ítems 1-16 de 16
-
Artículo
A note on parameter free Π1-induction and restricted exponentiation
(Wiley, 2011)We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems ...
-
Artículo
A Note on Σ₁-Maximal Models
(Association for Symbolic Logic, 2007)Let T be a recursive theory in the language of first order Arithmetic. We prove that if T extends: (a) the scheme of ...
-
Artículo
Envelopes, indicators and conservativeness
(Wiley, 2006)A well known theorem proved (independently) by J. Paris and H. Friedman states that BΣn +1 (the fragment of Arithmetic ...
-
Tesis Doctoral
Esquemas del máximo en la aritmética
(1992)El objetivo fundamental de esta memoria es el estudio de unos nuevos esquemas de axiomas, que denominaremos esquemas del ...
-
Artículo
Existentially Closed Models and Conservation Results in Bounded Arithmetic
(Oxford Academic, 2009)We develop model-theoretic techniques to obtain conservation results for first order Bounded Arithmetic theories, based ...
-
Tesis Doctoral
Extensiones de fragmentos de la Aritmética
(2003)El presente trabajo se enmarca dentro del campo de estudio de los Modelos de la Aritmética de Peano: PA. En líneas generales, ...
-
Tesis Doctoral
Una extensión de métodos algebraicos a la teoría de modelos
(1983-07-02)La idea central de este trabajo consiste en la introducción del concepto de cociente en la teoría de modelos. La construcción ...
-
Artículo
Fragments of Arithmetic and true sentences
(Wiley, 2005)By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is ...
-
Tesis Doctoral
Inducción y recursión las teorías IDelta n+1(T) /
(1999)En este trabajo se realiza un análisis de la conjetura de Friedman-Paris, acerca de la equivalencia entre los fragmentos ...
-
Artículo
Induction, minimization and collection for Δ n+1 (T)–formulas
(Springer, 2004)For a theory T, we study relationships among IΔ n +1 (T), LΔ n+1 (T) and B * Δ n+1 (T). These theories are obtained ...
-
Artículo
On axiom schemes for T-provably Δ1 formulas
(Springer, 2014)This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and ...
-
Ponencia
On Rules and Parameter Free Systems in Bounded Arithmetic
(Springer, 2007)We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.
-
Artículo
On the Optimality of Conservation Results for Local Reflection in Arithmetic
(Association for Symbolic Logic, 2013)Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local ...
-
Artículo
On the quantifier complexity of Δ n+1 (T)– induction
(Springer, 2004)In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity ...
-
Ponencia
Provably Total Primitive Recursive Functions: Theories with Induction
(Springer, 2004)A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory ...
-
Artículo
Some Results on LΔ n+1
(Wiley, 2001)We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.