Sobre la base de las Lecciones de Erlangen, se trata de analizar cuál es el procedimiento por el que se construye en la filosofía de Schelling el concepto de libertad. Libertad que, según el Freiheitsschrift, es la capacidad de elegir entre el bien y el mal, no es en el fondo más que el procedimiento por el que el fundamento de la ciencia y el principio de identidad quedan divididos. Esta división no es en cambio una fisura que marca la (...) independencia entre ambos términos, sino que, al contrario, fundamento e identidad guardan una relación de antecedente y de consecuente respectivamente, ocupan dos tareas, dos competencias distintas, y cuyo trabajo conjunto y final es precisamente fruto de la libertad. (shrink)

Ressenya / Reseña / Review Benz, Ernst 2016, Mística y Romanticismo. Las fuentes místicas del Romanticismo alemán, Madrid: Siruela. ISBN 978-84-16638-25-3, 180 páginas.

Nos valemos del concepto de experiencia para tratar de demostrar que la relación entre ésta y lo ideal es indisoluble en Aristóteles y en Schelling en el conjunto de su producción. No existe entre lo real y lo ideal, por tanto, un orden de prioridad en lo tocante a las partes de su sistema, sino que únicamente asumen un orden de anterioridad y posterioridad por lo que hace a una necesidad de tipo metodológico. Con este análisis, por tanto, queremos demostrar (...) que el orden de la experiencia y de lo ideal no es excluyente, sino que, al contario, están en un orden de dependencia gracias al cual tenemos como resultado una filosofía absoluta o la filosofía sin más, lo cual elimina cualquier unilateralismo que quiera conceder cualquier primacía ya bien a lo ideal o a lo real o la existencia en la filosofía de ambos autores. (shrink)

The author analyses the sense of virtue at the very heart of Kantian ethical formalism. First, he verifies the difficulty of placing Kantian ethics in one of the three models developed in the history of Western ethics – prescriptive, intentional and virtue ethics –, insofar as Kant places in the centre of moral analysis the notion of “imperative” (a precept), whose function is to show the purity of the “intention” as the only moral value, which deploys in a doctrine of (...) virtue. Then, he studies the “character” as the metaphysical foundation of Kantian ethics throughout the changes that the account of the relationships between the intelligible and the sensible character from the Critique of Pure Reason to Religion within the Boundaries of Mere Reason suffers in order to show that the doctrine of virtue finds its place in the context of ethic formalism, precisely in the frame of the Kantian conception of moral revolution as an incessant task and progress. In this way, virtue, as a quality of the character, is defined as a moral force of the human will in the compliance of duty. (shrink)

LetTbe a recursive theory in the language of first order Arithmetic. We prove that ifTextends: (a) the scheme of parameter free Δ1-minimization (plusexp). or (b) the scheme of parameter free Π1-induction, then there are no Σ1-maximal models with respect toT. As a consequence, we obtain a new proof of an unpublished theorem of Jeff Paris stating that Σ1-maximal models with respect toIΔ0+expdo not satisfy the scheme of Σ1-collectionBΣ1.

In van Benthem (2008), van Benthem proposes a dynamic consequence relation defined as${\psi _1}, \ldots,{\psi _n}{ \models ^d}\phi \,{\rm{iff}}{ \models ^{pa}}[{\psi _1}] \ldots [{\psi _n}]\phi,$where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation$\models _{\rm{\Gamma }}^d$extending van Benthem’s proposal. It takes into account a set of background conditions Γ, inspired by Makinson (2003) wherein Makinson calls this reasoning ‘modulo’ a set Γ. In the (...) presence of common knowledge, conditional dynamic consequence is definable from (unconditional) dynamic consequence. An open question is whether dynamic consequence is compact. We further investigate a dynamic consequence relation for soft instead of hard announcements. Surprisingly, it shares many properties with (hard) dynamic consequence. Dynamic consequence relations provide a novel perspective on reasoning about protocols in multi-agent systems. (shrink)

Ethics education in higher education often uses a model that allows students to apply ethical theories to a hypothetical dilemma in order to make a decision. However, it is rare that students directly experience the effects of unethical decision making by others. This paper presents an in-class exercise that provides a concrete experience. The exercise gives students the experience of being the victim of unethical behavior, and subsequently allows them to apply basic ethicaltheories to a real life situation. It is (...) suitable for courses in legal environment of business, ethics, and organizational behavior, at the undergraduate or graduate level. When used in a business ethics class, more emphasis can be placed on developing various ethical constructs. A narrative for how this exercise was used in an undergraduate Legal Environment of Business class is provided, along with a list of other experiential exercises that are available to teach ethics. (shrink)

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, Weinheim. (shrink)

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 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, finite axiomatizability and relative strength of schemes for Δn+1-formulas. (shrink)

