The present event‐related potential (ERP) study used picture–sentence verification to investigate the neurolinguistic correlates of the online processing of compositional‐semantic information. To this end, we examined context effects on sentences involving temporal adverbial quantification likeJana war jeden Morgen schwimmen an den Arbeitstagen (“Jana went for a swim every morning during the working week”). We tested whether the conceptual complexity associated with quantifying over time intervals leads to delayed predictions regarding the upcoming words in a sentence. The present study replicated previous (...) results relating to quantification over individuals, which are conceptually less complex than time intervals. Analogous to previous studies, false vs. true sentences elicited an N400 whenever contextual cues did not permit a potential revision of a locally assigned truth value. The present results are compatible with an approach under which contextual cues are immediately considered for predicting how a sentence continues. The fact that the contextual complexity did not lead to processing delays indicates that the processing system quickly abstracts away from the conceptual complexity associated with the linguistic input if such an abstraction is possible. (shrink)

In ‘A Consistent Way with Paradox’, Laurence Goldstein (2009) clarifies his solution to the liar, which he touts as revenge immune . In addition, he (Ibid.) responds to one of the objections that Armour-Garb and Woodbridge (2006) raise against certain solutions to the open pair and argues that his proffered solution to the liar family of paradoxes undermines what they (Ibid.) call the dialetheic conjecture . In this paper, after critically evaluating Goldstein’s response to A-G&W, I turn to his proposed (...) solution to the liar paradox, where I show that it is difficult to see how it manages to avoid that conjecture. (shrink)

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret $@_i$ in propositional and first-order hybrid logic. This means: interpret $@_i\alpha _a$ , where $\alpha _a$ is an expression of any type $a$ , as an expression of type $a$ that (...) rigidly returns the value that $\alpha_a$ receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

We show that basic hybridization makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i$\end{document} in propositional and first-order hybrid logic. This means: interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i\alpha _a$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha _a$\end{document} is an expression of any type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document}, as an expression of type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document} that rigidly returns the value that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha_a$\end{document} receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

§1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. Examples of such properties areκ-compactness.Any set (...) of sentences of cardinality ≤ κ, every finite subset of which has a model, has itself a model.Löwenheim-Skolem Theorem down toκ.If a sentence of the logic has a model, it has a model of cardinality at most κ.Interpolation Property.If ϕ and ψ are sentences such that ⊨ ϕ → Ψ, then there is θ such that ⊨ ϕ → θ, ⊨ θ → Ψ and the vocabulary of θ is the intersection of the vocabularies of ϕ and Ψ.Lindstrom's famous theorem characterized first order logic as the maximal ℵ0-compact logic with Downward Löwenheim-Skolem Theorem down to ℵ0. With his new concept of absolute logics Barwise was able to get similar characterizations of infinitary languagesLκω. But hopes were quickly frustrated by difficulties arising left and right, and other areas of model theory came into focus, mainly stability theory. No new characterizations of logics comparable to the early characterization of first order logic given by Lindström and of infinitary logic by Barwise emerged. What was first called soft model theory turned out to be as hard as hard model theory. (shrink)

We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1 x Q2 y φ → Q2 y Q1 x φ. This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff Q1 is ∃ or Q2 is ∀ (excluding trivial cases). Our result shows that in infinite domains, there are more general types of quantifiers that support these entailments.

