Entry into terrorist organizations has often been described from an extrinsic perspective, as a biographical rupture. However, the “careers” of activists from illegal Basque far-left and national liberation organizations show continuities, underscored by the players themselves. We used a model developed by Snow and McAdam [2000] to understand the "identity work" that accompanies integration and participation in clandestine groups. Two major forms of identity work characterize entry into the organizations studied: “identity convergence” and “identity amplification”. These results suggest a need to reconsider the heuristic relevance of the concepts of radicalization and tip over into terrorism. They also help clarify the role of both cognitive and affective group identification within the identity redefinition process for the individuals involved.

Bilinguals engage in qualitatively different code-switching patterns (alternation, insertion, and congruent lexicalization) to different degrees, according to their engagement in different types of interactional contexts (single-language context, dual-language context, and dense code-switching context). Drawing on the adaptive control hypothesis, we examined whether bilinguals’ code-switching patterns would differentially shape multiple aspects of cognitive control (interference control, salient cue detection, and opportunistic planning). We found that a dense code-switching context, which predominantly involves insertion and congruent lexicalization, was positively associated with verbal opportunistic planning but negatively associated with interference control and salient cue detection. In contrast, a dual-language context, which predominantly involves alternation, was not associated with interference control or salient cue detection, but with significantly reduced response times for opportunistic planning. Our findings partially corroborate the theoretical predictions of the adaptive control hypothesis. Altogether, our study illustrates the importance of bilinguals’ disparate code-switching practices in shaping cognitive control outcomes.

This paper investigates whether and how speakers track the relative frequency of different patterns of alternation in the lexicon, by investigating speakers’ behavior when they are faced with unpredictability in allomorph selection. We conducted a wug test on Seoul Korean verb paradigms, testing whether speakers can generalize reliable lexical patterns. The test was performed in two directions. In forward formation test, the pre-vocalic base and pre-consonantal non-base forms were the stimulus and response, respectively, whereas in backward formation test, the stimulus–response relation was switched. The results show patterns approximating statistical patterns in Seoul Korean verb lexicon, thus confirming the lexical frequency matching reported in many previous studies. However, contrary to the conventional assumption, the results of the backward formation test are consistent with lexical frequencies relevant for the forward formation, not backward formation. This observed asymmetry is broadly consistent with the single base hypothesis (Albright 2002a, b, 2005, 2008), in which forward, as opposed to backward formation rules play a privileged role in speakers’ morphological grammar.

This paper provides a metric for determining whether a given pair of English words is perceived to be morphologically related, based on objective measurements of the words’ orthographic, phonetic, and semantic similarity to each other. The metric is developed on the basis of results from a behavioural study in which participants were asked to judge the relative similarity of pairs of words. The metric is intended to help researchers determine which forms in a language plausibly have segments that alternate; as an example, it is applied to the lexicon of English to illustrate its utility in calculating the frequency of alternation of [s] and [ʃ].

We show that one-way Π2-alternating Turing machines cannotaccept unary nonregular languages in o(log n) space. This holdsfor an accept mode of space complexity measure, defined asthe worst cost of any accepting computation. This lower boundshould be compared with the corresponding bound for one-wayΣ2-alternating machines, that are able to accept unarynonregular languages in space O(log log n). Thus, Σ2-alternation is more powerful than Π2-alternationfor space bounded one-way machines with unary inputs.

We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwiński.