the present author, have offered different but related accounts of intonation structure in English and some other languages. These accounts share the assumption that the system of tones identified by Pierrehumbert (1980), as modified by Pierrehumbert and Beckman (1988) and Silverman et al. (1992), has as transparent and type-driven a semantics in these languages as do their words and phrases. While the semantics of intonation in English concerns information structure and propositional attitude, rather than the predicate-argument relations and operator-scope relations that are familiar from standard semantics in the spirit of the papers collected as Montague 1974, this information-structural semantics is fully compositional, and can be regarded as a component of the same semantic system. The present paper builds on Steedman (1991) and Steedman (2000a) to develop a new semantics for intonation structure, which shares with the earlier versions the property of being fully integrated into Combinatory Categorial Grammar (CCG, see Steedman 2000b, hereafter SP). This grammar integrates intonation structure into surface derivational structure and the associated Montague-style compositional semantics, even when the intonation structure departs from the restrictions of traditional surface structure. Many of the diverse discourse meanings that have been attributed to intonational tunes are shown to arise via conversational implicature from more primitive literal meanings distinguished along the three dimensions of information structure, speaker/hearer commitment, and contentiousness.

One elegant and linguistically powerful guideline for a semantic theory of coordination will be referred to here as the Boolean assumption. According to this assumption conjunctive coordinators like and are described using the cross-categorial Boolean operator of Generalized Conjunction (GC). Symmetrically, disjunctive coordinators

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 of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. 1

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin’s general models and have a natural definition. As a class they do not validate the axiom of Extensionality. We give a cut-free sequent calculus for type theory and show completeness of this calculus with respect to the class of intensional models via a model existence theorem. After this we turn our attention to applications. Firstly, it is argued that, since ITL is truly intensional, it can be used to model ascriptions of propositional attitude without predicting logical omniscience. In order to illustrate this a small fragment of English is defined and provided with an ITL semantics. Secondly, it is shown that ITL models contain certain objects that can be identified with possible worlds. Essential elements of modal logic become available within classical type theory once the axiom of Extensionality is given up. 1

In this paper we bring together some well-known lines of criticism directed at Montague Grammar, such as (i) taking a stilted, highly regulated variety of language as the object of inquiry; (ii) ignoring the meaning of content words; and (iii) the failure to treat hyperintensionals; and suggest a coherent, and we believe much simpler, alternative based on structured meanings.

Abstract not found

dicto and de re

ion : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 12 2.3 Quantification : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 15 2.4 Propositions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 20 2.5 Predication : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 23 2.6 Connectives : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 25 2.6.1 Negation : : : : : : : : : : : : : : : : : : : : : : : : : : : 26 2.6.2 Conjunction and disjunction : : : : : : : : : : : : : : : : 26 2.6.3 Implication : : : : : : : : : : : : : : : : : : : : : : : : : : 27 2.6.4 Other connectives : : : : : : : : : : : : : : : : : : : : : : 28 2.7 Variables : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 28 2.7.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : 28 2.7.2 Variables and Anaphora : : : : : : : : : : : : : : : : : : : 28 2.7.3 Representational Issues : : : : : : : : : : : : : : : : : : : 30 3 Some Basic Linguistic Data and Thei...

Abstract. The notion of the logical form of an expression E is shown to be a semantic notion that can be derived from the notion of the structured meaning of E. This simple idea can be traced to categorial grammars, and it is implicitly used by Richard Montague. We argue that a most fine-grained tool for defining structured meaning can be found in Pavel Tichý’s Transparent Intensional Logic (TIL). Structured meanings of expressions are identified with abstract procedures, known as TIL constructions, expressed by the expressions. We construe concepts as closed constructions, and present a method of seeking the best semantic analysis (identical to the structured meaning) of a given expression. The method terminates in a complete lattice over the set of possible analyses; which analysis is the best one must, however, be relativized to a conceptual system. This relativization concerns primitive concepts of the conceptual system within which the semantic analysis is set. Our main thesis is: Every well-formed expression E of the language under analysis can be associated with a logical form that is unambiguously derived from the structured meaning of E. 1 The problem of adequate explication

ing from the nature of the states involved, we can specify the change that an atomic program a effects by means of a two place transition relation R a on a set of states. This perspective gives rise to the study of so-called transition systems. The most general style of reasoning about programs and transition system is found in propositional dynamic logics (Pratt [ Pratt, 1976 ] [ Pratt, 1980 ] , Harel [ Harel, 1984 ] ) and in algebras of processes (Hennessy [ Hennessy, 1988 ] ). Processes and transition systems are studied from the perspective of modal logic in Stirling [ Stirling, 1987 ] and Van Benthem and Bergstra [ Benthem and Bergstra, 1993 ] . Dynamic semantics can be put to use to stipulate relational denotations for propositions. In this perspective, a state of information is a set of possible worlds, and a program updates a state of information by removing the worlds incompatible with the new information. Thus, the semantics of language is defined in terms of its potential to...