American Sign Language famously disambiguates pronoun antecedents with the use of space. In ASL, both referential and quantificational NPs can be signed at different locations (‘loci’) in the signing space. Pronouns can later retrieve these NPs by pointing at the same locus. Many analyses of ASL pronouns assume that these spatial loci are the overt realization of formal variables (Lillo-Martin ...

The scalar particle mo in Japanese gives rise to ambiguity in negative contexts. In this paper we argue that the ambiguity cannot be accounted for as a scopal ambiguity, and propose a lexical ambiguity account. In particular, we observe that the distribution of the small reading of mo is limited to a subset of NPI licensing environments, and is sensitive to presuppositions, from which we conclu...

Consider the following choice problem, known as “Ellsberg’s three-color urn example”, or simply the “Ellsberg Paradox” (Ellsberg [7]). An urn contains 30 red balls, and 60 green and blue balls, in unspecified proportions; subjects are asked to compare (i) a bet on a red draw vs. a bet on a green draw, and (ii) a bet on a red or blue draw vs. a bet on a green or blue draw. If the subject wins a ...

We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T |−1)·|T |/2. If the Petri net is conflict free, then the length of the shortest path is at most (|T |+1)·|T |/2. If the Petri net is ...

Augmented marked graphs possess some special characteristics desirable for the analysis and modelling of shared-resource systems. This paper investigates the composition of augmented marked graphs via common resource places, with a focus on preservation of liveness, boundedness, reversibility and conservativeness. It is then applied to system integration, where system components are specified a...

A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelian group. The weight of a subgraph of a group-labeled graph is the sum of the labels of the vertices and edges in the subgraph. A group-labeled graph is said to be balanced if the weight of every cycle in the graph is zero. We give a characterization of balanced group-labeled graphs that generaliz...

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...

The absence of tone marks in text can be considered an instance of defective writing. Yet most writing systems of tone languages in Africa do not mark tone. This adds to ambiguity, which must be resolved on the basis of the context. Using tone-marked lexicons and tone rules the ambiguity can be resolved. This paper deals with a further problem, i.e. how to insert tone marks into a text without ...

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics...