REFERENCES Barwise, J. & R. Cooper (1981) — 'Generalized Quantifiers and Natural Language', Linguistics and Philosophy 4:2159-219. Van Benthem, J. (1983a) — ' Five Easy Pieces', in Ter Meulen (ed.), 1-17. Van Benthem, J. (1983b) ...

This paper has two parts. In part I, I review two older accounts of the logical forms of modifiers, and suggest that they may be combined with each other so as to yield a theory that is better than either of its parts taken singly. Part of this theory involves the idea that certain sentences refer to events, states, or processes; Part II of this paper shows how to use this idea to account for tenses and temporal adverbials, and offers (...) a new account of ordinary language quantification. (shrink)

This paper has two parts. In part I, I review two older accounts of the logical forms of modifiers, and suggest that they may be combined with each other so as to yield a theory that is better than either of its parts taken singly. Part of this theory involves the idea that certain sentences refer to events, states, or processes; Part II of this paper shows how to use this idea to account for tenses and temporal adverbials, and offers (...) a new account of ordinary language quantification. (shrink)

This work presents the structure, distribution and semantic interpretation of quantificational expressions in languages from diverse language families and typological profiles. The current volume pays special attention to underrepresented languages of different status and endangerment level. Languages covered include American and Russian Sign Languages, and sixteen spoken languages from Africa, Australia, Papua, the Americas, and different parts of Asia. The articles respond to a questionnaire the editors constructed to enable detailed crosslinguistic comparison of numerous features. They offer comparable information (...) on semantic classes of quantifiers (generalized existential, generalized universal, proportional, partitive), syntactically complex quantifiers (intensive modification, Boolean compounds, exception phrases, et cetera), and several more specific issues such as quantifier scope ambiguities, floating quantifiers, and binary (type 2) quantifiers. The book is intended for semanticists, logicians interested in quantification in natural language, and general linguists as articles are meant to be descriptive and theory independent. The book continues and expands the coverage of the Handbook of Quantifiers in Natural Language (2012) by the same editors, and extends the earlier work in Matthewson (2008), Gil and others (2013) and Bach et al (1995). (shrink)

One of the interesting problems in the theory of language is the problem of describing and explaining the mechanisms responsible for our ability to understand sentences. A description of the mechanism of linguistic competence, which we can refer to as semantic competence, is necessary for understanding the phenomenon of language. For to use a language is not only to use a certain vocabulary and grammatical rules, but most of all to associate certain meanings with certain expressions. For (...) example, when I say rana, it is the intended meaning that decides whether I use the Polish or the Latin language — i.e. whether what I had in mind was a frog or a wound. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed (...) in polynomial time. Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use (...) computational complexity results to investigate semantic distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

Recent work on compositional distributional models shows that bialgebras over finite dimensional vector spaces can be applied to treat generalised quantifiersGeneralised quantifiers for natural language. That technique requires one to construct the vector space over powersets, and therefore is computationally costly. In this paper, we overcome this problem by considering fuzzy versions of quantifiers along the lines of ZadehZadeh, L. A., within the category of many valued relationsMany valued relations. We show that this category is a (...) concrete instantiation of the compositional distributional model. We show that the semantics obtained in this model is equivalent to the semantics of the fuzzy quantifiers of ZadehZadeh, L. A.. As a result, we are now able to treat fuzzy quantification without requiring a powerset construction. (shrink)

Situation semantics was developed as an alternative to possible worlds semantics. In situation semantics, linguistic expressions are evaluated with respect to partial, rather than complete, worlds. There is no consensus about what situations are, just as there is no consensus about what possible worlds or events are. According to some, situations are structured entities consisting of relations and individuals standing in those relations. According to others, situations are particulars. In spite of unresolved foundational issues, the partiality provided by situation semantics (...) has led to some genuinely new approaches to a variety of phenomena in natural language semantics. In the way of illustration, this article includes relatively detailed overviews of a few selected areas where situation semantics has been successful: implicit quantifier domain restrictions, donkey pronouns, and exhaustive interpretations. It moreover addresses the question of how Davidsonian event semantics can be embedded in a semantics based on situations. Other areas where a situation semantics perspective has led to progress include attitude ascriptions, questions, tense, aspect, nominalizations, implicit arguments, point of view, counterfactual conditionals, and discourse relations. (shrink)

