Refine
Document Type
- Article (1)
- Working Paper (1)
Language
- English (2) (remove)
Has Fulltext
- yes (2)
Is part of the Bibliography
- no (2) (remove)
Keywords
- normalization (2) (remove)
Institute
Several translation scholars have recognised translation as a form of discourse mediation or discourse presentation (see, for example, Mossop 1998). In line with this, "universals" of translation have also been re-framed in the larger context of discourse mediation, as mediation universals rather than something strictly translationspecific (Ulrych 2009). In the present article, this line of enquiry is developed by comparing some of the alleged universals of translation, namely standardization and explicitation, with insights from literary and narratological studies on the nature of discourse presentation. The notion of reportive or interpretative interference (Sternberg 1982) and Fludernik’s (1993) claim that all represented discourse is typical and schematic in nature seem to bear curious resemblance to the notion of standardization or normalization, posited as a possible universal of translation (Mauranen & Kujamäki 2004). Drawing on the results of my earlier research (Kuusi 2011), I present examples of free indirect discourse (FID) used in Dostoevsky’s novel Crime and Punishment with their translations into Finnish. Analyzing the translations, I demonstrate how in
translations, the narratological and literary-theoretical notions of reportive interference and typification/schematization coincide with the translation-theoretical notions of explicitation and standardization.
This paper relates recursive utility in continuous time to its discrete-time origins and provides a rigorous and intuitive alternative to a heuristic approach presented in [Duffie, Epstein 1992], who formally define recursive utility in continuous time via backward stochastic differential equations (stochastic differential utility). Furthermore, we show that the notion of Gâteaux differentiability of certainty equivalents used in their paper has to be replaced by a different concept. Our approach allows us to address the important issue of normalization of aggregators in non-Brownian settings. We show that normalization is always feasible if the certainty equivalent of the aggregator is of expected utility type. Conversely, we prove that in general L´evy frameworks this is essentially also necessary, i.e. aggregators that are not of expected utility type cannot be normalized in general. Besides, for these settings we clarify the relationship of our approach to stochastic differential utility and, finally, establish dynamic programming results. JEL Classifications: D81, D91, C61