"Natural relations" : a note on X'-structure

With the rise of minimalism, many concepts related to the geometrical relations of phrase structure held fast to in earlier approaches have been reconsidered. This article deals with distinguishing (relational and technical) properties of specifiers and adjuncts in a Bare Phrase Structure framework (X'-Theory). I extend specific aspects of X-structure relevant to the discussion of specifiers vs. adjuncts. I argue that unique specifiers can be derived from the system and that adjunction, possibly multiple, results from Direct Merge only. The final product is a series of relationships in line with recent thoughts and minimalist premises, but formally more similar to earlier conceptions of the X'-schema. I address conceptual, empirical and theoretical arguments against multiple specifiers and related issues next, that is beyond the predictions immediately following from the tripartitional view of clause structure proposed in Grohmann (2000). After laying out my motivations to critically consider the issue, I present a set of data that casts serious doubt over the justifications offered to replace Agr with v as the accusative casemarker. Having conceptual and empirical back-up, I then tackle the theoretical validity of specifiers, and ways to distinguish unique specifiers from (multiple) adjuncts. I introduce a version of Bare Phrase Structure that does so, yet keeps the spirit of defining structural identification over relational rather than categorial properties

Nominalization – lexical and syntactic aspects

The main tenet of the present paper is the thesis that nominalization – like other cases of derivational morphology – is an essentially lexical phenomenon with well defined syntactic (and semantic) conditions and consequences. More specifically, it will be argued that the relation between a verb and the noun derived from it is subject to both systematic and idiosyncratic conditions with respect to lexical as well as syntactic aspects

Solving equations in the relational algebra

Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study \emph{sparse} equations, which are equations with at most polynomially many solutions. We look at their complexity, and compare their expressive power with that of similar notions in the powerset algebra.Comment: Minor revision, accepted for publication in SIAM Journal on Computin

Distorted performance measurement and relational contracts

This paper analyzes the use of alternative performance measures in an agency model in which contracting incorporates both formal and informal agreements. It is shown that under a proper use of verifiable and unverifiable performance measures, the two types of contracts are complements, regardless of the principal’s fallback position. The analysis therefore contrasts earlier results of the literature, and provides a rationale for the application of subjective performance information, as it is frequently incorporated in strategic performance measurement systems