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

Listar Artículos (Ciencias de la Computación e Inteligencia Artificial) por autor "Fernández Margarit, Alejandro"  

Mostrando ítems 1-10 de 10

    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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 ...
    • Artículo
      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.