Let T be a second-order arithmetical theory, Λ a well-order, λ < Λ and X ⊆ ℕ. We use $[\lambda |X]_T^{\rm{\Lambda }}\varphi$ as a formalization of “φ is provable from T and an oracle for the set X, using ω-rules of nesting depth at most λ”.For a set of formulas Γ, define predicative oracle reflection for T over Γ ) to be the schema that asserts that, if X ⊆ ℕ, Λ is a well-order and φ ∈ Γ, then$$\forall \,\lambda (...) < {\rm{\Lambda }}\,.$$In particular, define predicative oracle consistency ) as Pred–O–RFN{0=1}.Our main result is as follows. Let ATR0 be the second-order theory of Arithmetical Transfinite Recursion, ${\rm{RCA}}_0^{\rm{*}}$ be Weakened Recursive Comprehension and ACA be Arithmetical Comprehension with Full Induction. Then,$${\rm{ATR}}_0 \equiv {\rm{RCA}}_0^{\rm{*}} + {\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - Cons\ }}\left \equiv {\rm{RCA}}_0^{\rm{*}} + \,{\rm{Pred - O - RFN}}\,_{{\bf{\Pi }}_2^1 } \left.$$We may even replace ${\rm{RCA}}_0^{\rm{*}}$ by the weaker ECA0, the second-order analogue of Elementary Arithmetic.Thus we characterize ATR0, a theory often considered to embody Predicative Reductionism, in terms of strong reflection and consistency principles. (shrink)

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 Δ1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta_1}$$\end{document} 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Δ0+¬exp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I\Delta_0 + \neg \mathit{exp}}$$\end{document} implies BΣ1\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${B\Sigma_1}$$\end{document} to a purely recursion-theoretic question. (shrink)

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, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons’ conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for Π n+2 and Δ n+1 formulas (see [2]). (shrink)

By a result of L.D. Beklemishev, the hierarchy of nested applications of the $$\Sigma _1$$ -collection rule over any $$\Pi _2$$ -axiomatizable base theory extending Elementary Arithmetic collapses to its first level. We prove that this result cannot in general be extended to base theories of arbitrary quantifier complexity. In fact, given any recursively enumerable set of true $$\Pi _2$$ -sentences, S, we construct a sound $$(\Sigma _2 \! \vee \! \Pi _2)$$ -axiomatized theory T extending S such that the (...) hierarchy of nested applications of the $$\Sigma _1$$ -collection rule over T is proper. Our construction uses some results on subrecursive degree theory obtained by L. Kristiansen. (shrink)

Pineda Canabal, Aníbal (2021)Le concept de non-contemporanéité dans la philosophie d’Ernst BlochHildesheim: OLMS, 355 p.ISBN 978-3-487-16067-2.

En nuestra comunicación tratamos de las interpretaciones sobre uno de los fragmentos textuales comprendidos en el Sobre la Verdad, texto sofístico que pasa, en interpretaciones clásicas como las de Untersteiner o Guthrie, por ser pionero en nuestra tradición filosófico política en cuanto en él se expondrían tesis de claro carácter igualitarista. Si bien en las interpretaciones mencionadas se proclama que el texto en cuestión ataca los fundamentos teoréticos de los defensores de la esclavitud natural, no es menos cierto que otras (...) lecturas atenúan tal rasgo, hablando de un igualitarismo parcial y relativo únicamente a las diferencias culturales. Sin perder de vista el vínculo que ambas posiciones mantienen con la famosa Quaestio Antiphontea criticamos, en base a los textos aducidos por los propios intérpretes, la última posición mencionada, defendiendo que si bien los fragmentos y testimonios a nuestra disposición no nos permiten demostrar definitivamente la naturaleza de las tesis políticas de Antifonte, los mismos nos ofrecen la posibilidad de argüir algunas probabilidades a favor de la existencia de un igualitarismo de corte universal en el Sobre la Verdad. (shrink)

A well known theorem proved by J. Paris and H. Friedman states that BΣn +1 is a Πn +2-conservative extension of IΣn . In this paper, as a continuation of our previous work on collection schemes for Δn +1-formulas , we study a general version of this theorem and characterize theories T such that T + BΣn +1 is a Πn +2-conservative extension of T . We prove that this conservativeness property is equivalent to a model-theoretic property relating Πn-envelopes and (...) Πn-indicators for T . The analysis of Σn +1-collection we develop here is also applied to Σn +1-induction using Parsons' conservativeness theorem instead of Friedman-Paris' theorem.As a corollary, our work provides new model-theoretic proofs of two theorems of R. Kaye, J. Paris and C. Dimitracopoulos : BΣn +1 and IΣn +1 are Σn +3-conservative extensions of their parameter free versions, BΣ–n +1 and IΣ–n +1. (shrink)

El artículo compara el modo como Aristóteles explica que un cuerpo llegue a vivir o que una mente llegue a entender, con el esquema explicativo que emplea Wittgenstein para dar cuenta de problemas como éstos: ¿qué hace posible que el signo adquiera significado, o que una acción sea el seguimiento de una regla? El interés se centra en la lógica de la explicación, y el propósito no es establecer relaciones de influencia, sino explorar analogías formales, con el objetivo de arrojar (...) luz sobre algunos conceptos centrales del pensamiento maduro de Wittgenstein. (shrink)

After arguing that Hume’s judgment on metaphysics is more nuanced than it is usually believed, the relationship between the theory of meaning and the concept, or rather the problem, of “human nature” is analysed in order to underline the relevance of human nature to the explanation of the genesis of meaning and to the extent of the principle of copy, so as to finally examine the relation between meaning and theological discourse.

After arguing that Hume’s judgment on metaphysics is more nuanced than it is usually believed, the relationship between the theory of meaning and the concept, or rather the problem, of “human nature” is analysed in order to underline the relevance of human nature to the explanation of the genesis of meaning and to the extent of the principle of copy, so as to finally examine the relation between meaning and theological discourse.