This paper presents an extensional account of manyand few that explains data that have previously motivated intensional analyses of these quantifiers :599–620, 2000). The key insight is that their semantic arguments are themselves set intersections: the restrictor is the intersection of the predicates denoted by the N’ or the V’ and the restricted universe, U, and the scope is the intersection of the N’ and V’. Following Cohen, I assume that the universe consists of the union of alternatives to (...) the nominal and verbal predicates, where an alternative to a property ψ is one that shares a pragmatic presupposition with ψ, and a pragmatic presupposition is one that is selected by context from a set of potential presuppositions associated with the sentence. A many/few-quantified sentence is then true iff the proportion of the scope to the restrictor is greater/less than some threshold, n. In addition to explaining various problematic cases from the literature, the analysis shows how the readings of a many/few-quantified sentence can be derived from the same syntactico-semantic structure, it being unnecessary to claim lexical or structural ambiguity. The analysis also provides strong support for the idea that natural language quantification is always purely extensional. (shrink)

Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and (...) q1x 1⋯ qnx nRx 1⋯ xn are logically equivalent for arbitrary generalized quantifiers Qi, qi. GPT generalizes, perhaps in an unexpectedly strong form, the Linear Prefix Theorem (appropriately modified) of Keisler & Walkoe (1973). (shrink)

In game-theoretical semantics, perfectlyclassical rules yield a strong negation thatviolates tertium non datur when informationalindependence is allowed. Contradictorynegation can be introduced only by a metalogicalstipulation, not by game rules. Accordingly, it mayoccur (without further stipulations) onlysentence-initially. The resulting logic (extendedindependence-friendly logic) explains several regularitiesin natural languages, e.g., why contradictory negation is abarrier to anaphase. In natural language, contradictory negationsometimes occurs nevertheless witin the scope of aquantifier. Such sentences require a secondary interpretationresembling the so-called substitutionalinterpretation of quantifiers.This (...) interpretation is sometimes impossible,and it means a step beyond thenormal first-order semantics, not an alternative to it. (shrink)

This text offers an innovative approach to the teaching of logic, which is rigorous but entirely non-symbolic. By introducing students to deductive inferences in natural language, the book breaks new ground pedagogically. Cannon focuses on such topics as using a tableaux technique to assess inconsistency; using generative grammar; employing logical analyses of sentences; and dealing with quantifier expressions and syllogisms. An appendix covers truth-functional logic.

One of the challenges confronted by language learners is to master the interpretation of sentences with multiple logical operators, where different interpretations depend on different scope assignments. Five-year-old children have been found to access some readings of potentially ambiguous sentences much less than adults do :73–102, 2006; Musolino, Universal Grammar and the acquisition of semantic knowledge, 1998; Musolino and Lidz, Lang Acquis 11:277–291, 2003, among many others). Recently, Gualmini et al. have shown that, by careful contextual manipulation, it is (...) possible to evoke some of the putatively unavailable interpretations from young children. Their proposal is quite general, but the focus of their work was on sentences involving nominal quantifiers and negation. The present paper extends this investigation to sentences with modal expressions. The results of our two experimental studies reveal that, in potentially ambiguous sentences with modal expressions, the kinds of contextual manipulations introduced by Gualmini and colleagues do not suffice to explain children’s initial scope interpretations. In response to the recalcitrant data, we propose a new three-stage model of the acquisition of scope relations. Most importantly, at the initial stage, child grammars make available only one interpretation of negative sentences with modal expressions. We call this the Unique Scope Assignment stage. (shrink)

Inspired by the grammar of natural language, the paper presents a variant of first-order logic, in which quantifiers are not sentential operators, but are used as subnectors . A quantified term formed by a subnector is an argument of a predicate. The logic is defined by means of a meaning-conferring natural-deduction proof-system, according to the proof-theoretic semantics program. The harmony of the I/E-rules is shown. The paper then presents a translation, called the Frege translation, from the (...) defined logic to standard first-order logic, and shows that the proof-theoretic meanings of both logics coincide. The paper criticizes Frege’s original regimentation of quantified sentences of natural language, and argues for advantages of the proposed variant. (shrink)

