The paper deals with the conception of logical empiricism developed by Eino Kaila. Eino Kaila, being a thinker close to the Vienna Circle, departs from some of the central ideas of logical positivism. He identifies a limited number of problems in metaphysics that are meaningful and need to be solved, but he declares the rest of metaphysics to be a logical fallacy. For Eino Kaila, it is not the principle of verification (as a criterion of meaning) but the principle of (...) testability that plays the most important role. In addition, he revises the principle of translatability, insisting that it is impossible to translate a single sentence into the language of experience, but it is possible to translate the whole theory to which the sentence belongs. This is related to his structuralist position in the philosophy of science and his understanding of scientific theories as ‘rationalisations’ as opposed to simple inductive generalisations. The paper compares Eino Kaila’s views expressed during the period of his active interaction with the Vienna Circle be regarded as a predecessor of later critics of logical positivism (in particular, W.V.O. Quine). (shrink)

The paper is devoted to analysis of P. Benacerraf’s argument against set-theoretic reductionist realism which is a fragment of a broader argument, know as the “identification problem”. The analyzed fragment of P. Benacerraf’s argument concerns the possibility of reducing of mathematical notions to set-theoretic notions. The paper presents a reconstruction of P. Benacerraf’s original argumentation, its analysis and also several possible objections proposed by P. Benacerraf himself about 30 years later after the original publication. Namely, he claimed (1) that a (...) set-theoretic definition of natural numbers in G. Frege’s fashion can serve as a proper and unique set-theoretic definition, (2) that his argument doesn’t undermine eliminative reductionsts’ position, (3) that even if there are no argument possible in favor of some particular set-theoretic definition of natural numbers one may take set-theoretic realism for granted. An analysis of the mentioned possible objections shows their dependence on a number of additional premises. The paper demonstrates that P. Benacerraf’s objections on his own argument against set-theoretic realism either have a pragmatic character themselves or essentially rely on additional arguments that are justified pragmatically or require additional argumentation. For example, his possible objections require that set theory is considered as the only true foundational theory in mathematics, and that it has several important pragmatic virtues, like convenience of use to formalize other mathematical theories. In some cases, P. Benacerraf’s objections on their own, or the indicated additional principles may well be called into question, which demonstrates the insufficiency of P. Benacerraf’s objections against his original argument. Without the mentioned pragmatic arguments P. Benacerraf’s objections become a kind of belief in mysticism. Accordingly, his doubts about his own argument against set-theoretical realism seem insufficient to reject the problem of identification and save the position of set-theoretical realism from collapse. (shrink)

The present paper is a commentary on O.A. Domanov’s paper devoted to the use of modern type theory in the analysis of quantification in opaque contexts (e. g., propositional attitudes and believe reports). The article briefly mentions several recent attempts to use type theory to solve a number of philosophical problems. The paper suggests that the use of modern type theory, which has a number of significant advantages over classical logic and set theory, is a very promising direction in the (...) development of philosophical problems in the spirit of analytic philosophy. In addition, the paper indicates a number of questions on which it would be desired to receive a clarification from the author of the paper being commented. (shrink)

Progressions of iterated reflection principles can be used as a tool for the ordinal analysis of formal systems. We discuss various notions of proof-theoretic ordinals and compare the information obtained by means of the reflection principles with the results obtained by the more usual proof-theoretic techniques. In some cases we obtain sharper results, e.g., we define proof-theoretic ordinals relevant to logical complexity Π1 0 and, similarly, for any class Π n 0 . We provide a more general version of the (...) fine structure relationships for iterated reflection principles (due to U. Schmerl [25]). This allows us, in a uniform manner, to analyze main fragments of arithmetic axiomatized by restricted forms of induction, including IΣ n , IΣ n − , IΠ n − and their combinations. We also obtain new conservation results relating the hierarchies of uniform and local reflection principles. In particular, we show that (for a sufficiently broad class of theories T) the uniform Σ1-reflection principle for T is Σ2-conservative over the corresponding local reflection principle. This bears some corollaries on the hierarchies of restricted induction schemata in arithmetic and provides a key tool for our generalization of Schmerl's theorem. (shrink)

