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)

The paper deals with the problem of logical adequacy of language knowledge with cognition of reality. A logical explication of the concept of language knowledge conceived of as a kind of codified knowledge is taken into account in the paper. Formal considerations regarding the notions of meta-knowledge (logical knowledge about language knowledge) and truth are developed in the spirit of some ideas presented in the author’s earlier papers (1991, 1998, 2001a,b, 2007a,b,c) treating about the notions of meaning, denotation and truthfulness (...) of well-formed expressions (wfes) of any given categorial language. Three aspects connected with knowledge codified in language are considered, including: 1) syntax and two kinds of semantics: intensional and extensional, 2) three kinds of non-standard language models and 3) three notions of truthfulness of wfes. Adequacy of language knowledge to cognitive objects is understood as an agreement of truthfulness of sentences in these three models. (shrink)

The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the role of semantic automata in (...) linguistic theory and offer new empirical predictions for sentence processing with embedded quantifiers. (shrink)

We present a Revised Projectivity Calculus that extends the scope of inclusion and exclusion inferences derivable under the Projectivity Calculus developed by Icard :705–725, 2012). After pointing out the inadequacies of C, we introduce four opposition properties which have been studied by Chow Proceedings of the 18th Amsterdam Colloquium, Springer, Berlin, 2012; Beziau, Georgiorgakis New dimensions of the square of opposition, Philosophia Verlag GmbH, München, 2017) and are more appropriate for the study of exclusion reasoning. Together with the monotonicity properties, (...) the OPs will form the basis of RC instead of the additive/multiplicative properties used in C. We also prove some important results of the OPs and their relation with the MPs. We then introduce a set of projectivity signatures together with the associated operations and conditions for valid inferences, and develop RC by inheriting the key features of C. We then show that under RC, we can derive some inferences that are not derivable under C. We finally discuss some properties of RC and point to possible directions of further studies. (shrink)

The present volume contains a collection of papers presented at the 21st annual meeting “Sinn und Bedeutung” of the Gesellschaft fur Semantik, which was held at the University of Edinburgh on September 4th–6th, 2016. The Sinn und Bedeutung conferences are one of the leading international venues for research in formal semantics.

In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

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, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need too much computational resource, e.g., time or memory, to (...) be practically computable. Computational complexity theory is concerned with the amount of resources required for the execution of algorithms and, hence, the inherent difficulty of computational problems. An important goal of computational complexity theory is to categorize computational problems via complexity classes, and in particular, to identify efficiently solvable problems and draw a line between tractability and intractability. -/- We survey how complexity can be used to study computational plausibility of cognitive theories. We especially emphasize methodological and mathematical assumptions behind applying complexity theory in cognitive science. We pay special attention to the examples of applying logical and computational complexity toolbox in different domains of cognitive science. We focus mostly on theoretical and experimental research in psycholinguistics and social cognition. (shrink)

By creating certain marks on paper, or by making certain sounds-breathing past a moving tongue-or by articulation of hands and bodies, language users can give expression to their mental lives. With language we command, assert, query, emote, insult, and inspire. Language has meaning. This fact can be quite mystifying, yet a science of linguistic meaning-semantics-has emerged at the intersection of a variety of disciplines: philosophy, linguistics, computer science, and psychology. Semantics is the study of meaning. But what exactly is "meaning"? (...) What is the exact target of semantic theory? Much of the early work in natural language semantics was accompanied by extensive reflection on the aims of semantic theory, and the form a theory must take to meet those aims. But this meta-theoretical reflection has not kept pace with recent theoretical innovations. This volume re-addresses these questions concerning the foundations of natural language semantics in light of the current state-of-the-art in semantic theorising. (shrink)

We distinguish three ways that a theory of linguistic meaning and communication might be considered dynamic in character. We provide some examples of systems which are dynamic in some of these senses but not others. We suggest that separating these notions can help to clarify what is at issue in particular debates about dynamic versus static approaches within natural language semantics and pragmatics.

The meanings of words are not permanent but change over time. Some changes of meaning are quick, such as when a pronoun changes its reference; some are slower, as when two speakers find out that they are using the same word in different senses; and some are very slow, such as when the meaning of a word changes over historical time. A theory of semantics should account for these different time scales. In order to describe these different types of meaning (...) changes, I present an analysis of three levels of communication: instruction, coordination of common ground and coordination of meaning. My first aim is to show that these levels must be considered when discussing lexical semantics. A second aim is to use the levels to identify the communicative roles of some of the main word classes, in particular nouns, adjectives, verbs, indexicals and quantifiers. I argue that the existence of word classes can, to a large extent, be explained by the communicative needs that arise on the different levels. (shrink)

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

