Natural-Language Predicates as Relations of the Relational Model of Data

Abstract

AbstractIn this paper I review the Neo-Davidsonian semantics of prepositional phrases and secondary predication. I argue that certain types of examples pose challenge to this semantics. I present an alternative to the Neo-Davidsonian analysis which successfully deals with the problematic examples. The core idea lies in representing theta-roles not as functions from events to their participants, but rather as argument-labels encoding the role of each argument in a given verb. As a result, natural-language predicates can now be treated in the manner in which relations are treated in the relational model of data, that is, as naming sets of tuples in which every object is given together with its role named by a corresponding attribute (a theta-role). Such a representation allows the employment of relational algebra operators to calculate the extensions of complex predicates (predicates built out of atomic predicates and/or atomic predicates and prepositions). I lay out the foundations of a relational FOL appropriate for the representation of natural-language predicates and present solutions to the problematic examples. From a practical perspective, the expressions of a relational FOL can be translated to a relational algebra or SQL, which makes it possible to operate with these three languages on the same relational model of data. From a philosophical perspective, a relational FOL permits a return to ‘property-based’ semantics, one in which properties named by predicates are those of individuals, and not of events.