Reinhard Muskens

Learn More
An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of (Marcus et al. 1983) was integrated with a pure(More)
In this paper I shall show that the DRT (Discourse Representation Theory) treatment of temporal anaphora1 can be formalized within a version of Montague Semantics that is based on classical type logic. This emulation has at least two purposes. In the first place it may serve as one more illustration of the general point that although there are several(More)
In standard Montague Semantics we find a very close correspondence between syntactic and semantic rules (the ‘Rule-to-Rule Hypothesis’). This is attractive from a processing point of view, as we like to think of syntactic and semantic processing as being done in tandem, with information flowing in both directions, from parsing to interpretation and vice(More)
In this paper we develop the beginnings of a tableau system for natural logic, the logic that is present in ordinary language and that us used in ordinary reasoning. The system is based on certain terms of the typed lambda calculus that can go proxy for linguistic forms and which we call Lambda Logical Forms. It is argued that proof-theoretic methods like(More)
In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic(More)
There are three major currents in semantic theory these days. First there is what Chierchia [1990] aptly calls “what is alive of classical Montague semantics”. Secondly, there is Discourse Representation Theory. Thirdly, there is Situation Semantics. Each of these three branches of formal semantics has its own specialities and its particular focuses of(More)
A logic is called higher order if it allows for quantification (and possibly abstraction) over higher order objects, such as functions of individuals, relations between individuals, functions of functions, relations between functions, etc. Higher order logic (often also called type theory or the Theory of Types) began with Frege, was formalized in Russell(More)
The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in(More)
type phrase structure semantics features (d = 1) (d = 2) (d = 3) s νt st φt np νt e φt n νt e(st) φt Table 1: Concretizations of abstract types. The signs in (41) can be combined with arguments such as the simple np in (42). This will lead to untensed sentences such as (43),6 which was obtained by pointwise application of (41a) to (42). (42) 〈Mary,mary,(More)