DM

During the last 40 years research of causativity belonged to the central themes of the general and comparative or better typological linguistics. In this respect it is astonishing that in my opinion from the Slavic side this subject was treated if at all very marginally in the past. My interest was motivated by the fact that CC requires an analysis, which touches an interface of morphology, semantics, lexicon and syntax. Therefore it is also easy to grasp by the Minimalistic Program (with the inclusion of Distributive Morphology). Furthermore, the theme comprises important observations concerning questions of diathesis and passive which moti- vated me to choose it for the present volume.

In this article the features of externally and internally caused verbs will be described and put into context of the phenomenon of unaccusa- tivity. My approach will be the following: I will try to characterize the relationship between lexicon and syntax, namely including the concepts of Distributive Morphology and of ROOT-Semantics of verbs, which participate or rather, do not participate in Causative Alternation and unaccusativity.
The Causative Alternation (CAL) will serve as criteria to distin- guish between externally and internally caused causation; with help of the CAL the unaccusative Verbs will be divided into two sub- groups: alternating unaccusative (AU-) verbs and non-alternating unaccusative (NAU-) verbs. In the following an alternate distinction between AU- and NAU-verbs will be developed, namely the pre- sence/absence of information about how the process to be treated was caused.

The universal concept of the encyclopedic lexicon in the English, German and Czech language seems to assume four different ROOTS of verbs at base to classify the Anti-Causativity-Opposition: √agen- tive (murder, assasinate, cut), √internally caused (blossom, wilt, grow), √externally caused (destroy, kill, slay) and √cause unspecified (break, open, melt).

Moreover, it will be shown that unergative/causative pairs depict an independent phenomenon which does not affect considerations about CAL (correspondent to Alexiadou et al. 2006a, b and Marantz 1997, but dissenting Levin − Rappaport Hovav 1995 and Reinhart 2000). In 6 and 7 I will provide an exact analysis of the roots (ROOTS) and the syntactic projections which derive from them.

Falls der Euro unkontrolliert auseinanderbricht, droht Chaos. Daher lohnt es sich zu fragen: Wie ließe sich ein kontrolliertes Ende des Euro organisieren? Auf diese Frage geben zwei Denkschulen entgegengesetzte Antworten. Die Schule der Geheimniskrämer will das Ende des Euro bei Nacht und Nebel organisieren, plötzlich und ohne Vorwarnung. Bankfeiertage und geschlossene Grenzen mit Kapitalkontrollen sind fester Teil solcher Pläne. Alles das ist weder ökonomisch attraktiv noch gerecht; und es verträgt sich nicht gut mit den Grundzügen einer offenen Demokratie. Daher schlagen die Gegner der Geheimniskrämer einen lang angekündigten Ausstieg vor. In ihrem Vorschlag werden alle Euros gleich behandelt. Zu einem öffentlich festgesetzten Zeitpunkt verwandelt sich jeder Euro in einen gewichteten Mix aus seinen Nachfolgewährungen. Der Vorschlag ist einfach, und er ist schon deshalb gerecht, weil er das widerspiegelt, was die Besitzer von Euros in ihren Taschen zu haben glauben: eine Mischung aus Währungen verschiedener Länder.

Swierczkowski's Lemma - as it is usually formulated - asserts that if f is an at least quaternary operation on a finite set A and every operation obtained from f by identifying a pair of variables is a projection, then f is a semiprojection. We generalize this lemma in various ways. First, it is extended to B-valued functions on A instead of operations on A and to essentially at most unary functions instead of projections. Then we characterize the arity gap of functions of small arities in terms of quasi-arity, which in turn provides a further generalization of Swierczkowski's Lemma. Moreover, we explicitly classify all pseudo-Boolean functions according to their arity gap. Finally, we present a general characterization of the arity gaps of B-valued functions on arbitrary finite sets A.

Let G=(V,E). A set S is independent if no two vertices from S are adjacent. The number d(X)= |X|-|N(X)| is the difference of X, and an independent set A is critical if d(A) = maxd(I):I is an independent set. Let us recall that ker(G) is the intersection of all critical independent sets, and core(G) is the intersection of all maximum independent sets. Recently, it was established that ker(G) is a subset of core(G) is true for every graph, while the corresponding equality holds for bipartite graphs. In this paper we present various structural properties of ker(G). The main finding claims that ker(G) is equal to the union of all inclusion minimal independent sets with positive difference.