A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...) times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work which has been (...) done in the last two decades on provability logic and reflection principles. Because of its abstract algebraic nature, we hope that it will also be of interest for non-prooftheorists. (shrink)

A well-known polymodal provability logic inlMMLBox due to Japaridze is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic. This system plays an important role in some recent applications of provability algebras in proof theory. However, an obstacle in the study of inlMMLBox is that it is incomplete w.r.t. any class of Kripke frames. In this paper we provide a complete Kripke semantics for inlMMLBox . First, we isolate a certain subsystem inlMMLBox (...) of inlMMLBox that is sound and complete w.r.t. a nice class of finite frames. Second, appropriate models for inlMMLBox are defined as the limits of chains of finite expansions of models for inlMMLBox . The techniques involves unions of n -elementary chains and inverse limits of Kripke models. All the results are obtained by purely modal-logical methods formalizable in elementary arithmetic. (shrink)

We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...) of GLP Λ. (shrink)

By a result of Paris and Friedman, the collection axiom schema for $\Sigma_{n+1}$ formulas, $B\Sigma_{n+1}$ , is $\Pi_{n+2}$ conservative over $I\Sigma_n$ . We give a new proof-theoretic proof of this theorem, which is based on a reduction of $B\Sigma_n$ to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for $B\Sigma_n$ and to answer some technical questions left open by Sieg (...) [23] and Hájek [9]. We also give a new proof of independence of $B\Sigma_{n+1}$ over $I\Sigma_n$ by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8]. (shrink)

We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot be much improved: by adapting a (...) theorem of D. Zambella and G. Mints we show that the logic of Π1-conservativity of primitive recursive arithmetic properly extends ILM.In the third part of the paper we give an ordinal classification of -consequences of the standard fragments of Peano arithmetic in terms of reflection principles. This is interesting in view of the general program of ordinal analysis of theories, which in the most standard cases classifies Π-classes of sentences. (shrink)

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open problem formulated by J. (...) Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

We investigate the bimodal logics sound and complete under the interpretation of modal operators as the provability predicates in certain natural pairs of arithmetical theories . Carlson characterized the provability logic for essentially reflexive extensions of theories, i.e. for pairs similar to . Here we study pairs of theories such that the gap between and is not so wide. In view of some general results concerning the problem of classification of the bimodal provability logics we are particularly interested in such (...) pairs that is axiomatized over by ∏1-sentences only, and, for each n 1, proves the n-times iterated consistency of . A complete axiomatization, along with the appropriate Kripke semantics and decision procedures, is found for the two principal cases: finitely axiomatizable extensions of this sort, like e.g. ), ), etc., and reflexive extensions, like ¦n 1\s}), etc. We show that the first logic, ICP, is the minimal and the second one, RP, is the maximal within the class of the provability logics for such pairs of theories. We also show that there are some provability logics lying strictly between these two. As an application of the results of this paper, in the last section the polymodal provability logics for natural recursive progressions of theories based on iteration of consistency are characterized. We construct a system of ordinal notation , which gives exactly one notation to each constructive ordinal, such that the logic corresponding to any progression along coincides with that along natural Kalmar elementary well-orderings. (shrink)

We characterize the bimodal provability logics for certain natural (classes of) pairs of recursively enumerable theories, mostly related to fragments of arithmetic. For example, we shall give axiomatizations, decision procedures, and introduce natural Kripke semantics for the provability logics of (IΔ 0 + EXP, PRA); (PRA, IΣ 1 ); (IΣ m , IΣ n ) for $1 \leq m etc. For the case of finitely axiomatized extensions of theories these results are extended to modal logics with propositional constants.

