This article offers an encompassing interpretation of Paul Ricœur’s reception of Max Weber’s sociology. Three main domains in which Ricœur redeployed and revised insights from Weber are examined: political responsibility and the definition of the state, significant categories for understanding social interaction and the social ontology implied by this view on action and, finally, the role of explanation in the interpretive social sciences. As a whole, this article argues that Weber was a significant interlocutor of Ricœur on a number of (...) significant themes in the philosopher’s work. In particular, the article profiles the Weberian aspect of Ricœur’s social and political philosophy. (shrink)

This book contains the systematic results of the authors work with the methods of Goethe and Steiner (whom he knew personally). In this unique study, Lehrs addresses himself to anyonewith or without a specialized scientific trainingconcerned with developing the human power of cognition in the present time.

The paper introduces a new type of rules into Natural Deduction, elimination rules by composition. Elimination rules by composition replace usual elimination rules in the style of disjunction elimination and give a more direct treatment of additive disjunction, multiplicative conjunction, existence quantifier and possibility modality. Elimination rules by composition have an enormous impact on proof-structures of deductions: they do not produce segments, deduction trees remain binary branching, there is no vacuous discharge, there is only few need of permutations. This new (...) type of rules fits especially to substructural issues, so it is shown for Lambek Calculus, i.e. intuitionistic non-commutative linear logic and to its extensions by structural rules like permutation, weakening and contraction. Natural deduction formulated with elimination rules by composition from a complexity perspective is superior to other calculi. (shrink)

The article presents a full proof‐theoretic semantics for natural deduction based on an extended inversion principle: the elimination rule for an operator q may invert the introduction rule for q, but also vice versa, the introduction rule for a connective q may invert the elimination rule for q. Such an inversion—extending Prawitz' concept of inversion—gives the following theorem: Inversion for two rules of operator q (intro rule, elim rule) exists iff a reduction of a maximum formula for q exists. The (...) inversion theorem is specified to two logics, Lambek calculus (LC) and intuitionistic linear logic (ILL), with four propositional connectives: two multiplicatives (implication and conjunction) and two additives (conjunction and disjunction), with two quantifiers and two modals. LC is defined by using elimination rules by composition. ILL is defined by using usual general elimination rules. Elimination rules by composition are an exciting alternative to general elimination rules; in some cases, they do not need permutations. (shrink)

© 2014 South African Journal of Philosophy. This paper argues for the way in which the hermeneutics of human action and the capabilities approach are to be coordinated in judgements regarding the happy life or well-being. To ensure that this hypothesis is not only philosophically plausible but practically reasonable, I apply it throughout to practical examples, namely practices related to the arrangement of space. I argue that judgement regarding happiness or well-being requires two distinct forms of reflection: a hermeneutics that (...) can do justice to the thickness of human living and a thin standard of universal human functional capabilities, by which to point out which insufficient conditions for action undermine human well-being. These two forms of reflection, it will be argued, are theoretically compatible, yet remain-in practice-in tension. Recognition of this tension has to accompany responsible judgement. (shrink)

Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic image-coalgebras that interpret coalgebraic logic which is defined in terms of predicate liftings. We investigate the conditions for the functor under which these notions of equivalence are related by discussing congruences for the underlying stochastic relation. It is demonstrated that logics as diverse as continuous time stochastic logic and general modal logics can be usefully approached through coalgebraic methods.

Name der Zeitschrift: Klio Jahrgang: 96 Heft: 1 Seiten: 287-288.