28 research outputs found
What punishment expresses
In this article, I consider the question of what punishment expresses and propose a way of approaching the question that overcomes problems in both psychosocial and philosophical expressivist traditions. The problem in both traditions is, I suggest, the need for an adequate moral – neither moralizing nor reductive – psychology, and I argue that Melanie Klein’s work offers such a moral psychology. I offer a reconstruction of Klein’s central claims and begin to sketch some of its potential implications for an expressive account of punishment. I outline a Kleinian interpretation of modern punishment’s expression as of an essentially persecutory nature but also include depressive realizations that have generally proved too difficult for liberal modernity to work through successfully, and the recent ‘persecutory turn’ is a defence against such realizations. I conclude by considering the wider philosophical significance of a Kleinian account for the expressivist theory of punishment
Host preference of the hemiparasite Struthanthus flexicaulis (Loranthaceae) in ironstone outcrop plant communities, southeast Brazil
Limb lengthening and deformity correction of congenital and acquired deformities in children using the Taylor Spatial Frame
Towards a Hexagonal SiGe Semiconductor Laser
Hexagonal SiGe is shown to feature a direct bandgap with a radiative strength comparable to InP. Surprisingly, it features a temperature independent emission strength, thus promising a silicon compatible laser tunable from 1.8 to 3.5μm
Universality, Tolerance, Chaos and Order
What is the minimum possible number of edges in a graph that contains a copy of every graph on n vertices with maximum degree a most k? This question, as well as several related variants, received a considerable amount of attention during the last decade. In this short survey we describe the known results focusing on the main ideas in the proofs, discuss the remaining open problems, and mention a recent application in the investigation of the complexity of subgraph containment problems