Reviewed Works:Dick de Jongh, Franco Montagna, Provable Fixed Points.Dick de Jongh, Franco Montagna, Much Shorter Proofs.Alessandra Carbone, Franco Montagna, Rosser Orderings in Bimodal Logics.Alessandra Carbone, Franco Montagna, Much Shorter Proofs: A Bimodal Investigation.

“All Things Are Possible” is a 1920 English translation of the 1905 work by the Ukrainian/Russian existentialist philosopher Shestov. It draws on the aphoristic style of Nietzsche and deals with as diverse issues as science, rationalism and religion. This edition also includes an interesting foreword by D. H. Lawrence. Highly recommended for those with an interest in philosophy, and particularly existentialism. Contents include: “Lev Shestov”, “Note”, “Foreword”, “Zu Fragmentarish Ist Welt Und Leben”, and “Nur Für Schwindelfreie”. Many vintage books such (...) as this are increasingly scarce and expensive. It is with this in mind that we are republishing this volume now in an affordable, modern, high-quality edition complete with a specially-commissioned new biography of the author. (shrink)

We elaborate Weiermann-style phase transitions for well-partial-orderings (wpo) determined by iterated finite sequences under Higman-Friedman style embedding with Gordeev’s symmetric gap condition. For every d-times iterated wpo \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}\right)}$$\end{document} in question, d > 1, we fix a natural extension of Peano Arithmetic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T \supseteq \sf{PA}}$$\end{document}, that proves the corresponding second-order sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{WPO}\left({\rm (...) S}{\textsc{eq}}^{d}, \trianglelefteq _{d}\right) }$$\end{document}. Having this we consider the following parametrized first-order slow well-partial-ordering sentence \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d}, r\right):}$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \forall K > 0 \right) \left( \exists M > 0\right) \left( \forall x_{0},\ldots,x_{M}\in {\rm S}\text{\textsc{eq}}^{d}\right)$$\end{document}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \left( \forall i\leq M\right) \left( \left| x_{i}\right| 1}$$\end{document} then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{d}, \trianglelefteq _{d},r \right) }$$\end{document} is not provable in T.Moreover, by the well-known proof theoretic equivalences we can just as well replace T by PA or ACA0 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta _{1}^{1}\sf{CA}}$$\end{document}, if d = 2 and d = 3, respectively.In the limit case d → ∞ we replaceEFA-provably computable reals r by EFA-provably computable functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f: \mathbb{N} \rightarrow \mathbb{R}_{+}}$$\end{document} and prove analogous theorems. (In the sequel we denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}_{+}}$$\end{document} the set of EFA-provably computable positive reals). In the basic case T = PA we strengthen the basic phase transition result by adding the following static threshold clause\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1\right)}$$\end{document} is still provable in T = PA (actually in EFA). Furthermore we prove the following dynamic threshold clauses which, loosely speaking are obtained by replacing the static threshold t by slowly growing functions 1α given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${1_{\alpha }\left( i\right)\,{:=}\,1+\frac{1}{H_{\alpha }^{-1}\left(i\right) }, H_{\alpha}}$$\end{document} being the familiar fast growing Hardy function and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H_{\alpha }^{-1}\left( i\right)\,{:=}\,\rm min \left\{ j \mid H_{\alpha } \left ( j\right) \geq i \right\}}$$\end{document} the corresponding slowly growing inversion. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha < \varepsilon _{0}}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left({\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2}, 1_{\alpha}\right)}$$\end{document} is provable in T = PA. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sf{SWP}\left( {\rm S}\text{\textsc{eq}}^{2}, \trianglelefteq _{2},1_{\varepsilon _{0}}\right)}$$\end{document} is not provable in T = PA. We conjecture that this pattern is characteristic for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T\supseteq \sf{PA}}$$\end{document} under consideration and their proof-theoretical ordinals o (T ), instead of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon _{0}}$$\end{document}. (shrink)

