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 (...) of ordinary language sentences consequently may be taken to be much less misleading than logicians in the first half of the 20th century often thought them to be. This was realized by Richard Montague, who used the theory of types to translate fragments of ordinary language into a logical language. Semantics is commonly divided into lexical semantics, which studies the meaning of words, and compositional semantics, which studies the way in which complex phrases obtain a meaning from their constituents. The strength of type-logical semantics lies with the latter, but type-logical theories can be combined with many competing hypotheses about lexical meaning, provided these hypotheses are expressed using the language of type theory. (shrink)

In this paper we give some formal examples of ideas developed by Penco in two papers on the tension inside Frege's notion of sense (see Penco 2003). The paper attempts to compose the tension between semantic and cognitive aspects of sense, through the idea of sense as proof or procedure – not as an alternative to the idea of sense as truth condition, but as complementary to it (as it happens sometimes in the old tradition of procedural semantics).

This paper argues that we should solve paradoxes for propositions (such as the Russell–Myhill paradox) in essentially the same way that we solve Russellian paradoxes for sets. That is, the standard, iterative approach to sets is extended to include properties, and then the resulting hierarchy of sets and properties is used to construct propositions. Propositions on this account are structured in the sense of mirroring the sentences that express them, and they would seem to serve the needs of philosophers of (...) language and metaphysicians who rely on such propositions. The resulting account has limitations, comparable to those faced by the iterative approach to sets, but it is argued to be in important ways preferable to others that have been proposed. (shrink)

In this paper, I address the problem wherein the same English word permits one of its complement positions to be satisfied by phrases of different categories. A well-known example of such an English word is the copula to be, whose complements include adjective phrases, noun phrases, prepositional phrases and adverbial phrases. I provide a way to treat such words, in particular verbs, as single lexical items through a conservative extension of the usual treatment of word classification as a pair comprising (...) a part of speech category and a complement list. I then show how a further conservative extension of complement lists permits a satisfactory formalization of doubly complemented English verbs which are synonymous under a permutation of their complements. These verbs include, but are not limited to, so-called double object constructions. (shrink)

In Attitude Problems, I gave an account of opacity in the complement of intensional transitive verbs that combined neo-Davidsonian event-semantics with a hidden-indexical account of substitution failure. In this paper, I extend the account to clausal verbs.

This article investigates the semantics of sentences that express numerical averages, focusing initially on cases such as 'The average American has 2.3 children'. Such sentences have been used both by linguists and philosophers to argue for a disjuncture between semantics and ontology. For example, Noam Chomsky and Norbert Hornstein have used them to provide evidence against the hypothesis that natural language semantics includes a reference relation holding between words and objects in the world, whereas metaphysicians such as Joseph Melia and (...) Stephen Yablo have used them to provide evidence that apparent singular reference need not be taken as ontologically committing. We develop a fully general and independently justified compositional semantics in which such constructions are assigned truth conditions that are not ontologically problematic, and show that our analysis is superior to all extant rivals. Our analysis provides evidence that a good semantics yields a sensible ontology. It also reveals that natural language contains genuine singular terms that refer to numbers. (shrink)

This paper presents a variable-free analysis of relational nouns in Glue Semantics, within a Lexical Functional Grammar (LFG) architecture. Relational nouns and resumptive pronouns are bound using the usual binding mechanisms of LFG. Special attention is paid to the bound readings of relational nouns, how these interact with genitives and obliques, and their behaviour with respect to scope, crossover and reconstruction. I consider a puzzle that arises regarding relational nouns and resumptive pronouns, given that relational nouns can have bound readings (...) and resumptive pronouns are just a specific instance of bound pronouns. The puzzle is why is it impossible for bound implicit arguments of relational nouns to be resumptive? The puzzle is highlighted by a well-known variety of variable-free semantics, where pronouns and relational noun phrases are identical both in category and (base) type. I show that the puzzle also arises for an established variable-based theory. I present an analysis of resumptive pronouns that crucially treats resumptives in terms of the resource logic linear logic that underlies Glue Semantics: a resumptive pronoun is a perfectly ordinary pronoun that constitutes a surplus resource; this surplus resource requires the presence of a resumptive-licensing resource consumer, a manager resource. Manager resources properly distinguish between resumptive pronouns and bound relational nouns based on differences between them at the level of semantic structure. The resumptive puzzle is thus solved. The paper closes by considering the solution in light of the hypothesis of direct compositionality. It is argued that a directly compositional version of the theory is possible, although perhaps not desirable. The implications for direct compositionality are considered. (shrink)

