The equine DNAH3 gene: SNP discovery and exclusion of an involvement in recurrent airway obstruction (RAO) in European Warmblood horses

Recurrent airway obstruction is one of the most common airway diseases affecting mature horses. Increased bronchoalveolar mucus, neutrophil accumulation in airways, and airway obstruction are the main features of this disease. Mucociliary clearance is a key component of pulmonary defense mechanisms. Cilia are the motile part of this system and a complex linear array of dynein motors is responsible for their motility by moving along the microtubules in the axonemes of cilia and flagella. We previously detected a QTL for RAO on ECA 13 in a half-sib family of European Warmblood horses. The gene encoding DNAH3 is located in the peak of the detected QTL and encodes a dynein subunit. Therefore, we analysed this gene as a positional and functional candidate gene for RAO. In a mutation analysis of all 62 exons we detected 53 new polymorphisms including 7 non-synonymous variants. We performed an association study using 38 polymorphisms in a cohort of 422 animals. However, after correction for multiple testing we did not detect a significant association of any of these polymorphisms with RAO (P>0.05). Therefore, it seems unlikely that variants at the DNAH3 gene are responsible for the RAO QTL in European Warmblood horses.

A Logical Descriptor for Regular Languages via Stone Duality

In this paper we introduce a class of descriptors for regular languages arising from an application of the Stone duality between finite Boolean algebras and finite sets. These descriptors, called classical fortresses, are object specified in classical propositional logic and capable to accept exactly regular languages. To prove this, we show that the languages accepted by classical fortresses and deterministic finite automata coincide. Classical fortresses, besides being propositional descriptors for regular languages, also turn out to be an efficient tool for providing alternative and intuitive proofs for the closure properties of regular languages.

Poetik des Unbehagens. Unlust als 'point de départ' in Romanen Marie NDiayes

Die Romane der französischen Autorin Marie NDiaye (geb. 1967) sind durchzogen von Zuständen des Unwohlseins: NDiayes Protagonistinnen werden auf diffuse Weise sozial ausgegrenzt oder massiv bedrängt, verlieren die Kontrolle über ihren Körper oder geraten in schwindelerregende Zweifel über den Realitätsgehalt ihrer Sinneswahrnehmungen und Erinnerungen. Anhand der Romane "En famille" (1990), "Autoportrait en vert" (2005) und "Mon cœur à l’étroit" (2007) zeigt der Aufsatz, dass diese Momente des Unbehagens nicht nur die Suchbewegungen und Erkenntnisprozesse der Romanfiguren auslösen, sondern auch die kreative Spannung bilden, die den Vorgang der literarischen inventio in Gang setzt. Theoretische Modelle einer Psychologie, in der Unlust als Antrieb fungiert, finden sich bei Leibniz, Locke und Freud; Elemente einer Narratologie der Unlust, mit der sich die quête-Struktur von NDiayes Romanen beschreiben lässt, bietet die strukturalistische Märchentheorie Wladimir Propps und seiner Nachfolger.

Admissibility via natural dualities

It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may be characterized using natural dualities. In particular, axiomatizations are obtained for the admissible clauses and quasi-identities of bounded distributive lattices, Stone algebras, Kleene algebras and lattices, and De Morgan algebras and lattices.

Applicative theories for logarithmic complexity classes

We present applicative theories of words corresponding to weak, and especially logarithmic, complexity classes. The theories for the logarithmic hierarchy and alternating logarithmic time formalise function algebras with concatenation recursion as main principle. We present two theories for logarithmic space where the first formalises a new two-sorted algebra which is very similar to Cook and Bellantoni's famous two-sorted algebra B for polynomial time [4]. The second theory describes logarithmic space by formalising concatenation- and sharply bounded recursion. All theories contain the predicates WW representing words, and VV representing temporary inaccessible words. They are inspired by Cantini's theories [6] formalising B.

Exact Unification and Admissibility

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always have a smaller or equal cardinality than those provided by the standard instantiation preordering, and in significant cases a dramatic reduction may be observed. In particular, the classes of distributive lattices, idempotent semigroups, and MV-algebras, which all have nullary unification type, have unitary or finitary exact type. These results are obtained via an algebraic interpretation of exact unification, inspired by Ghilardi's algebraic approach to equational unification.