Epistemic modals are a prominent topic in the literature on natural language semantics, with wide-ranging implications for issues in philosophy of language and philosophical logic. Considerations about the role that epistemic "might" and "must" play in discourse and reasoning have led to the development of several important alternatives to classical possible worlds semantics for natural language modal expressions. This is an opinionated overview of what I take to be some of the most exciting issues and developments in the field.

This work explores the hypothesis that natural language is a tool for changing a language user's state of mind and, more specifically, the hypothesis that a sentence's meaning is constituted by its characteristic role in fulfilling this purpose. This view contrasts with the dominant approach to semantics due to Frege, Tarski and others' work on artificial languages: language is first and foremost a tool for representing the world. Adapted to natural language by Davidson, Lewis, Montague, et. al. this dominant approach (...) has crystalized as truth-conditional semantics: to know the meaning of a sentence is to know the conditions under which that sentence is true. Chapter 1 details the animating ideas of my alternative approach and shows that the representational function of language can be understood in terms of the more general function of changing representational mental states. Chapters 2-4 argue that the additional resources of this more general conception of meaning allow us to explain certain phenomena involving conditionals and grammatical mood that truth-conditional semantics does not. In the analysis of these specific phenomena and the articulation of the general approach on offer, it emerges that this approach combines insights and benefits from both use-theoretic and truth-theoretic work on meaning. (shrink)

A dynamic semantics for iffy oughts offers an attractive alternative to the folklore that Chisholm's paradox enforces an unhappy choice between the intuitive inference rules of factual and deontic detachment. The first part of the story told here shows how a dynamic theory about ifs and oughts gives rise to a nonmonotonic perspective on deontic discourse and reasoning that elegantly removes the air of paradox from Chisholm's puzzle without sacrificing any of the two detachment principles. The second part of the (...) story showcases two bonus applications of the framework suggested here: it offers a response to Forrester's gentle murder paradox and avoids Kolodny and MacFarlane's miners paradox about deontic reasoning under epistemic uncertainty. A comparison between the dynamic semantic proposal made in this paper and a more conservative approach combining a static semantics with a dynamic pragmatics is provided. (shrink)

This light piece reflects on analogies between two often disjoint streams of research: the logical semantics and pragmatics of natural language and dynamic logics of general information-driven agency. The two areas show significant overlap in themes and tools, and yet, the focus seems subtly different in each, defying a simple comparison. We discuss some unusual questions that emerge when the two are put side by side, without any pretense at covering the whole literature or at reaching definitive conclusions.

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)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

We give a condensed survey of recent research on generalized quantifiers in logic, linguistics and computer science, under the following headings: Logical definability and expressive power, Polyadic quantifiers and linguistic definability, Weak semantics and axiomatizability, Computational semantics, Quantifiers in dynamic settings, Quantifiers and modal logic, Proof theory of generalized quantifiers.

Generalized quantifiers are functions from pairs of properties to truth-values; these functions can be used to interpret natural language quantifiers. The space of such functions is vast and a great deal of research has sought to find natural constraints on the functions that interpret determiners and create quantifiers. These constraints have demonstrated that quantifiers rest on number and number sense. In the first part of the paper, we turn to developing this argument. In the remainder, we report on work in (...) neurobiology that test the empirical claims of the theory. In particular, we look at fMRI experiments and behavioral experiments with various patient populations that support the intimate connection between natural language quantification and number sense. (shrink)

Abstract This paper discusses the semantic theory presented in Robert Brandom’s Making It Explicit . I argue that it is best understood as a special version of dynamic semantics, so that these semantics by themselves offer an interesting theoretical alternative to more standard truth-conditional theories. This reorientation also has implications for more foundational issues. I argue that it gives us the resources for a renewed argument for the normativity of meaning. The paper ends by critically assessing the view in both (...) its development and motivations. Content Type Journal Article Pages 1-22 DOI 10.1007/s11098-011-9768-4 Authors Bernhard Nickel, Harvard University, Cambridge, MA, USA Journal Philosophical Studies Online ISSN 1573-0883 Print ISSN 0031-8116. (shrink)

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction is (...) further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (shrink)

We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We greatly extend past work in natural logic, which has focused solely on semantic containment and monotonicity, to incorporate both semantic exclusion and implicativity. Our system decomposes an inference problem into a sequence of atomic edits linking premise to hypothesis; predicts a lexical entailment relation for each edit using a statistical classifier; (...) propagates these relations upward through a syntax tree according to semantic properties of intermediate nodes; and composes the resulting entailment relations across the edit sequence. We evaluate our system on the FraCaS test suite, and achieve a 27% reduction in error from previous work. We also show that hybridizing an existing RTE system with our natural logic system yields significant gains on the RTE3 test suite. (shrink)

