Many languages have verbal stems like hug and marry whose intransitive realization is interpreted as reciprocal. Previous semantic analyses of such reciprocal intransitives rely on the assumption symmetric participation. Thus, 'Sam Julia hugged' assumed to entail both hugged Julia' 'Julia Sam'. In this paper we report experimental results that go against assumption. It shown although participat...

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only they satisfy the same formulas in a certain modal logic. In this paper we study type result general context, moving from systems to coalgebras bisimilarity coinductive predicates. We formulate when logic fully characterises predicate on coalgebras, by providing suitable noti...

Abstract This Commentaire bears out a prediction of Anand et al.'s (to appear) syntactic identity condition on sluicing. Identity is calculated over argument domains as small clauses. With extraction clause subject, sluicing possible where only predicate has an antecedent.

The existence of syntactic abilities allowing human beings to process complex languages remains mysterious. According to some authors, these abilities appeared by mere chance at some point in evolution, and their use in communication is, in some way, fortuitous. We try here to show how a simple model of the syntaxsemantic interface allows us to consider a quite different scenario. The ability t...

Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definitely been on the design of and reasoning with these predicates, whereas implementation issues have been largely neglected. Besides, design efforts have been restricted to simplified abstractions of spatial objects like ...

In this paper, we propose compositional separation logic with tree predicates (CSLTP), where properties such as sortedness and heightbalancedness of complex data structures (for instance, AVL trees and red-black trees) can be fully specified. We show that the satisfiability problem of CSLTP is decidable. The main technical ingredient of the decision procedure is to compute the least fixed point...

This paper investigates the variation of resultative serial verb constructions in Benue-Kwa languages. The main claim is that can be explained assuming three versions general lexicon rules which turn verbs into complex predicates selecting for a second and attracting its arguments. Each language has specific version these rules, enriched with peculiarities to account behaviour verbal inflection...