\ is a 7000 line Prolog parser/theorem-prover for logical categorial grammar. In such logical categorial grammar syntax is universal and grammar is reduced to logic: an expression is grammatical if and only if an associated logical statement is a theorem of a fixed calculus. Since the syntactic component is invariant, being the logic of the calculus, logical categorial grammar is purely lexicalist and a particular language model is defined by just a lexical dictionary. The foundational logic of continuity was established (...) by Lambek while a corresponding extension including also logic of discontinuity was established by Morrill and Valentín :167–192, 2010). \ implements a logic including as primitive connectives the continuous and discontinuous connectives of the displacement calculus, additives, 1st order quantifiers, normal modalities, bracket modalities, and universal and existential subexponentials. In this paper we review the rules of inference for these primitive connectives and their linguistic applications, and we survey the principles of Andreoli’s focusing, and of a generalisation of van Benthem’s count-invariance, on the basis of which \ is implemented. (shrink)

Nonindexical Context-Dependence and the Interpretation as Abduction Approach Inclusive nonindexical context-dependence occurs when the preferred interpretation of an utterance implies its lexically-derived meaning. It is argued that the corresponding processes of free or lexically mandated enrichment can be modeled as abductive inference. A form of abduction is implemented in Simple Type Theory on the basis of a notion of plausibility, which is in turn regarded a preference relation over possible worlds. Since a preordering of doxastic alternatives taken for itself only (...) amounts to a relatively vacuous ad hoc model, it needs to be combined with a rational way of learning from new evidence. Lexicographic upgrade is implemented as an example of how an agent might revise his plausibility ordering in light of new evidence. Various examples are given how this apparatus may be used to model the contextual resolution of context-dependent or semantically incomplete utterances. The described form of abduction is limited and merely serves as a proof of concept, but the idea in general has good potential as one among many ways to build a bridge between semantics and pragmatics since inclusive context-dependence is ubiquitous. (shrink)

This is a good book. Its main message is that a particular approach to natural language called type-logical grammar can, in-principle, be equipped with a learning theory. In this review, I first identify what type-logical grammar is, then outline what the learning theory is. Then I try to articulate why this message is important for the logical, linguistic and information-theoretic parts of cognitive science. Overall, I think the book’s main message is significant enough to warrant patience with its scientific limitations.

Many variants of categorial grammar assume an underlying logic which is associative and linear. In relation to left extraction, the former property is challenged by island domains, which involve nonassociativity, and the latter property is challenged by parasitic gaps, which involve nonlinearity. We present a version of type logical grammar including ‘structural inhibition’ for nonassociativity and ‘structural facilitation’ for nonlinearity and we give an account of relativisation including islands and parasitic gaps and their interaction.

We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a second-order operation in the case of linear context-free tree grammars, and as a third-order operation in the case of linear context-free rewriting systems. This (...) suggest the possibility of defining an Abstract Categorial Hierarchy. (shrink)

Individuals play a prominent role in many metaphysical theories. According to an individualistic metaphysics, reality is determined by the pattern of properties and relations that hold between individuals. A number of philosophers have recently brought to attention alternative views in which individuals do not play such a prominent role; in this paper I will investigate one of these alternatives.

I show that words with indefinite implicit complements occasion a dilemma for their model theory. There has been only two previous attempts to address this problem, one by Fodor and Fodor (1980) and one by Dowty (1981). Each requires that any word tolerating an implicit complement be treated as ambiguous between two different lexical entries and that a meaning postulate or lexical rule be given to constrain suitably the meanings of the various entries for the word. I show that the (...) positing of such an ambiguity runs counter to the facts and propose an alternative solution which does not appeal to ambiguity, meaning postulates or lexical rules. Indeed, I show that the dilemma posed by indefinite implicit complements is posed by all implicit complements and that a general solution to the problem of implicit complements follows from an independently motivated, single treatment of five other problems, that of subcategorization, that of phrasal projections of words, that of defining a model theoretic structure for phrase structure grammars, that of complement polyvalence and that of complement polyadicity. (shrink)

In this paper we present a logical system able to compute the semantics of both declarative and interrogative sentences. Our proposed analysis takes place at both the sentential and at the discourse level. We use syntactic inference on the sentential level for declarative sentences, while the discourse level comes into play for our treatment of questions. Our formalization uses a type logic sensitive to both the syntactic and semantic properties of natural language. We will show how an account of the (...) linguistic data follows naturally from the logical relations inherent in the type logic. (shrink)