The semantic rules governing natural language quantifiers (e.g. "all," "some," "most") neither coincide with nor resemble the semantic rules governing the analogues of those expressions that occur in the artificial languages used by semanticists. Some semanticists, e.g. Peter Strawson, have put forth data-consistent hypotheses as to the identities of the semantic rules governing some natural-language quantifiers. But, despite their obvious merits, those hypotheses have been universally rejected. In this paper, it is shown that those (...) hypotheses are indeed correct. Moreover, data-consistent hypotheses are put forth as to the identities of the semantic rules governing the words "most" and "many," the semantic rules governing which semanticists have thus far been unable to identify. The points made in this paper are anticipated in a paper, published in the same issue of the Journal of Pragmatics, by Andrzej Boguslawski. (shrink)

In this paper we propose a way to deal with natural language inference by implementing Modern Type Theoretical Semantics in the proof assistant Coq. The paper is a first attempt to deal with NLI and natural language reasoning in general by using the proof assistant technology. Valid NLIs are treated as theorems and as such the adequacy of our account is tested by trying to prove them. We use Luo’s Modern Type Theory with coercive subtyping as (...) the formal language into which we translate natural language semantics, and we further implement these semantics in the Coq proof assistant. It is shown that the use of a MTT with an adequate subtyping mechanism can give us a number of promising results as regards NLI. Specifically, it is shown that a number of inference cases, i.e. quantifiers, adjectives, conjoined noun phrases and temporal reference among other things can be successfully dealt with. It is then shown, that even though Coq is an interactive and not an automated theorem prover, automation of all of the test examples is possible by introducing user-defined automated tactics. Lastly, the paper offers a number of innovative approaches to NL phenomena like adjectives, collective predication, comparatives and factive verbs among other things, contributing in this respect to the theoretical study of formal semantics using MTTs. (shrink)

This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. The main result (...) of the article is that fragments of the labelled calculi not exploiting reductio ad absurdum enjoy the Church–Rosser property and the strong normalization property; such result is obtained by combining Girard’s method of reducibility candidates and labelled languages of lambda calculus codifying the structure of modal proofs. (shrink)

The article presents a critical semantic analysis of the so-called analytical truths as they were discussed by R. Carnap and building on some new empirical data that are not fully satisfactorily explained by Carnap’s theory. A theoretical reconstruction of Carnap’s theory of analytical truths is proposed. It is demonstrated how his understanding of analytical truths, as statements that are true in all possible worlds and amenable to a quite obvious definition on a par with the concepts of sense (meaning) and (...) synonymy, applies exclusively to artificial languages of logic. Therefore, Carnap’s theory remains unreachable for the well-known criticism of W. Quine, who, in turn, pointed out the difficulties in defining these concepts for natural languages. A theoretical reconstruction of Carnap’s explication of the mentioned concepts in the theory of meaning for natural languages is carried out. The connection of Carnap’s approach with the perspective of contemporary formal semantics is established. Subsequently, problematic cases and the difficulties they pose for Carnap’s concept are examined. An explanation is proposed for analytical truths as containing in their logical form an (unpronounced) quantifier over possible worlds (situations). (shrink)

We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties - here called CE quantifiers - one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for (...) such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. (shrink)

We discuss McMillan et al. (2005) paper devoted to study brain activity during comprehension of sentences with generalized quantifiers. According to the authors their results verify a particular computational model of natural language quantifier comprehension posited by several linguists and logicians (e. g. see van Benthem, 1986). We challenge this statement by invoking the computational difference between first-order quantifiers and divisibility quantifiers (e. g. see Mostowski, 1998). Moreover, we suggest other studies on quantifier comprehension, which (...) can throw more light on the role of working memory in processing quantifiers. (shrink)

We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for natural language processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in natural language in two ways: the structure of representations mirrors the structure of the language and allows (...) re-use phenomena such as pronouns and ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of natural language sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for natural language processing tasks is illustrated. (shrink)

