Now showing items 1-16 of 16

    • Article
      Icon

      A note on parameter free Π1-induction and restricted exponentiation 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2011)
      We characterize the sets of all Π2 and all $\mathcal {B}(\Sigma _{1})$equation image (= Boolean combinations of Σ1) theorems ...
    • Article
      Icon

      A Note on Σ₁-Maximal Models 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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 ...
    • Article
      Icon

      Envelopes, indicators and conservativeness 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Wiley, 2006)
      A well known theorem proved (independently) by J. Paris and H. Friedman states that BΣn +1 (the fragment of Arithmetic ...
    • PhD Thesis
      Icon

      Esquemas del máximo en la aritmética 

      Pérez Jiménez, Mario de Jesús (1992)
      El objetivo fundamental de esta memoria es el estudio de unos nuevos esquemas de axiomas, que denominaremos esquemas del ...
    • Article
      Icon

      Existentially Closed Models and Conservation Results in Bounded Arithmetic 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Oxford Academic, 2009)
      We develop model-theoretic techniques to obtain conservation results for first order Bounded Arithmetic theories, based ...
    • PhD Thesis
      Icon

      Extensiones de fragmentos de la Aritmética 

      Cordón Franco, Andrés (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, ...
    • PhD Thesis
      Icon

      Una extensión de métodos algebraicos a la teoría de modelos 

      Fernández Margarit, Alejandro (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 ...
    • Article
      Icon

      Fragments of Arithmetic and true sentences 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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 ...
    • PhD Thesis
      Icon

      Inducción y recursión las teorías IDelta n+1(T) / 

      Lara Martín, Francisco Félix (1999)
      En este trabajo se realiza un análisis de la conjetura de Friedman-Paris, acerca de la equivalencia entre los fragmentos ...
    • Article
      Icon

      Induction, minimization and collection for Δ n+1 (T)–formulas 

      Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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 ...
    • Article
      Icon

      On axiom schemes for T-provably Δ1 formulas 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Springer, 2014)
      This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and ...
    • Presentation
      Icon

      On Rules and Parameter Free Systems in Bounded Arithmetic 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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.
    • Article
      Icon

      On the Optimality of Conservation Results for Local Reflection in Arithmetic 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (Association for Symbolic Logic, 2013)
      Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local ...
    • Article
      Icon

      On the quantifier complexity of Δ n+1 (T)– induction 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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 ...
    • Presentation
      Icon

      Provably Total Primitive Recursive Functions: Theories with Induction 

      Cordón Franco, Andrés; Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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 ...
    • Article
      Icon

      Some Results on LΔ n+1 

      Fernández Margarit, Alejandro; Lara Martín, Francisco Félix (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.