We present a number of puzzles arising for the interpretation of modified numerals. Following Büring and others we assume that the main difference between comparative and superlative modifiers is that only the latter convey disjunctive meanings. We further argue that the inference patterns triggered by disjunction and superlative modifiers are hard to capture in existing semantic and pragmatic analyses of these phenomena (neo-Gricean or grammatical alike), and we propose a novel account of these inferences in the framework of bilateral state-based (...) modal logic defining a first order extension of Aloni (Semant Pragmat 15:5-EA, 2022. https://doi.org/10.3765/sp.15.5)’s. (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)

This paper introduces Richard Montague's theory of determiner phrases to the philosophically oriented readers who are familiar with Russell's traditional treatment. Determiner phrases include not only quantifier phrases in the narrow sense, such as every man, some woman, and nothing, but also DP conjunctions such as Adam and Betty and Adam or Betty, and even proper names such as Adam and Betty. Montague treats all determiner phrases as belonging to type t, i.e., the type of functions from properties of individuals (...) to truth values. This paper also introduces the simply typed lambda-calculus for the explication of Montague's theory. Two major problems with Montague's theory, one more philosophical and the other more linguistic, are discussed. (shrink)

This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the boys (...) , are all of semantic type e and denote individual-like objects, called shadows — conjunctive , disjunctive , or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper. (shrink)

The core question behind this Frontiers research topic is whether explaining linguistic phenomena requires appeal to properties of human cognition that are specialized to language. We argue here that investigating this issue requires taking linguistic research results seriously, and evaluating these for domain-specificity. We present a particular empirical phenomenon, bound variable interpretations of pronouns dependent on a quantifier phrase, and argue for a particular theory of this empirical domain that is couched at a level of theoretical depth which allows its (...) principles to be evaluated for domain-specialization. We argue that the relevant principles are specialized when they apply in the domain of language, even if analogs of them are plausibly at work elsewhere in cognition or the natural world more generally. So certain principles may be specialized to language, though not, ultimately, unique to it. Such specialization is underpinned by ultimately biological factors, hence part of UG. (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)

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)

This paper proposes a new explanation for the oddness of presuppositional and negative islands, as well as the puzzling observation that these islands can be obviated by certain quantificational elements. The proposal rests on two independently motivated assumptions: (i) the idea that the domain of manners contains contraries and (ii) the notion that degree expressions range over intervals. It is argued that, given these natural assumptions, presuppositional and negative islands are predicted to lead to a presupposition failure in any context.

Most contemporary philosophical discussions of intentionality start and end with a treatment of the propositional attitudes. In fact, many theorists hold that all attitudes are propositional attitudes. Our folk-psychological ascriptions suggest, however, that there are non-propositional attitudes: I like Sally, my brother fears snakes, everyone loves my grandmother, and Rush Limbaugh hates Obama. I argue that things are as they appear: there are non-propositional attitudes. More specifically, I argue that there are attitudes that relate individuals to non-propositional objects and do (...) so not in virtue of relating them to propositions. I reach this conclusion by not only showing that attempted analyses of apparently non-propositional attitudes in terms of the propositional fail, but that some non-propositional attitudes don’t even supervene on propositional attitudes. If this is correct, then the common discussions of intentionality that address only propositional attitudes are incomplete and those who hold that all intentional states are propositional are mistaken. (shrink)

Hofweber (Ontology and the ambitions of metaphysics, Oxford University Press, 2016) argues for a thesis he calls “internalism” with respect to natural number discourse: no expressions purporting to refer to natural numbers in fact refer, and no apparent quantification over natural numbers actually involves quantification over natural numbers as objects. He argues that while internalism leaves open the question of whether other kinds of abstracta exist, it precludes the existence of natural numbers, thus establishing what he calls “restricted nominalism” about (...) natural numbers. We argue that Hofweber’s internalism fails to establish restricted nominalism. Not only is his primary argument for restricted nominalism invalid, the analysis of quantification proposed threatens to collapse internalism into either a traditional form of error theory or realism. (shrink)

Theorists have had less success in analyzing the truth conditions of generics. Philosophers of language have offered a number of theories. This chapter surveys several semantic accounts of generics. However, the focus is on generics and experimental philosophy. It briefly reviews empirical work that bears on these semantic accounts. While generics constitute an interesting linguistic phenomenon worthy of study in their own right, the study of generics also has wide‐ranging implications for questions beyond the philosophy of language, including questions in (...) social psychology and cognitive science more generally. The chapter also reviews empirical work on the relationship between generics and cognition. Existing empirical work strongly supports the generics‐as‐defaults hypothesis: the hypothesis that generics reflect a cognitively default, fundamental mode of generalizing in humans. Finally, the chapter elucidates evidence that generic language and generic modes of generalizing play an important role in stereotyping and prejudice. (shrink)