Ontology is the study of what there is, what kinds of things make up reality. Ontology seems to be a very difficult, rather speculative discipline. However, it is trivial to conclude that there are properties, propositions and numbers, starting from only necessarily true or analytic premises. This gives rise to a puzzle about how hard ontological questions are, and relates to a puzzle about how important they are. And it produces the ontologyobjectivity dilemma: either (certain) ontological questions can be trivially (...) answered using only uncontroversial premises, or the uncertainties of ontology are really a threat to the truth of basically everything we say or believe. The main aim of this dissertation is to resolve these puzzles and to shed some light on the discipline of ontology. I defend a view inspired by Carnap’s internal-external distinction about what there is, but one according to which both internal and external questions are fully factual and meaningful. In particular, I argue that the trivial arguments are valid, but they do not answer any ontological questions. Furthermore, I propose an account of the function of our talk about properties, propositions and natural numbers. According to this account our talk about them has no ontological presuppositions for its literal and objective truth. This avoids the ontology-objectivity dilemma, and solves the puzzles about ontology. To do this I look at quantification and noun phrases in general, and at their relation to ontology. I argue that quantifiers are semantically underspecified in a certain respect, and play two different roles in communication. I discuss the relation between syntactic form and information structure, the function of certain non-referential, non-quantificational noun phrases, the uses of bare number determiners, and how arithmetic truths are learned and taught. The more metaphysical issues discussed include: inexpressible properties, logicism about arithmetic, nominalism, Carnap’s view about ontology, the problem of universals, the relationship between ontology and objectivity, different projects within ontology, non-existent.... (shrink)

In this note I provide an answer to an apparently technical query by van Benthem (1986; 67) concerning denotations of English expressions. The answer turns out to be revealing of some systematic semantic differences associated with certain categories of expression. The categories of interest to us are illustrated in (1a) and given an extensional type theoretic analysis in (1b).

A number of important philosophical problems are problems in the overlap of logic and ontology. Both logic and ontology are diverse fields within philosophy, and partly because of this there is not one single philosophical problem about the relation between logic and ontology. In this survey article we will first discuss what different philosophical projects are carried out under the headings of "logic" and "ontology" and then we will look at several areas where logic and ontology overlap.

