During recent years, the concept of mediatization has made a strong impact on media and communication studies, and its advocates have attempted to turn it into a refined and central theoretical framework for media research. The present article distinguishes two forms of mediatization theory: a strong form based on the assumption that a ‘media logic’ increasingly determines the actions of differ...

abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

Paavolainen et. al. (1991) reported that national level cross-country skiers who engaged in explosive type strength training in addition to their normal training, were able improve their force-times i.e. improve their ability to produce a given amount of force in shorter time. This was also described by a significant improvement of jump heights in both static and counter movement jumps, whereas...

Suitable normalization of time{homogeneous rotation{invariant random walks on unit spheres S d R d+1 for d > 2 leads to a central limit theorem with a Gaussian limit measure. This paper is devoted to an associated Edgeworth expansion with respect to the total variation norm. This strong type of convergence is diierent from the classical case. The proof is performed in the more general setting o...

We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain condition over extension bases (namely, the forking ideal is S1, in Hrushovski’s terminology). Using it we prove an independence theorem over extension bases (whic...

We discuss the properties of strictly typed languages on the one hand and soft typing on the other one and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of both strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept e...

We classify, in a non-trivial amenable collection of functors, all 2-chains up to the relation of having the same 1-shell boundary. In particular, we prove that in a rosy theory, every 1-shell of a Lascar strong type is the boundary of some 2-chain, hence making the 1st homology group trivial. We also show that, unlike in simple theories, in rosy theories there is no upper bound on the minimal ...