This article proposes a new logical framework for NL quantification. The framework is based on Generalized Quantifiers, Skolem-like functional dependencies, and Maximality of the involved sets of entities. Among the readings available for NL sentences, those where two or more sets of entities are independent of one another are particularly challenging. In the literature, examples of those readings are known as Collective and Cumulative readings. This article briefly analyzes previous approaches to Cumulativity and Collectivity, and indicates (Schwarzschild in Pluralities. Kluwer, (...) Dordrecht, 1996) as the best proposal so far to deal with these readings. Then, it incorporates its insights in the logical framework defined in Robaldo (J Philos Log 39(1):23–58, 2009a), leading to a scalable logical account for NL quantification. (shrink)

We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill’s calculi, and focus on their fragments including multiplicative (Lambek) connectives, additive conjunction and disjunction, brackets and bracket modalities, and the! subexponential modality. For both systems, we resolve issues connected with the cut rule and provide necessary modifications, after which we prove admissibility of cut (cut elimination theorem). We also prove (...) algorithmic undecidability for both calculi, and show that categorial grammars based on them can generate arbitrary recursively enumerable languages. (shrink)

Since 1970-ties in the theory of syntax of natural language quite a number of competing, incommensurable theoretic frameworks have emerged. Today the lack of a leading paradigm and kaleidoscope of perspectives deprives our general understanding of syntax and its relation to semantics and pragmatics. The present book is an attempt to reestablish the most fundamental ideas and intuitions of syntactic well-formedness within a new general account. The account is not supposed to compete with any of today’s syntactic frameworks, but to (...) provide a deeper understanding of why these frameworks succeed or fail when they do and to show a new way for cooperation between logicians and linguists which may lead in future to a unified, yet more specific account. (shrink)

Categorial grammar is well-known for its elegant analysis of coordination enabled by the flexible notion of constituency it entertains. However, to date, no systematic study exists that examines whether this analysis has any obvious empirical advantage over alternative analyses of nonconstituent coordination available in phrase structure-based theories of syntax. This paper attempts precisely such a comparison. We compare the direct constituent coordination analysis of non-canonical coordinations in categorial grammar with an ellipsis-based analysis of the same phenomena in the recent HPSG (...) literature. We provide a set of empirical evidence, consisting of cases in which non-canonical coordinations interact with scopal operators of various sorts, which systematically falsifies the predictions of the latter, ‘linearization-based’ ellipsis approach to coordination. We propose an alternative analysis in a variant of categorial grammar called Hybrid Type-Logical Categorial Grammar. The proposed framework builds on both the Lambek-inspired variants of categorial grammar and a more recent line of work modelling word order via a lambda calculus for the prosodic component. The flexible syntax–semantics interface of this framework straightforwardly captures the interactions between non-canonical coordinations and scopal expressions, demonstrating the broader empirical payoff of the direct constituent coordination analysis of non-canonical coordinations pioneered by Steedman :523–568, 1985; Linguist Philos 13:207–263, 1990) and Dowty hitherto not explicitly recognized in the literature. (shrink)

We study straightforward embeddings of propositional normal multimodal logic and propositional intuitionistic logic in simple type theory. The correctness of these embeddings is easily shown. We give examples to demonstrate that these embeddings provide an effective framework for computational investigations of various non-classical logics. We report some experiments using the higher-order automated theorem prover LEO-II.

A central tenet of cognitivism is that knowing how is to be explained in terms of tacitly knowing that a theory is true. By critically examining canonical anti-behaviorist arguments and contemporary appeals to tacit knowledge, I have devised a more explicit characterization in which tacitly known theories must act as justifiers for claims that the tacit knower is capable of explicitly endorsing. In this manner the new account is specifically tied to verbal behavior. In addition, if the analysis is correct (...) then it follows that the scope and nature of cognitivist appeals to tacit knowledge are largely mistaken. (shrink)

Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of the proposal (...) made in Sher (J Philos Logic 26:1–43, 1997 ) in order to properly represent the meaning of IS readings involving NL quantifiers. The solution proposed here allows to uniformly deal with both standard linear and IS readings, regardless of their actual existence in NL or quantifiers’ monotonicity. Sentences featuring nested quantifications are particularly problematic. By avoiding parallel nested quantification in the formulae, the proper true values are achieved. (shrink)