•  1
    Partiendo del desarrollo de los diferentes enfoques sobre derechos humanos, plantearemos que su reactivación pasa por el necesario debate interno de las instituciones, significados y alcance real de la democracia en el seno de las denominadas sociedades democrático-liberales. Por ello analizaremos las crecientes movilizaciones sociales presentes en buena parte de occidente y profundizaremos en el significado de dos acontecimientos: la virtualidad de un antagonismo en el progresismo político y la…Read more
  • Ética de la adecuación: ciudad y democracia
    Agora 26 (2): 115-128. 2007.
  •  33
    Maximum Schemes in Arithmetic
    Mathematical Logic Quarterly 40 (3): 425-430. 1994.
    In this paper we deal with some new axiom schemes for Peano's Arithmetic that can substitute the classical induction, least-element, collection and strong collection schemes in the description of PA
  •  39
    Induction, minimization and collection for Δ n+1 (T)–formulas
    Archive for Mathematical Logic 43 (4): 505-541. 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 restricting the schemes of induction, minimization and (a version of) collection to Δ n+1 (T) formulas. We obtain conditions on T (T is an extension of B * Δ n+1 (T) or Δ n+1 (T) is closed (in T) under bounded quantification) under which IΔ n+1 (T) and LΔ n+1 (T) are equivalent. These conditions depend on Th Πn +2 (T), the Π n+2 –consequences of T. The first condition is connected …Read more
  •  34
    On axiom schemes for T-provably $${\Delta_{1}}$$ Δ 1 formulas
    Archive for Mathematical Logic 53 (3): 327-349. 2014.
    This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are $${\Delta_1}$$ provably in an arithmetic theory T. In particular, we determine the provably total computable functions of this kind of theories. As an application, we obtain a reduction of the problem whether $${I\Delta_0 + \neg \mathit{exp}}$$ implies $${B\Sigma_1}$$ to a purely recursion-theoretic question.
  •  42
    On the quantifier complexity of Δ n+1 (T)– induction
    Archive for Mathematical Logic 43 (3): 371-398. 2004.
    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, invo…Read more
  •  35
    Tres conceptos de alteridad: una lectura actitudinal
    Daimon: Revista Internacional de Filosofía 61. 2014.
  •  16
    La Transición democrática española supone un período fundamental de nuestra historia reciente. Esta se trata del hito configurador de nuestro actual sistema democrático, lo que evidencia la importancia de que sea estudiada en los institutos de nuestro país. Este artículo pretende trazar una propuesta didáctica para su estudio en 2º de Bachillerato. Uniendo las ideas de aprendizaje en espiral, aula invertida y aprendizaje constructivista se diseña un planteamiento didáctico innovador que pretende…Read more
  •  55
    We characterize the sets of all Π2 and all equation image theorems of IΠ−1 in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ−n + 1 is conservative over IΣ−n with respect to equation image sentences cannot be extended to Πn + 2 sentences. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, We…Read more