We investigate the interactions between scalar implicatures and presuppositions in sentences containing both a scalar item and presupposition trigger. We first critically discuss Gajewski and Sharvit's previous approach. We then closely examine two ways of integrating an exhaustivity-based theory of scalar implicatures with a trivalent approach to presuppositions. The empirical side of our discussion focuses on two novel observations: (i) the interactions between prosody and monotonicity, and (ii) what we call presupposed ignorance. In order to account for these observations, our final proposal relies on two mechanisms of scalar strengthening, the Presupposed Ignorance Principle and an exhaustivity operator which lets the presuppositions of negated alternatives project.The authors' names are alphabetically ordered. The present work has greatly benefitted from discussions with a number of colleagues,

The referent of a nonreflexive pronoun depends on context, but the nature of these contextual restrictions is controversial. For instance, in causal dependent clauses, the preferred referent of a pronoun varies systematically with the verb in the main clause (Sally frightens Mary because she … vs. Sally loves Mary because she …). Several theories claim that verbs with similar meanings across languages should show similar pronoun resolution effects, but these claims run contrary to recent analyses on which much of linguistic and nonlinguistic cognition is susceptible to cross-cultural variation, and in fact there is little data in the literature to decide the question one way or another. Analysis of data in eight languages representing four historically unrelated language families reveals consistent pronoun resolution biases for emotion verbs, suggesting that the information upon which implicit causality pronoun resolution biases are derived is stable across languages and cultures.

No abstract

A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper. In the population protocol model, which is a common abstract model of mobile sensor networks, it is known to be impossible to design a self-stabilizing leader election protocol. Thus, in our prior work, we introduced the concept of loose-stabilization, which is weaker than self-stabilization but has similar advantage as selfstabilization in practice. Following this work, several loosely-stabilizing leader election protocols are presented. The loosely-stabilizing leader election guarantees that, starting from an arbitrary configuration, the system reaches a safe configuration with a single leader within a relatively short time, and keeps the unique leader for an sufficiently long time thereafter. The convergence times of all the existing loosely-stabilizing protocols, i.e., the expected time to reach a safe configuration, are polynomial in n where n is the number of nodes (while the holding times to keep the unique leader are exponential in n). In this paper, a loosely-stabilizing protocol with polylogarithmic convergence time is presented. Its holding time is not exponential, but arbitrarily large polynomial in n.

In this article, we present the first leader election protocol in the population protocol model that stabilizes within Oðlog nÞ parallel time in expectation with Oðlog nÞ states per agent, where n is the number of agents. Given a rough knowledge m of lg n such that m ! lg n and m ¼ Oðlog nÞ, the proposed protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter. This protocol is time-optimal because it was recently proven that any leader election protocol requires Vðlog nÞ parallel time.