The paper offers a new analysis of the difficulties involved in the construction of a general and substantive correspondence theory of truth and delineates a solution to these difficulties in the form of a new methodology. The central argument is inspired by Kant, and the proposed methodology is explained and justified both in general philosophical terms and by reference to a particular variant of Tarski's theory. The paper begins with general considerations on truth and correspondence and concludes with a brief (...) outlook on the "family" of theories of truth generated by the new methodology. (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)

Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. Our discussion transcends, however, the (...) resources of standard lst-order languages and we will consider the new form in the context of 1st-order logic with 1- and 2-place ‘Mostowskian` generalized quantifiers.2.. (shrink)

Geach’s rich paper ‘A Program for Syntax’ introduced many ideas into the arena of categorial grammar, not all of which have been given the attention they warrant in the thirty years since its first publication. Rather surprisingly, one of our findings (Section 3 below) is that the paper not only does not contain a statement of what has widely come to be known as “Geach’s Rule”, but in fact presents considerations which are inimical to the adoption of the rule in (...) question. With regard to at least some amongst the numerous other points extracted here from Geach’s discussion, we shall not be able to reach so definitive a conclusion, and content ourselves with giving the issues an airing. (shrink)

We describe the foundations and the systematization of natural logic-like monotonic inference using unscoped episodic logical forms (ULFs) that as reported by Kim et al. (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021a, b) introduced and first evaluated. In addition to providing a more detailed explanation of the theory and system, we present results from extending the inference manager to address a few of the limitations that as reported by Kim et al. (...) (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021b) naive system has. Namely, we add mechanisms to incorporate lexical information from the hypothesis (or goal) sentence, enable the inference manager to consider multiple possible scopings for a single sentence, and match against the goal using English rather than the ULF. (shrink)

The received wisdom on ability modals is that they differ from their epistemic and deontic cousins in what inferences they license and better receive a universal or conditional analysis instead of an existential one. The goal of this paper is to sharpen the empirical picture about the semantics of ability modals, and to propose an analysis that explains what makes the can of ability so special but that also preserves the crucial idea that all uses of can share a common (...) lexical semantics. The resulting framework combines tools and techniques from dynamic and inquisitive semantics with insights from the literature of the role of agency in deontic logic. It explains not only why the can of ability, while essentially being an existential modal operator, sometimes resists distribution over disjunction and interacts with its duals in particular and hitherto unnoticed ways, but also has a tendency to license free choice inferences. (shrink)

In this article, we describe and attempt to solve a puzzle arising from the interpretation of modified numerals like less than five and between two and five. The puzzle is this: such modified numerals seem to mean different things depending on whether they combine with distributive or non-distributive predicates. When they combine with distributive predicates, they intuitively impose a kind of upper bound, whereas when they combine with non-distributive predicates, they do not. We propose and explore in detail four solutions (...) to this puzzle, each involving some notion of maximality, but differing in the type of maximality involved and in the source of maximality. While the full range of data we consider do not conclusively favor one theory over the other three, we do argue that overall the evidence goes against the view that modified numerals lexically encode a ‘standard’ maximality operator, and suggests the need for a pragmatic blocking mechanism that filters out readings of sentences that are generated by the grammar but intuitively unavailable. (shrink)

We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality.<br>In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon hypothesis and (...) explanatory power of recent neuroimaging studies as well as provides<br>evidence. (shrink)

Natural language sentences that talk about two or more sets of entities can be assigned various readings. The ones in which the sets are independent of one another are particularly challenging from the formal point of view. In this paper we will call them ‘Independent Set (IS) readings’. Cumulative and collective readings are paradigmatic examples of IS readings. Most approaches aiming at representing the meaning of IS readings implement some kind of maximality conditions on the witness sets involved. Two kinds (...) of maximization have been proposed in the literature: ‘Local’ and ‘Global’ maximization. In this paper, we present an online questionnaire whose results appear to support Local maximization. The latter seems to capture the proper interplay between the semantics and the pragmatics of multi-quantifier sentences, provided that witness sets are selected on pragmatic grounds. (shrink)

Abstract Proportional quantifiers have played a central role in the development of formal semantics because they set a benchmark for the expressive power needed to describe quantification in natural language (Barwise and Cooper Linguist Philos 4:159–219, 1981). The proportional quantifier most, in particular, supplied the initial motivation for adopting Generalized Quantifier Theory (GQT) because its meaning is definable as a relation between sets of individuals, which are taken to be semantic primitives in GQT. This paper proposes an alternative analysis of (...) most that does not treat it as a lexical item whose meaning is accessible without the help of compositional processes. Instead, proportional most is analyzed as the superlative of many (cf. Bresnan Linguist Inq 4(3):274–344, 1973). Two types of empirical evidence are presented in support of this view, both exploiting the fact that only a decompositional analysis of proportional quantifiers provides the means to generate different logical forms for seemingly equivalent statements of the form most A B and more than half of the A B. (shrink)

We present a formal system for reasoning about inclusion and exclusion in natural language, following work by MacCartney and Manning. In particular, we show that an extension of the Monotonicity Calculus, augmented by six new type markings, is sufficient to derive novel inferences beyond monotonicity reasoning, and moreover gives rise to an interesting logic of its own. We prove soundness of the resulting calculus and discuss further logical and linguistic issues, including a new connection to the classes of weak, strong, (...) and superstrong negative polarity items. (shrink)

We consider connections between number sense—the ability to judge number—and the interpretation of natural language quantifiers. In particular, we present empirical evidence concerning the neuroanatomical underpinnings of number sense and quantifier interpretation. We show, further, that impairment of number sense in patients can result in the impairment of the ability to interpret sentences containing quantifiers. This result demonstrates that number sense supports some aspects of the language faculty.

We provide a computational model of semantic alignment among communicating agents constrained by social and cognitive pressures. We use our model to analyze the effects of social stratification and a local transmission bottleneck on the coordination of meaning in isolated dyads. The analysis suggests that the traditional approach to learning—understood as inferring prescribed meaning from observations—can be viewed as a special case of semantic alignment, manifesting itself in the behaviour of socially imbalanced dyads put under mild pressure of a local (...) transmission bottleneck. Other parametrizations of the model yield different long-term effects, including lack of convergence or convergence on simple meanings only. (shrink)

This paper addresses the two interpretations that a combination ofnegative indefinites can get in concord languages like French:a concord reading, which amounts to a single negation, and a doublenegation reading. We develop an analysis within a polyadic framework,where a sequence of negative indefinites can be interpreted as aniteration of quantifiers or via resumption. The first option leadsto a scopal relation, interpreted as double negation. The secondoption leads to the construction of a polyadic negative quantifiercorresponding to the concord reading. Given that (...) sentential negationparticipates in negative concord, we develop an extension of thepolyadic approach which can deal with non-variable binding operators,treating the contribution of negation in a concord context assemantically empty. Our semantic analysis, incorporated into agrammatical analysis formulated in HPSG, crucially relies on theassumption that quantifiers can be combined in more than one wayupon retrieval from the quantifier store. We also considercross-linguistic variation regarding the participation ofsentential negation in negative concord. (shrink)