An -ever free relative is felicitous only when the speaker doesn’t know, or doesn’t care about, the identity of the entity denoted. In this paper we investigate what it means to identify an entity by examining the non-identification condition on -ever free relatives. Following Dayal (In A. Lawson (Ed.), Proceedings of SALT VII, 1997 ), we analyze -ever free relatives as definites with a modal dimension. We show that the variation in the identity of the entity across the possible worlds (...) in the modal dimension cannot be captured in a model where transworld identity is expressed using a single trivial principle of identity, and present an analysis within a model where transworld identity is relativized to noun meanings, which has been proposed in the philosophical literature for other reasons (Geach 1968 ; Gupta, The logic of common nouns: an investigation in quantified modal logic, 1980 ). The analysis thus shows that natural language semantics is sensitive to relative identity in the sense of Geach and Gupta; furthermore, it sets the stage for a new typology of referring expressions based on which expression types contribute principles of transworld identity. (shrink)

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a compositional (...) analysis of the de dicto - de re ambiguity in natural language. It will be argued that Independence Friendly logic is suitable, whereas Dependence Logic is not. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we (...) focus on those aspects of QLL we judge to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, The Logical Conception of Quantifiers and Quantification with an introductory section Quantification . II, Quantifiers of Natural Language , the most extensive section in the book and of the most direct interest to linguists. III, Beginnings of a Theory of Expressiveness, Translation, and Formalization introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

If a trademark becomes a generic term, it may be cancelled under trademark law, a process known as genericide. Typically, in genericide cases, consumer surveys are brought into evidence to establish a mark’s semantic status as generic or distinctive. Some drawbacks of surveys are cost, delay, small sample size, lack of reproducibility, and observer bias. Today, however, much discourse involving marks is online. As a potential complement to consumer surveys, therefore, we explore an artificial intelligence approach based chiefly on word (...) embeddings: mathematical models of meaning based on distributional semantics that can be trained on texts selected for jurisdictional and temporal relevance. After identifying two main factors in mark genericness, we first offer a simple screening metric based on the ngram frequency of uncapitalized variants of a mark. We then add two word embedding metrics: one addressing contextual similarity of uncapitalized variants, and one comparing the neighborhood density of marks and known generic terms in a category. For clarity and validation, we illustrate our metrics with examples of genericized, somewhat generic, and distinctive marks such as, respectively, DUMPSTER, DOBRO, and ROLEX. (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)

Plural Logic is an extension of First-Order Logic which has, as well as singular terms and quantifiers, their plural counterparts. Analogously, Higher-Level Plural Logic is an extension of Plural Logic which has, as well as plural terms and quantifiers, higher-level plural ones. Roughly speaking, higher-level plurals stand to plurals like plurals stand to singulars; they are pluralised plurals. Allegedly, Higher-Level Plural Logic enjoys the expressive power of a simple type theory while committing us to nothing more than the (...) austere ontology of First-Order Logic. Were this true, Higher-Level Plural Logic would be a useful tool, with various applications in philosophy and linguistics. However, while the notions of plural reference and quantification enjoy widespread acceptance today, their higher-level counterparts have been received with a lot of scepticism. In this paper, I argue for the legitimacy of Higher-Level Plural Logic by providing evidence to the effect that natural languages contain higher-level plural expressions and showing that it is likely that they do so in an indispensable manner. Since the arguments I put forward are of the same sort advocates of Plural Logic have employed to defend their position, I conclude that the commonly held view that Plural Logic is legitimate, but not so its higher-level plural extensions is untenable. (shrink)

The sentence Irving was closer to me than he was to most of the others contains a quantifier, most of the other, in the scope a comparative. The first part of this paper explains the challenges presented by such cases to existing approaches to the semantics of the comparative. The second part presents a new analysis of comparatives based on intervals rather than points on a scale. This innovation is analogized to the move from moments to intervals in tense semantics. (...) The remainder of the paper is concerned with an interval-based semantics of degree in relation to issues other than the comparative proper. The paper begins with a discussion of the role negative polarity has played in studies on the semantics of comparatives. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we (...) focus on those aspects of QLL we judge to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, "The Logical Conception of Quantifiers and Quantification" with an introductory section "Quantification". II, "Quantifiers of Natural Language", the most extensive section in the book and of the most direct interest to linguists. III, "Beginnings of a Theory of Expressiveness, Translation, and Formalization" introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