Le messianisme fait à la fois partie des principaux articles de foi du Judaïsme et appelle en même temps son renversement lorsqu’il se réalise de manière effective. Le messianisme s’exprime alors à travers une critique de la loi comme impératif catégorique, étatique et particulariste exercée par une instance transcendante. Saint-Paul incarne très certainement le fer de lance de cette révolution messianique au fondement de l’universalisme. Cette inauguration d’une loi immanente au sujet destinée à supplanter la loi transcendante du Judaïsme se (...) prolonge à travers un certain nombre de figures de la modernité, notamment celles de Spinoza et Freud. Le messianisme n’est pas à entendre ici comme pure et simple trahison de la loi juive mais au contraire comme révélation d’une fracture qui lui appartient originellement. (shrink)

For more than two thousand years, philosophers and theologians have wrestled with the irreconcilable opposition between Greek rationality (Athens) and biblical revelation (Jerusalem). In Athens and Jersusalem, Lev Shestov -- an inspiration for the French existentialists and the foremost interlocutor of Edmund Husserl, Martin Heidegger, and Martin Buber during the interwar years -- makes the gripping confrontation between these symbolic poles of ancient wisdom his philosophical testament, an argumentative and stylistic tour de force. Although the Russian-born Shestov is little known (...) in the Anglophone world today, his writings influenced many twentieth-century European thinkers, such as Albert Camus, D. H. Lawrence, Thomas Mann, Czesław Miłosz, and Joseph Brodsky. Athens and Jerusalem is Shestov's final, groundbreaking work on the philosophy of religion from an existential perspective. This new, annotated edition of Bernard Martin's classic translation adds references to the cited works as well as glosses of passages from the original Greek, Latin, German, and French. Athens and Jerusalem is Shestov at his most profound and most eloquent and is the clearest expression of his thought that shaped the evolution of continental philosophy and European literature in the twentieth century. (shrink)

Kierkegaard a donne a sa philosophie le nom d'existentielle; il sait certes aussi bien que tout le monde que du point de vue de la philosophie speculative, la philosophie existentielle est la pire des absurdites. Mais cela ne l'arrete pas, cela le ravit au contraire. C'est dans l'"objectivisme" de la philosophie speculative qu'il voit son vice essentiel. "les hommes, ecrit-il, sont devenus trop objectifs pour obtenir la beatitude eternelle, car la beatitude eternelle consiste justement en un interet personnel infiniment passionne". (...) Et cet interet infini est le commencement de la foi. (shrink)

Educational drama or drama-in-education, also known as process drama, is intrinsically an inclusive, mosaic pedagogy that utilizes various dramatic techniques and exercises as educational tools in schools. The goal of this teaching discipline is to engender a holistic and experiential learning that creates meaning and enhances self-expression and personal growth, leading the students to a better understanding of the complexity of human behavior, while also containing the “others” and their viewpoints.1Under the umbrella of D.I.E. there exists a range of different (...) and heterogeneous concepts, objectives, and practices. The contest between drama and theater, process and product, content and free expression... (shrink)