This Element, written for researchers and students in philosophy and the behavioral sciences, reviews and critically assesses extant work on number concepts in developmental psychology and cognitive science. It has four main aims. First, it characterizes the core commitments of mainstream number cognition research, including the commitment to representationalism, the hypothesis that there exist certain number-specific cognitive systems, and the key milestones in the development of number cognition. Second, it provides a taxonomy of influential views within mainstream number cognition research, (...) along with the central challenges these views face. Third, it identifies and critically assesses a series of core philosophical assumptions often adopted by number cognition researchers. Finally, the Element articulates and defends a novel version of pluralism about number concepts. (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)

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)

In a mathematical perspective, neighborhood models for modal logic are generalized quantifiers, parametrized to points in the domain of objects/worlds. We explore this analogy further, connecting generalized quantifier theory and modal neighborhood logic. In particular, we find interesting analogies between conservativity for linguistic quantifiers and the locality of modal logic, and between the role of invariances in both fields. Moreover, we present some new completeness results for modal neighborhood logics of linguistically motivated classes of generalized quantifiers, and raise new types (...) of open problem. With the bridges established here, many further analogies might be explored between the two fields to mutual benefit. (shrink)

What Bar-On and Simmons call 'Conceptual Deflationism' is the thesis that truth is a 'thin' concept in the sense that it is not suited to play any explanatory role in our scientific theorizing. One obvious place it might play such a role is in semantics, so disquotationalists have been widely concerned to argued that 'compositional principles', such as -/- (C) A conjunction is true iff its conjuncts are true -/- are ultimately quite trivial and, more generally, that semantic theorists have (...) misconceived the relation between truth, meaning, and logic. This paper argues, to the contrary, that even such simple compositional principles as (C) have substantial content that cannot be captured by deflationist 'proofs' of them. The key thought is that (C) is supposed, among other things, to affirm the truth-functionality of conjunction and that disquotationalists cannot, ultimately, make sense of truth-functionality. -/- This paper is something of a companion to "The Logical Strength of Compositional Principles". (shrink)

In two recent papers, Bob Hale has attempted to free second-order logic of the 'staggering existential assumptions' with which Quine famously attempted to saddle it. I argue, first, that the ontological issue is at best secondary: the crucial issue about second-order logic, at least for a neo-logicist, is epistemological. I then argue that neither Crispin Wright's attempt to characterize a `neutralist' conception of quantification that is wholly independent of existential commitment, nor Hale's attempt to characterize the second-order domain in terms (...) of definability, can serve a neo-logicist's purposes. The problem, in both cases, is similar: neither Wright nor Hale is sufficiently sensitive to the demands that impredicativity imposes. Finally, I defend my own earlier attempt to finesse this issue, in "A Logic for Frege's Theorem", from Hale's criticisms. (shrink)

A realist view of numbers often rests on the following thesis: statements like ‘The number of moons of Jupiter is four’ are identity statements in which the copula is flanked by singular terms whose semantic function consists in referring to a number (henceforth: Identity). On the basis of Identity the realists argue that the assertive use of such statements commits us to numbers. Recently, some anti-realists have disputed this argument. According to them, Identity is false, and, thus, we may deny (...) that the relevant statements commit us to numbers. The present paper argues that the correct linguistic analysis of the relevant number statements supports the anti-realist view that Identity is false. However, as will further be shown, pace the anti-realist, this analysis does not establish that such statements do not commit us to numbers after all. (shrink)

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...) rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism, via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction. (shrink)

