We offer the first comparison between “direct” and “indirect” methods for measuring perceptions of distributive justice in reward allocations. The direct method simply asks respondents what they would consider to be a fair salary for a particular person in a given set of circumstances. In contrast, the indirect method infers fair salaries from respondents’ judgments about the relative unfairnes...

In this paper we focus on the development of a cut-free finitary tableau calculus with histories for n-agent modal logics with common knowledge (LCK). Thus, we get a proof system where proof-search becomes feasible and we lay the basis for developing a uniform framework for the treatment of the family of logics of common knowledge. Unlike proof calculi based on temporal logics, our calculus giv...

Beta-binders is a recent process calculus developed for modelling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. We present a subset of the calculus for which the structural congruence is decidable and a subset for which it is also effi...

We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calc...

The paper proposes a type logical reformulation of Jacobson’s ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Calculus is extended with a new connective. In the first part, its proof theory is introduced and the logical properties of the resulting calculus are discussed. In the second part, this system is applied to several linguistic phenome...