Quantified expressions in natural language generally are taken to act like quantifiers in logic, which either range over entities that need to satisfy or not satisfy the predicate in order for the sentence to be true or otherwise are substitutional quantifiers. I will argue that there is a philosophically rather important class of quantified expressions in English that act quite differently, a class that includes something, nothing, and several things. In addition to expressing quantification, such expressions (...) act like nominalizations, introducing a new domain of objects that would not have been present in the semantic structure of the sentence otherwise. The entities those expressions introduce are of just the same sort as those that certain ordinary nominalizations refer to (such as John's wisdom or John's belief that S), namely they are tropes or entities related to tropes. Analysing certain quantifiers as nominalizing quantifiers will shed a new light on philosophical issues such as the status of properties and the nature of propositional attitudes. (shrink)

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. (shrink)

The formalisation of Natural Language arguments in a formal language close to it in syntax has been a central aim of Moss’s Natural Logic. I examine how the Quantified Argument Calculus (Quarc) can handle the inferences Moss has considered. I show that they can be incorporated in existing versions of Quarc or in straightforward extensions of it, all within sound and complete systems. Moreover, Quarc is closer in some respects to Natural Language than are (...) Moss’s systems – for instance, is does not use negative nouns. The process also sheds light on formal properties and presuppositions of some inferences it formalises. Directions for future work are outlined. (shrink)

This paper gives an overview of the common approach to quantification and generalised quantification in formal linguistics and philosophy of language. We point out how this usual general framework represents a departure from empirical linguistic data. We briefly sketch a different idea for proof theory which is closer to the language itself than standard approaches in many aspects. We stress the importance of Hilbert’s operators—the epsilon-operator for existential and tau-operator for universal quantifications. Indeed, these operators are helpful in (...) the construction of a semantic representation which is close to natural language in particular with quantified noun phrases as individual terms. We also define guidelines for the design of proof rules corresponding to generalized quantifiers. (shrink)

We develop a framework for natural language semantics which handles intensionality via metalogical constructions and deals with degree truth values in an integrated way. We take an axiomatic set theory, ZF, as the foundation for semantic representations, but we make ZF a metalanguage for part of itself by embedding a language ℒ within ZF which is basically a copy of the part of ZF consisting of set expressions. This metalogical set-up is used for handling propositional attitude verbs (...) (limited to believe in this paper). We define a truth function τ which determines the truth value τ(p, T) of an ℒ-proposition p with respect to a theory T. Theories are sets of ℒ-propositions with associated truth values, and can be viewed as a (much more well-defined) replacement for possible worlds. We develop a mechanism for defining belief worlds as theories. We simultaneously develop two different versions of our system - a Boolean version where the set Ω of truth values is {0, 1}, and a degree-truth version where Ω is the interval [0, 1] of real numbers. We use degrees of truth in handling a broad class of semantic predicates that we call base-focus predicates, which include generalized quantifiers as well as many adverb and adjective senses and certain discourse-level predicates. (shrink)

The problem of computational complexity of semantics for some natural language constructions – considered in [M. Mostowski, D. Wojtyniak 2004] – motivates an interest in complexity of Ramsey quantifiers in finite models. In general a sentence with a Ramsey quantifier R of the following form Rx, yH(x, y) is interpreted as ∃A(A is big relatively to the universe ∧A2 ⊆ H). In the paper cited the problem of the complexity of the Hintikka sentence is reduced to the (...) problem of computational complexity of the Ramsey quantifier for which the phrase “A is big relatively to the universe” is interpreted as containing at least one representative of each equivalence class, for some given equvalence relation. In this work we consider quantifiers Rf, for which “A is big relatively to the universe” means “card(A) > f (n), where n is the size of the universe”. Following [Blass, Gurevich 1986] we call R mighty if Rx, yH(x, y) defines N P – complete class of finite models. Similarly we say that Rf is N P –hard if the corresponding class is N P –hard. We prove the following theorems. (shrink)

This paper gives an overview of the common approach to quantification and generalised quantification in formal linguistics and philosophy of language. We point out how this usual general framework represents a departure from empirical linguistic data. We briefly sketch a different idea for proof theory which is closer to the language itself than standard approaches in many aspects. We stress the importance of Hilbert’s operators—the epsilon-operator for existential and tau-operator for universal quantifications. Indeed, these operators are helpful in (...) the construction of a semantic representation which is close to natural language in particular with quantified noun phrases as individual terms. We also define guidelines for the design of proof rules corresponding to generalized quantifiers. (shrink)