In the spring of 1978, one of the authors of this book was sitting in on a course in logic for linguists given by the other author. In attempting to present some of Montague's insights in an elementary way, the authors began dis cussions aimed towards the construction of a simple model-theoretical semantic apparatus which could be applied directly to a small English-like language and used to illustrate the methods of formal logical interpretation. In these discussions two points impressed themselves (...) on us. First, our task could be simplified by using boolean algebras and boolean homomorphisms in the models; and second, the boolean approach we were developing had much more widespread relevance to the logical structure of English than we first thought. During the summer and fall of 1978 we continued work on the system, proving the more fundamental theorems and outlining the way in which an intensional interpretation scheme could be developed which made use of the boolean approach. We presented our findings in a monograph which the UCLA Linguistics Department kindly published as part of their series called Occa sional Papers in Linguistics; one of the authors also presented the system at a colloquium held at the Winter Meeting of the Linguistic Society of America in December 1978. (shrink)

Attempts to clarify some issues about the use of hidden arguments to predicates of personal taste, and motivate an analysis which does not make use of such arguments.

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.

Logical form has always been a prime concern for philosophers belonging to the analytic tradition. For at least one century, the study of logical form has been widely adopted as a method of investigation, relying on its capacity to reveal the structure of thoughts or the constitution of facts. This book focuses on the very idea of logical form, which is directly relevant to any principled reflection on that method. Its central thesis is that there is no such thing as (...) a correct answer to the question of what is logical form: two significantly different notions of logical form are needed to fulfil two major theoretical roles that pertain respectively to logic and to semantics. This thesis has a negative and a positive side. The negative side is that a deeply rooted presumption about logical form turns out to be overly optimistic: there is no unique notion of logical form that can play both roles. The positive side is that the distinction between two notions of logical form, once properly spelled out, sheds light on some fundamental issues concerning the relation between logic and language. (shrink)

In this work, it is shown that given a correct understanding of the nature of reference and of linguistic meaning generally, it is possible to produce non-revisionist analyses of the nature of -/- *Perceptual content, *Mental content generally, *Logical equivalence, *Logical dependence generally, *Counterfactual truth, *The causal efficacy of mental states, and *Our knowledge of ourselves and of the external world. -/- In addition, set-theoretic interpretations of several semantic concepts are put forth. These concepts include truth, falsehood, negation, and conjunction.

This book combines insights from philosophy and linguistics to develop a novel framework for theorizing about linguistic meaning and the role of context in interpretation. A key innovation is to introduce explicit representations of context — assignment variables — in the syntax and semantics of natural language. The proposed theory systematizes a spectrum of “shifting” phenomena in which the context relevant for interpreting certain expressions depends on features of the linguistic environment. Central applications include local and nonlocal contextual dependencies with (...) quantifiers, attitude ascriptions, conditionals, questions, and relativization. The result is an innovative, philosophically informed compositional semantics compatible with the truth-conditional paradigm. (shrink)

This paper revisits the question of whether propositions in situation semantics must be persistent [Kratzer (1989). Linguistics and Philosophy, 12, 607–653]. It shows that ignoring persistence causes empirical problems for theories which use quantification over minimal situations as a solution for donkey anaphora [Elbourne (2005). Situations and individuals. Cambridge, Mass.: MIT Press]. At the same time, modifying these theories to incorporate persistence makes them incompatible with the use of situations for contextual restriction [Kratzer (2004). Ms., University of Massachusetts].

This paper introduces a compositional semantics of locativeprepositional phrases which is based on a vector space ontology.Model-theoretic properties of prepositions like monotonicity andconservativity are defined in this system in a straightforward way.These notions are shown to describe central inferences with spatialexpressions and to account for the grammaticality of prepositionmodification. Model-theoretic constraints on the set of possibleprepositions in natural language are specified, similar to the semanticuniversals of Generalized Quantifier Theory.