University of Pennsylvania, USA, el322{at}nyu.edu ' + u + '@' + d + ' '//--> One of the most consistent findings in experimental studies of social dilemmas is the positive influence of face-to-face communication on cooperation. The face-to-face `communication effect' has been recently explained in terms of a `focus theory of norms': successful communication focuses agents on pro-social norms, and induces preferences and expectations conducive to cooperation. 1 Many of the studies that point to a communication effect, however, do not (...) further explore whether and to what extent the communication medium affects cooperative behavior. In this article, we ask if pro-social behavior can emerge and survive in computer-mediated environments. We show that, like face-to-face communication, computer-mediated communication also positively affects cooperation in social dilemmas, but cooperation is more difficult to establish and maintain. We argue that the discrepancy between the computer-mediated and the face-to-face communication effects is a consequence of the distinct capabilities of different media to focus agents on pro-social norms and to allow them to develop mutual expectations about future behavior. Key Words: social dilemmas • laboratory experiments • communication • social norms • cooperation • computer-mediated communication. (shrink)

The author argues that the idea of freedom guided Vygotsky’s research from his very first steps in psychology, when he was deliberating on the “overman” and on “mastering one’s own behavior” by mea...

En Occidente son bien conocidos los pensadores rusos de los siglos XIX y XX: Fiodor Doctoievski, Lev Tolstoj, Vladimir Soloviev, Pavel Florenskij, Nicolaj Berdaiev y otros. Pero si los especialistas estudian con profundidad y seriedad el pensamiento ruso literario y filosófico. Por otro lado, las tradiciones filosóficas que se han desarrollado en Rusia a lo largo de los siglos constituyen sin duda parte de la cultura nacional rusa, así como de la cultura europea y mundial. Este breve artículo persigue dos (...) metas: dar a conocer al lector español algunos jalones del desarrollo de la filosofía rusa en el contexto de la historia del pensamiento europeo, con especial atención a su papel en el campo de la educación, y describir la situación y el papel de la filosofía en la actual sociedad rusa. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Translation of Levinas’s Review of Lev Shestov’s Kierkegaard and the Existential PhilosophyJames McLachlan (bio)In 1937, Emmanuel Levinas published a review of Lev Shestov’s Kierkegaard and the Existential Philosophy.1 In one of the first studies in English on Levinas, Edith Wyschogrod claims: “What Levinas writes of Shestov’s analysis of Kierkegaard might well be taken as a program for his own future work.”2 The review of Shestov’s Kierkegaard book shows Levinas (...) sympathy with Shestov’s rebellion against rationalism and totalism, his complaint that the individual and all her concerns, desires, and suffering were crushed by the world and ignored by philosophy. But his review of Shestov’s book also shows Levinas’s concern the rebellion could end in “the vanity of personal protest” and substitute subjective imprisonment for the imprisonment of history.3 Such irrationalism could lead to its own forms of violence, which in 1937 were becoming apparent.Like Levinas, Shestov helped introduce Husserl in France, although in Shestov’s case as an adversary to Husserl with whom he developed a friendship.4 The exchange between Shestov and Levinas’s Strasbourg teacher Jean Hering helped publicize Husserl in France.5 As an [End Page 237] exile in Europe, Shestov published his most powerful works Potestas Clavium, In Job’s Balances, Athens and Jerusalem, and Kierkegaard and the Existential Philosophy. Shestov sought, through a continued hammering, to escape the trap of Being toward radical freedom.6 The form of Shestov’s escape attempt can be situated between Levinas and Kierkegaard. He shares with Levinas the desire to escape ontology but, like Kierkegaard, Shestov’s version of the escape is into a radically individual relation with God through a violent repudiation of the universal; thus, both Levinas’s disagreement with and attraction to Shestov in his 1937 review of Kierkegaard and the Existential Philosophy prefigure his rejection of Kierkegaard.One must be wary of reading Shestov as a kind of introduction to any thinker he engages, and thus the inclusion for many years of Shestov’s book on short bibliographies on Kierkegaard was extremely misleading. The book was quite influential when it appeared in 1936 around the same time as Jean Wahl’s Études Kierkegaardiennes. Shestov’s work is filled with hyperbole, exaggeration, and polemic. All of his writings are more literary essays than works of scholarship. And it is this mesmerizing writing that Russian literary critic D. S. Mirsky called “the tidiest, the most elegant, the most concentrated... in short, the most classical prose in the whole of modern Russian Literature.”7 A more perceptive reader than many Kierkegaardians who have read Kierkegaard and the Existential Philosophy, Levinas wrote in 1937 that “the philosophical project of M. Shestov often takes on the allure of brilliant literary essay. It is a ‘poem’ rather than a ‘work.’ The author is more present therein than his subject.”8Here Levinas notes several important points about Shestov’s Kierkegaard book. Perhaps the most important is that it is not primarily about Kierkegaard that “the author is more present therein than his subject.” Levinas sees Shestov had indeed seized on one of the central aspects of Kierkegaard’s thought but “what affects us more deeply still, and this is not its smallest attraction, the ideas of M. Shestov.”9 This is true of all of Shestov’s work. It is a “vast symposium” around the problems that agitated Shestov. [End Page 238]________Emmanuel Levinas, review of Kierkegaard and the Existential Philosophy (Vox clamantis in deserto), by Leon Chestov, trans. T. Rageot and B. de Schloezer, Revue des Études Juives 101, nos. 1–2 (1937): 139–41.The thought of Søren Kierkegaard, Danish philosopher, dead in 1855, has known for some time a rare good fortune. Jaspers and Heidegger in German, Jean Wahl and Gabriel Marcel in France, are some of the names that permit us to measure the quality of the influence, which, in a very solid manner, he has also exercised on the only modern philosopher of Judaism worthy of the name, Franz Rosenzweig. This good fortune is not just a mode. The moral crisis opened by the War of 1914 has given men a... (shrink)

Cet article aborde le rôle de la nudité sur scène dans l’émergence des modernités en danse, en se penchant plus particulièrement sur le contexte peu étudié de la Russie après la révolution d’Octobre 1917. À travers l’étude des discours et de la réception de l’œuvre de deux protagonistes de la « nouvelle danse » russe des années 1920, Kassian Goleïzovski et Lev Loukine, cette contribution interroge le sens que ces chorégraphes cherchaient à construire autour du dénudement de couple et de (...) groupe sur scène. On montre que ce dénudement reflétait une rupture non seulement avec l’héritage impérial de la danse classique et ses relations genrées entre partenaires, mais aussi avec la « danse libre » introduite auparavant par Isadora Duncan lors de ses tournées dans le pays. (shrink)

Russian translation of Gettier E. L. Is Justified True Belief Knowledge? // Analysis, vol. 23, 1963. Translated by Lev Lamberov with kind permission of the author.

Russian translation of Horwich P. What Is It Like to Be a Deflationary Theory of Meaning? // Philosophical Issues, 5, 1994. Translated by Lev Lamberov with kind permission of the author.

Russian translation of Horwich P. What Is It Like to Be a Deflationary Theory of Meaning? // Philosophical Issues, 5, 1994. Translated by Lev Lamberov with kind permission of the author.

Russian translation of Horwich P. Deflationary Truth and the Problem of Aboutness // Philosophical Issues, 8, 1997. Translated by Lev Lamberov with kind permission of the author.

Russian translation of Horwich P. Deflationary Truth and the Problem of Aboutness // Philosophical Issues, 8, 1997. Translated by Lev Lamberov with kind permission of the author.

Inside What Would Plato Do?, you'll find the basics of philosophy, written in an easy, digestible way we can all understand, along with questions to help you apply these important theories to your own life. So, after you've learned about a philosophical concept, you'll then be challenged to test yourself and see how the results can impact your daily life. For instance, after learning about Kant's theory of morality and the importance of intention you're challenged with questions like: Can good (...) people do bad things? Was there a time when you intended to do something helpful that ended up being hurtful? Does that make you a good person (because you intended to do good) or a bad person (because the results were bad)? What Would Plato Do? will not only help you better understand some of the greatest thinkers ever but will also help you think of the world around you in a whole new way! (shrink)

Unfortunately, Adam Smith’s undeserved legacy as a proponent of laissez-faire and liberal institutions at the international scope inhibits profiting from his refined analysis of international affairs. I argue that the Wealth of Nations’ chapter on colonies contains Smith’s discussion of the sovereign’s adaptation to ignorance in global politics. I examine the sense in which the sovereign is ignorant according to Smith and how sovereigns adapt to ignorance with varying success. His comparative analysis suggests that reduction of one’s share in ignorance (...) is not always desirable, and a priori rejection of ignorance is impractical because it deprives of a potentially advantageous resource. A careful reading of his work enables learning from his approach to global politics, without filtering it through his ideas on the free market. (shrink)