The gender information in written Chinese third person pronouns is not symmetrically encoded: the character for "he" (, with semantic radical , meaning human) is used as a default referring to every individual, while the character for "she" (, with semantic radical , meaning woman) indicates females only. This critical feature could result in different patterns of processing of gender informati...

Les médecins de famille sont confrontés à un nombre croissant patientes et patients souffrant plusieurs maladies concomitantes. développements démographiques en Suisse au niveau global indiquent la poursuite constante cette hausse. Ainsi, le défi que pose diversité des combinaisons vient s’ajouter pénurie personnel qualifié qui ne cesse croître dans domaine soins premier recours.

We devise a new technique to prove lower bounds for the proof size in resolutiontype calculi for quantified Boolean formulas (QBF). The new technique applies to the strong expansion system IR-calc and thereby also to the most studied QBF system Q-Resolution. Our technique exploits a clear semantic paradigm, showing the hardness of a QBF family by demonstrating that (1) the formulas require larg...

The matrix equation X + ATX−1A = Q has been studied extensively when A and Q are real square matrices and Q is symmetric positive definite. The equation has positive definite solutions under suitable conditions, and in that case the solution of interest is the maximal positive definite solution. The same matrix equation plays an important role in Green’s function calculations in nano research, ...

We investigate the bimodal logics sound and complete under the interpretation of modal operators as the provability predicates in certain natural pairs of arithmetical theories (F’, ?2). Carlson characterized the provability logic for essentially reflexive extensions of theories, i.e. for pairs similar to (PA, ZF). Here we study pairs of theories (F’, %!) such that the gap between F and Q is no...

We investigate the problem of synthesising an interface automaton R such that P ‖ R Q, for given deterministic interface automata P and Q. We show that a solution exists iff P and Q⊥ are compatible, and the most general solution is given by (P ‖ Q⊥)⊥, where P⊥ is the automaton P with inputs and outputs interchanged. We also characterise solutions in terms of winning input strategies in the auto...

 For a Banach algebra $fA$, we introduce ~$c.c(fA)$, the set of all $phiin fA^*$ such that $theta_phi:fAto  fA^*$ is a completely continuous operator, where $theta_phi$ is defined by $theta_phi(a)=acdotphi$~~ for all $ain fA$. We call $fA$, a completely continuous Banach algebra if $c.c(fA)=fA^*$. We give some examples of completely continuous Banach algebras and a sufficient condition for an o...