Keenan (1987) observed that trivial determiners built from basic existential determiners (e.g.,either zero or else more than zero) are allowed inthere-insertion contexts, and that trivial determiners built from basic non-existential determiners (e.g.,either all or else not all) are not. This result is unexpected under the analyses ofthere-sentences proposed in Barwise and Cooper (1981), Higginbotham (1987), and Keenan (1987). I argue that the class of NPs barred from the postverbal position ofthere-sentences (strong NPs) is correctly characterized in presuppositional terms, as suggested (...) in de Jong and Verkuyl (1985) and Lumsden (1988). According to this characterization, strong NPs share one of the defining components of definiteness proposed in Heim (1982), namely the Descriptive Content Condition (DCC). How to derive the prohibition against strong NPs inthere-insertion contexts (definiteness effect) from the fact that strong NPs meet the DCC is not obvious, however. I argue that accounting for this prohibition involves regarding the XP-coda in [there be NP XP] as providing the contextual domain for the interpretation of the postverbal NP. (shrink)

The article studies two related issues. First, it introduces the notion of the contraposition of quantifiers which is a “dual” notion of symmetry and has similar relations to co-intersectivity as symmetry has to intersectivity. Second, it shows how symmetry and contraposition can be generalised to higher order type quantifiers, while preserving their relations with other notions from generalized quantifiers theory.

The notion of anaphoric conservativity, that is a property of specific functions taking sets and binary relations as arguments is studied. Such functions are denotations of anaphoric determiners forming nominal anaphors. It is shown that anaphoric conservativity is strictly stronger that ordinary conservativity of this type of functions. In consequence some novel semantic descriptions of reflexive and reciprocal pronouns are provided and a semantic universal stating that reflexive and reciprocal non-possessive determiners denote anaphorically conservative functions is proposed.

This paper investigates the effects of (surface) DP-internal quantifying expressions on semantic interpretation. In particular, I investigate two syntactic constructions in which an adjective takes scope out of its embedding DP, thus raising an interesting question for strict compositionality. Regarding the first construction, I follow Larson (1999) and assume that the adjective incorporates into the determiner of its DP, forming a complex quantifier [D+A]. I present new evidence in favor of this analysis. Since Larson's semantic analysis of complex quantifiers [D+A] (...) makes a wrong prediction, I propose an alternative, empirically more adequate analysis that treats D+A compounds as pluractional quantifiers in the sense of Lasersohn (1995). Finally, I turn to the second construction, arguing that – despite superficial similarities to the first construction - it should not be analyzed in terms of complex quantifier formation, but in terms of LF-movement of the adjective to Spec,DP. The discussion suggests that there is more than one way for DP-internal modifiers to take DP-external scope in natural language. (shrink)

This paper investigates how naive theories of truth fare with respect to a set of extremely plausible principles of restricted quantification. It is first shown that both nonsubstructural theories as well as certain substructural theories cannot validate all those principles. Then, pursuing further an approach to the semantic paradoxes that the author has defended elsewhere, the theory of restricted quantification available in a specific naive theory that rejects the structural property of contraction is explored. It is shown that the theory (...) validates all the principles in question, and it is argued that other prima facie plausible principles that the theory fails to validate are objectionable on independent grounds. (shrink)

In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...) follows from the sentences of this class. From an intuitive standpoint it can never happen that both the class Γ consists only of true sentences and the sentenceσis false. Moreover, … we are concerned here with the concept of logical, i.e.,formal, consequence.” [55, p. 414] Tarski believed his definition of logical consequence captured the intuitive notion: “It seems to me that everyone who understands the content of the above definition must admit that it agrees quite well with common usage. … In particular, it can be proved, on the basis of this definition, that every consequence of true sentences must be true.” [55, p. 417] The formality of Tarskian consequences can also be proven. Tarski's definition of logical consequence had a key role in the development of the model-theoretic semantics of modern logic and has stayed at its center ever since. (shrink)