•  67
    Perception Verbs
    In R. E. Asher & J. M. Y. Simpson (eds.), The Encyclopedia of Language and Linguistics, Pergamon. pp. 6--2999. 1993.
    The semantics of a sentence containing a perception verb such as see or hear depends to a high degree on the exact syntactic form of the perception verb’s complement. Let us compare sentence (1), where the complement is tenseless, with (2), where the complement is a tensed clause
  • CLAUS Report Nr 86 (edited book)
    University of the Saarland. 1997).
  •  6
    Computing Meaning (edited book)
    with Harry Bunt
    Kluwer. 1999.
    This book provides an in-depth view of the current issues, problems and approaches in the computation of meaning as expressed in language. Aimed at linguists, computer scientists, and logicians with an interest in the computation of meaning, this book focuses on two main topics in recent research in computational semantics. The first topic is the definition and use of underspecified semantic representations, i.e. formal structures that represent part of the meaning of a linguistic object while l…Read more
  •  533
    Static and dynamic vector semantics for lambda calculus models of natural language
    with Mehrnoosh Sadrzadeh
    Journal of Language Modelling 6 (2): 319-351. 2018.
    Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, t…Read more
  •  427
    Analytic Tableaux for all of SIXTEEN 3
    Journal of Philosophical Logic 44 (5): 473-487. 2015.
    In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment relations will in general require devel…Read more
  •  15
    16TaP: A Toy Tableau Theorem Prover for 16-Valued Trilattice Logics
    A Programming Road to Logic, Maths, Language, and Philosophy : A Tribute to Jan van Eijck on the Occasion of His Retirement. 2017.
    A short description of a toy theorem prover for 16-valued trilattice logics. Written for the occasion of my friend's Jan van Eijck's retirement. With a link to a swish interface to the prolog prover.
  •  539
    Context Update for Lambdas and Vectors
    with Mehrnoosh Sadrzadeh
    In Maxime Amblard, Philippe de Groote, Sylvain Pogodalla & Christian Rétoré (eds.), Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016), Springer. pp. 247--254. 2016.
    Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for language based on the si…Read more
  •  492
    A Theory of Names and True Intensionality
    In Maria Aloni, V. Kimmelman, Floris Roelofsen, G. Weidman Sassoon, Katrin Schulz & M. Westera (eds.), Logic, Language and Meaning: 18th Amsterdam Colloquium, Springer. pp. 441-449. 2012.
    Standard approaches to proper names, based on Kripke's views, hold that the semantic values of expressions are (set-theoretic) functions from possible worlds to extensions and that names are rigid designators, i.e.\ that their values are \emph{constant} functions from worlds to entities. The difficulties with these approaches are well-known and in this paper we develop an alternative. Based on earlier work on a higher order logic that is \emph{truly intensional} in the sense that it does not val…Read more
  • Dynamics
    In J. F. A. K. Van Benthem, Johan van Benthem & Alice G. B. Ter Meulen (eds.), Handbook of Logic and Language, Elsevier. pp. 587-648. 1997.
  •  56
    Meaning and Partiality
    CSLI Publications. 1995.
    This book radically simplifies Montague Semantics and generalizes the theory by basing it on a partial higher order logic. The resulting theory is a synthesis of Montague Semantics and Situation Semantics. In the late sixties Richard Montague developed the revolutionary idea that we can understand the concept of meaning in ordinary languages much in the same way as we understand the semantics of logical languages. Unfortunately, however, he formalized his idea in an unnecessarily complex way - t…Read more
  •  11
    Review of 'Exploring Logical Dynamics' by Johan van Benthem, 1998 (review)
    Algemeen Nederlands Tijdschrift voor Wijsbegeerte 90 (1): 84-86. 1998.
    Veel Nederlandse woorden (dans, zet, oordeel, assertie, ...) duiden zowel een handeling aan als het resultaat van die handeling. Het fenomeen doet zich in vrijwel alle talen voor en het lijkt erop dat het menselijke cognitieve apparaat er niet zoveel moeite mee heeft te wisselen tussen een statisch perspectief dat resultaten ziet en een dynamisch perspectief dat vooral gericht is op de processen die tot die resultaten geleid hebben. De filosofie heeft meer moeite met het wisselen tussen een stat…Read more
  •  347
    From Bi-facial Truth to Bi-facial Proofs
    Studia Logica 103 (3): 545-558. 2015.
    In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic…Read more
  •  188
    In R. E. Asher & J. M. Y. Simpson (eds.), The Encyclopedia of Language and Linguistics, Pergamon. pp. 769. 1993.
    In mathematical languages and in predicate logic coreferential terms can be interchanged in any sentence without altering the truth value of that sentence. Replacing 3 + 5 by 12 − 4 in any formula of arithmetic will never lead from truth to falsity or from falsity to truth. But natural languages are different in this respect. While in some contexts it is always allowed to interchange coreferential terms, other contexts do not admit this. An example of the first sort of context is likes bananas: …Read more
  •  206
    In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation…Read more
  •  964
    Type-Logical Semantics
    Routledge Encyclopedia of Philosophy Online. 2011.
    Type-logical semantics studies linguistic meaning with the help of the theory of types. The latter originated with Russell as an answer to the paradoxes, but has the additional virtue that it is very close to ordinary language. In fact, type theory is so much more similar to language than predicate logic is, that adopting it as a vehicle of representation can overcome the mismatches between grammatical form and predicate logical form that were observed by Frege and Russell. The grammatical forms…Read more
  •  367
    A Gentzen Calculus for Nothing but the Truth
    Journal of Philosophical Logic 45 (4): 451-465. 2016.
    In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for the Belnap-Dunn l…Read more
  •  368
    In this paper it is shown how the DRT (Discourse Representation Theory) treatment of temporal anaphora can be formalized within a version of Montague Semantics that is based on classical type logic.
  •  44
    Interpolation Methods for Dunn Logics and Their Extensions
    Studia Logica 105 (6): 1319-1347. 2017.
    The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In t…Read more
  •  317
    Underspecified semantics
    In Klaus von Heusinger & Urs Egli (eds.), Reference and Anaphoric Relations, Kluwer Academic Publishers. pp. 311--338. 2000.
    Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating read…Read more
  •  345
    On Partial and Paraconsistent Logics
    Notre Dame Journal of Formal Logic 40 (3): 352-374. 1999.
    In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent …Read more
  •  592
    Sense and the computation of reference
    Linguistics and Philosophy 28 (4). 2004.
    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 Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of this relation must be given in the form…Read more
  • Meaning and Partiality
    Dissertation, University of Amsterdam. 1989.
  •  96
    Program semantics and classical logic
    In CLAUS Report Nr 86, University of the Saarland. pp. 1-27. 1997).
    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 to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/}…Read more
  •  309
    Separating syntax and combinatorics in categorial grammar
    Research on Language and Computation 5 (3): 267-285. 2007.
    The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite…Read more
  •  378
    New directions in type-theoretic grammars
    Journal of Logic, Language and Information 19 (2): 129-136. 2010.
    This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation . It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a…Read more
  •  85
    Propositional Attitudes
    In R. E. Asher & J. M. Y. Simpson (eds.), The Encyclopedia of Language and Linguistics, Pergamon. 1993.
    Verbs such as know, believe, hope, fear, regret and desire are commonly taken to express an attitude that one may bear towards a proposition and are therefore called verbs of propositional attitude. Thus in (1) below the agent Cathy is reported to have a certain attitude
  •  321
    Talking about trees and truth-conditions
    Journal of Logic, Language and Information 10 (4): 417-455. 2001.
    We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical …Read more
  •  239
  •  251
    In this paper it is shown how a formal theory of interpretation in Montague’s style can be reconciled with a view on meaning as a social construct. We sketch a formal theory in which agents can have their own theory of interpretation and in which groups can have common theories of interpretation. Frege solved the problem how different persons can have access to the same proposition by placing the proposition in a Platonic realm, independent from all language users but accessible to all of them. …Read more
  •  48
    The dynamics of discourse situations (extended abstract)
    with Massimo Poesio
    In Paul Dekker, Martin Stokhof & Yde Venema (eds.), Proceedings of the Eleventh Amsterdam Colloquium, University of Amsterdam. pp. 247-252. 1997.
    The effects of utterances such as cue phrases, keep-turn markers, and grounding signals cannot be characterized as changes to a shared record of the propositions under discussed: the simplest (and arguably most natural) way of characterizing the meaning of these utterances is in terms of a theory in which the conversational score is seen as a record of the discourse situation, or at least of the speech acts that have been performed. The problem then becomes to explain how discourse entities are …Read more