Chris Fox

The second edition of The Handbook of Contemporary Semantic Theory presents a comprehensive introduction to cutting-edge research in contemporary theoretical and computational semantics. Features completely new content from the first edition of The Handbook of Contemporary Semantic Theory Features contributions by leading semanticists, who introduce core areas of contemporary semantic research, while discussing current research Suitable for graduate students for courses in semantic theory and for advanced researchers as an introduction to current theoretical work.

A BSTRACT. We present Property Theory with Curry Typing, an intensional first-order logic for natural language semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types.1 We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like most. We use the type system and our treatment of generalized quantifiers in natural language to construct a typetheoretic approach to pronominal anaphora that avoids some of the difficulties that undermine previous type-theoretic analyses of this phenomenon

This paper proposes a framework for formalising intuitions about the behaviour of imperative commands. It seeks to capture notions of satisfaction and coherence. Rules are proposed to express key aspects of the general logical behaviour of imperative constructions. A key objective is for the framework to allow patterns of behaviour to be described while avoiding making any commitments about how commands, and their satisfaction criteria, are to be interpreted. We consider the status of some conundrums of imperative logic in the context of this proposal

The tension between expressive power and computational tractability poses an acute problem for theories of underspecified semantic representation. In previous work we have presented an account of underspecified scope representations within Property Theory with Curry Typing, an intensional first-order theory for natural language semantics. Here we show how filters applied to the underspecified-scope terms of PTCT permit both expressive completeness and the reduction of computational complexity in a significant class of non-worst case scenarios

We present Property Theory with Curry Typing (PTCT), an intensional first-order logic for natural language semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types. We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like “most.” We use the type system and our treatment of generalized quantifiers in natural language to construct a type-theoretic approach to pronominal anaphora that avoids some of the difficulties that undermine previous type-theoretic analyses of this phenomenon

The paper presents Property Theory with Curry Typing where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that implement the theory. Some extensions to the type theory are discussed, including type polymorphism, which provides a useful analysis of conjunctive terms. Such terms can be given a single polymorphic type that expresses the fact that they can conjoin phrases of any one type, yielding an expression of the same type

We may wonder about the status of logical accounts of the meaning of language. When does a particular proposal count as a theory? How do we judge a theory to be correct? What criteria can we use to decide whether one theory is “better” than another? Implicitly, many accounts attribute a foundational status to set theory, and set-theoretic characterisations of possible worlds in particular. The goal of a semantic theory is then to find a translation of the phenomena of interest into a set-theoretic model. Such theories may be deemed to have “explanatory” or “predictive” power if a mapping can found into expressions of set-theory that have the appropriate behaviour by virtue of the rules of set-theory (for example Montague 1973; Montague1974). This can be contrasted with an approach in which we can help ourselves to “new” primitives and ontological categories, and devise logical rules and axioms that capture the appropriate inferential behaviour (as in Turner 1992). In general, this alternative approach can be criticised as being mere “descriptivism”, lacking predictive or explanatory power. Here we will seek to defend the axiomatic approach. Any formal account must assume some normative interpretation, but there is a sense in which such theories can provide a more honest characterisation (cf. Dummett 199). In contrast, the set-theoretic approach tends to conflate distinct ontological notions. Mapping a pattern of semantic behaviour into some pre-existing set-theoretic behaviour may lead to certain aspects of that behaviour being overlooked, or ignored (Chierchia & Turner 1988; Bealer 1982). Arguments about the explanatory and predictive power of set-theoretic interpretations can also be questioned (see Benacerraf 1965, for example). We aim to provide alternative notions for evaluating the quality of a formalisation, and the role of formal theory. Ultimately, claims about the methodological and conceptual inadequacies of axiomatic accounts compared to set-theoretic reductions must rely on criteria and assumptions that lie outside the domain of formal semantics as such.

In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and computational tractability poses an acute problem for any such theory. Generating the full set of resolved scope readings from an underspecified representation produces a combinatorial explosion that undermines the efficiency of these representations. Moreover, Ebert (2005) shows that most current theories of underspecified semantic representation suffer from expressive incompleteness. In previous work we present an account of underspecified scope representations within Property Theory with Curry Typing (PTCT), an intensional first-order theory for natural language semantics. We review this account, and we show that filters applied to the underspecified-scope terms of PTCT permit expressive completeness. While they do not solve the general complexity problem, they do significantly reduce the search space for computing the full set of resolved scope readings in non-worst cases. We explore the role of filters in achieving expressive completeness, and their relationship to the complexity involved in producing full interpretations from underspecified representations. This paper is dedicated to Jim Lambek

We formulate a Curry-typed logic with fine-grained intensionality within Turner’s typed predicate logic. This allows for an elegant presentation of a theory that corresponds to Fox and Lappin’s property theory with curry typing, but without the need for a federation of languages. We then consider how the fine-grained intensionality of this theory can be given an operational interpretation. This interpretation suggests itself as expressions in the theory can be viewed as terms in the untyped lambda-calculus, which provides a model of computation

Intensional logic (IL) and its application to natural language, which the present monograph addresses, was first developed by Richard Montague in the late 1960s (e.g., Montague 1970a, 1970b). Through the efforts of (especially) Barbara Partee (e.g., Partee 1975, 1976), and Richmond Thomason, who edited the posthumous collection of Montague’s works (Thomason 1974), this became the main framework for those who aspired to a formal semantic theory for natural language, and these included computational linguists as early as Jerry Hobbs in the late 1970s (e.g., Hobbs and Rosenschein 1977). In fact, until the advent of the current interest in statistical linguistics with its own conception of what semantics is, IL, or some variant of it, was perhaps the main theory of semantics within computational linguistics generally. And within current computational semantics it still is. But over the years, philosophers, linguists, and computational linguists have noted a variety of shortcomings in Montague’s version of IL. Montague defined intensions as functions from possible worlds to extensions in that world. But this had the effect of making logically equivalent expressions have the same intension, thus leading to the problem of “logical omniscience” (believing/knowing all the logical consequences of what is believed/known). Montague had based his IL on Church’s simple theory of types (Church 1940), supplemented with intensions of each type. But this implies that each natural language item accepts only arguments of some one fixed type. However, this is not true for natural language, where conjunctions, verbs, and pretty much any functional term that accepts arguments at all can accept arguments of different types. (For example, and can accept arguments that are of the sentence type, of the verb phrase type, of the adjective type, etc.; and indeed, it can accept arguments of differing types in its different argument..

This book provides a systematic study of three foundational issues in the semantics of natural language that have been relatively neglected in the past few decades. focuses on the formal characterization of intensions, the nature of an adequate type system for natural language semantics, and the formal power of the semantic representation language proposes a theory that offers a promising framework for developing a computational semantic system sufficiently expressive to capture the properties of natural language meaning while remaining computationally tractable written by two leading researchers and of interest to students and researchers in formal semantics, computational linguistics, logic, artificial intelligence, and the philosophy of language.

In previous work we have developed Property Theory with Curry Typing (PTCT), an intensional first-order logic for natural language semantics. PTCT permits fine-grained specifications of meaning. It also supports polymorphic types and separation types. We develop an intensional number theory within PTCT in order to represent proportional generalized quantifiers like "most", and we suggest a dynamic type-theoretic approach to anaphora and ellipsis resolution. Here we extend the type system to include product types, and use these to define a permutation function that generates underspecified scope representations within PTCT. We indicate how filters can be added to encode constraints on possible scope readings. Our account offers several important advantages over other current theories of underspecification