Discussion of the Aristotelian syllogistic over the last sixty years has arguably centered on the question whether syllogisms are inferences or implications. But the significance of this debate at times has been taken to concern whether the syllogistic is a logic or a theory, and how it ought to be represented by modern systems. Largely missing from this discussion has been a study of the few passages in the Prior Analytics where Aristotle provides explicit guidance on how to individuate syllogisms. (...) I argue that syllogisms are individuated by unordered premise pairs and so may be fruitfully thought of as multi-succedent sequents. I conclude by drawing a few consequences for the representation of the syllogistic. (shrink)

This volume is about abstract objects and the ways we refer to them in natural language. Asher develops a semantical and metaphysical analysis of these entities in two stages. The first reflects the rich ontology of abstract objects necessitated by the forms of language in which we think and speak. A second level of analysis maps the ontology of natural language metaphysics onto a sparser domain--a more systematic realm of abstract objects that are fully analyzed. This second level reflects the (...) commitments of real metaphysics. The models for these commitments assign truth conditions to natural language discourse. Annotation copyright by Book News, Inc., Portland, OR. (shrink)

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.

This paper is about the semantic analysis of referentially opaque verbs like seek and owe that give rise to nonspecific readings. It is argued that Montague's categorization (based on earlier work by Quine) of opaque verbs as properties of quantifiers runs into two serious difficulties: the first problem is that it does not work with opaque verbs like resemble that resist any lexical decomposition of the seek ap try to find kind; the second one is that it wrongly predicts de (...) dicto (i.e. narrow scope) readings due to quantified noun phrases in the object positions of such verbs. It is shown that both difficulties can be overcome by an analysis of opaque verbs as operating on properties. This is a strongly modified version of a paper entitled lsquoDo We Bear Attitudes towards Quantifiers?rsquo that I have presented at conferences in Gosen (Gesellschaft für Sprachwissenschaft), Ithaca (SALT I), and Konstanz (Lexikon). I owe a special debt to Hans Kamp and Arnim von Stechow for shaping my views on the subject of this paper during the past ten years or so. Comments from and discussions with the following friends and colleagues have also led to considerable improvements: Heinrich Beck, Steve Berman, David Dowty, Veerle van Geenhoven, Fritz Hamm, Irene Heim, Wolfgang Klein, Angelika Kratzer, Michael Morreau, Barbara Partee, Mats Rooth, Roger Schwarzschild, Wolfgang Sternefeld, Emil Weydert, Henk Zeevat, and three referees. (shrink)

The paper elaborates two points: i) There is no principal opposition between predicate logic and adherence to subject-predicate form, ii) Aristotle's treatment of quantifiers fits well into a modern study of generalized quantifiers.

Adopting a different method from the previous scholars, this article deduces the remaining 23 valid syllogisms just taking the syllogism AEE-4 as the basic axiom. The basic idea of this study is as follows: firstly, make full use of the trichotomy structure of categorical propositions to formalize categorical syllogisms. Then, taking advantage of the deductive rules in classical propositional logic and the basic facts in the generalized quantifier theory, we deduce the remaining 23 valid categorical syllogisms by taking just one (...) syllogism (that is, AEE-4) as the basic axiom. This article not only reveals the reducible relations between the syllogism AEE-4 and the other 23 valid syllogisms, but also establishes a concise formal axiomatic system for categorical syllogistic logic. We hope that the results and methods will provide a good mathematical paradigm for studying other kinds of syllogistic logics, and that the project will appeal to specialists in logic, linguistic semantics, computational semantics, cognitive science and artificial intelligence. (shrink)

For the first time a uniform compositional derivation is given for quantified sentences containing exceptive constructions. The semantics of exceptives is primarily one of subtraction from the domain of a quantifier. The crucial semantic difference between the highly grammaticized but-phrases and free exceptives is that the former have the Uniqueness Condition as part of their lexical meaning whereas the latter are mere set subtractors. Several empirical differences between the two types of exceptives are shown to follow from this basic lexical (...) difference. (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)

In this paper (except in Section 5) all quantifiers are assumedto be so called simple unaryquantifiers, and all models are assumedto be finite. We give a necessary and sufficientcondition for a quantifier to be definablein terms of monotone quantifiers. For amonotone quantifier we give a necessaryand sufficient condition for beingdefinable in terms of a given set of bounded monotonequantifiers. Finally, we give a necessaryand sufficient condition for a monotonequantifier to be definable in terms of agiven monotone quantifier.Our analysis shows that (...) the quantifierat least one half and its relatives behavedifferently than other monotone quantifiers. (shrink)

Providing a possible worlds semantics for a logic involves choosing a class of possible worlds models, and setting up a truth definition connecting formulas of the logic with statements about these models. This scheme is so flexible that a danger arises: perhaps, any logic whatsoever can be modelled in this way. Thus, the enterprise would lose its essential 'tension'. Fortunately, it may be shown that the so-called 'incompleteness-examples' from modal logic resist possible worlds modelling, even in the above wider sense. (...) More systematically, we investigate the interplay of truth definitions and model conditions, proving a preservation theorem characterizing those types of truth definition which generate the minimal modal logic. (shrink)

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness both of modal systems (...) and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

The purpose of this paper is to contribute to the natural logic program which invents logics in natural language. This study presents two logics: a logical system called d R containing transitive verbs and a more expressive logical system R containing both transitive verbs and intersective adjectives. The paper offers three different set-theoretic semantics which are equivalent for the logics.

The aim of this paper is to provide a contribution to the natural logic program which explores logics in natural language. The paper offers two logics called \ \) and \ \) for dealing with inference involving simple sentences with transitive verbs and ditransitive verbs and quantified noun phrases in subject and object position. With this purpose, the relational logics are introduced and a model-theoretic proof of decidability for they are presented. In the present paper we develop algebraic semantics of (...) the logics using congruence theory. (shrink)

The paper suggests a modal predicate logic that deals with classical quantification and modalities as well as intermediate operators, like “most” and “mostly”. Following up the theory of generalized quantifiers, we will understand them as two-placed operators and call them determiners. Quantifiers as well as modal operators will be constructed from them. Besides the classical deduction, we discuss a weaker probabilistic inference “therefore, probably” defined by symmetrical probability measures in Carnap’s style. The given probabilistic inference relates intermediate quantification to singular (...) statements: “Most S are P” does not logically entail that a particular individual S is also P, but it follows that this is probably the case, where the probability is not ascribed to the propositions but to the inference. We show how this system deals with single case expectations while predictions of statistical statements remain generally problematic. (shrink)

The paper uses the theory of generalized quantifiers to discuss existential import and its implications for Aristotelian logic, namely the square of opposition, conversions and the assertoric syllogistic, as well as for more recent generalizations to intermediate quantifiers like “most”. While this is a systematic discussion of the semantic background one should assume in order to obtain the inferences and oppositions Aristotle proposed, it also sheds some light on the interpretation of his writings. Moreover by applying tools from modern formal (...) semantics to the investigation of classical Aristotelian logic and its extensions, we combine different approaches to the logic of quantification. We will present variants of quantifiers that are associated to the four corners of the square of opposition with and without existential import and discuss their role for the logical square, conversions and the syllogistic. It will turn out that there is no way to ascribe existential import that validates all inferences and relations which one is willing to hold in Aristotelian logic. Two options, however, provide reasonable results. Existential import should either be ascribed only to affirmative statements or only be ascribed to universal quantification. The former option is preferable for a mere reconstruction of the classical Aristotelian logic while the latter option is more attractive if Aristotelian logic is generalized to intermediate quantifiers. (shrink)

First-order logic is known to have a severely limited expressive power on finite structures. As a result, several different extensions have been investigated, including fragments of second-order logic, fixpoint logic, and the infinitary logic L∞ωω in which every formula has only a finite number of variables. In this paper, we study generalized quantifiers in the realm of finite structures and combine them with the infinitary logic L∞ωω to obtain the logics L∞ωω, where Q = {Qi: iε I} is a family (...) of generalized quantifiers on finite structures. Using the logics L∞ωω, we can express polynomial-time properties that are not definable in L∞ωω, such as “there is an even number of x” and “there exists at least n/2 x” , without going to second-order logic. We show that equivalence of finite structures relative to L∞ωω can be characterized in terms of certain pebble games that are a variant of the Ehrenfeucht—Fraïssé games. We combine this game-theoretic characterization with sophisticated combinatorial tools from Ramsey theory, such as van der Waerden's Theorem and Folkman's Theorem, in order to investigate the scope and limits of generalized quantifiers in finite model theory. We obtain sharp lower bounds for expressibility in the logics L∞ωω and discover an intrinsic difference between adding finitely many simple unary generalized quantifiers to L∞ωω adding infinitely many. In particular, we show that if Qis a finite sequence of simple unary generalized quantifiers, then the equicardinality, or Härtig, quantifier is not definable in L∞ωω. We also show that the query “does the equivalence relation E have an even number of equivalence classes” is not definable in the extension L∞ωω of L∞ωω by the Härtig quantifier I and any finite sequence Q of simple unary generalized quantifiers. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and to (...) account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

In this paper, a theory T H based on combining type freeness with logic is introduced and is then used to build a theory of properties which is applied to determiners and quantifiers.

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

The semantic characterization of the (syllogistic) relations of contrariety and subcontrariety is problematic, as the present discussion illustrates here by attending to some suggestions of D. H. Sanford.

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness both of modal systems (...) and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

The need for a ‘many-valued logic’ in linguistics has been evident since the 1970s, but there was lack of clarity as to whether it should come from the family of fuzzy logics or from the family of probabilistic logics. In this regard, Fine [14] and Kamp [26] pointed out undesirable effects of fuzzy logic (the failure of idempotency and coherence) which kept two generations of linguists and philosophers at arm’s length. (Another unwanted feature of fuzzy logic is the property of (...) truth functionality.) While probabilistic logic is not fraught by the same problems, its lack of constructiveness, i.e. its inability to compose complex truth degrees from atomic truth degrees, did not make it more attractive to linguists either. In the absence of a clear perspective in ‘many-valued logic’, scholars chose to proliferate ontologies grafted atop the classical bivalent logic: ontologies for truth, individuals, events, situations, possible worlds and degrees. The result has been a collection of incompatible classical logics. In this paper, I present sample logic, in particular its semantics (not its axiomatization). Sample logics is a member of the family of probabilistic logics, which is constructive without being truth functional. More specifically, I integrate all the important linguistic data on which the classical logics are predicated. The concepts of (in)dependency and conditional (in)dependency are the cornerstones of sample logic. (shrink)

The many-property problem has traditionally been taken to show that the adverbial theory of perception is untenable. This paper first shows that several widely accepted views concerning the nature of perception---including both representational and non-representational views---likewise face the many-property problem. It then presents a solution to the many-property problem for these views, but goes on to show how this solution can be adapted to provide a novel, fully compositional solution to the many-property problem for adverbialism. Thus, with respect to the (...) many-property problem, adverbialism and several widely accepted views in the philosophy of perception are on a par, and the problem is solved. (shrink)

Given current data, only a few binary Boolean operators are expressed in lexically simple fashion in the world's languages: and, or, nor. These do not occur in every combination, for example, nor is not observed by itself. To explain these cross‐linguistic patterns, we propose an encoding of Boolean operators as update procedures to accept or reject information in a context. We define a measure of conceptual simplicity for such updates, on which attested operators are conceptually simpler than the remaining Booleans. (...) Moreover, we show that language evolution selects for the attested lexical inventories by minimizing the complexity of using a lexical inventory compositionally to convey precise information. (shrink)

This article studies the monotonicity behavior of plural determinersthat quantify over collections. Following previous work, we describe thecollective interpretation of determiners such as all, some andmost using generalized quantifiers of a higher type that areobtained systematically by applying a type shifting operator to thestandard meanings of determiners in Generalized Quantifier Theory. Twoprocesses of counting and existential quantification thatappear with plural quantifiers are unified into a single determinerfitting operator, which, unlike previous proposals, both capturesexistential quantification with plural determiners and respects theirmonotonicity (...) properties. However, some previously unnoticed factsindicate that monotonicity of plural determiners is not always preservedwhen they apply to collective predicates. We show that the proposedoperator describes this behavior correctly, and characterize themonotonicity of the collective determiners it derives. It is proved thatdeterminer fitting always preserves monotonicity properties ofdeterminers in their second argument, but monotonicity in the firstargument of a determiner is preserved if and only if it is monotonic inthe same direction in the second argument. We argue that this asymmetryfollows from the conservativity of generalized quantifiers innatural language. (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.

Following on Westerståhl’s argument that many is not Conservative [9], I propose an intensional account of Conservativity as well as intensional versions of EXT and Isomorphism closure. I show that an intensional reading of many can easily possess all three of these, and provide a formal statement and proof that they are indeed proper intensionalizations. It is then discussed to what extent these intensionalized properties apply to various existing readings of many.

In the so-called reverse proportional reading :53, 1997), the truth conditions of statements of the form many/few \\ appear to make reference to the ratio of the individuals that are in the extensions of both \ and \ to the individuals that are in the extension of \. The analysis of such readings is controversial. One prominent approach assumes they are a symptom of many and few making reference to a context dependent standard of comparison. We observe that this initially (...) attractive approach systematically undergenerates, failing to capture pervasive reverse proportionality in environments that remove context dependency of the standard. Instead, we propose that reverse proportionality in such cases can arise from the underspecification of the measure function underlying the meanings of many and few. (shrink)

In the so-called reverse proportional reading :53, 1997), the truth conditions of statements of the form many/few \\ appear to make reference to the ratio of the individuals that are in the extensions of both \ and \ to the individuals that are in the extension of \. The analysis of such readings is controversial. One prominent approach assumes they are a symptom of many and few making reference to a context dependent standard of comparison. We observe that this initially (...) attractive approach systematically undergenerates, failing to capture pervasive reverse proportionality in environments that remove context dependency of the standard. Instead, we propose that reverse proportionality in such cases can arise from the underspecification of the measure function underlying the meanings of many and few. (shrink)

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...) development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

This dissertation investigates the ways in which natural language restricts the domains of quantifiers. Adverbs of quantification are analyzed as quantifying over situations. The domain of quantifiers is pragmatically constrained: apparent processes of "semantic partition" are treated as pragmatic epiphenomena. The introductory Chapter 1 sketches some of the background of work on natural language quantification and begins the analysis of adverbial quantification over situations. Chapter 2 develops the central picture of "semantic partition" as a side-effect of pragmatic processes of anaphora (...) resolution. I argue that the apparent effects of topic/focus articulation and presuppositional information on the interpretation of quantifiers are not the result of a direct and local mechanism of sentence grammar. Instead, I develop an analysis where the link is established via the anaphoric dependence of quantifier domains on the discourse context. Chapter 3 discusses the analysis of conditional clauses as quantifier restrictors, concentrating on the question whether conditional clauses restrict quantifiers directly or indirectly. A treatment is explored which has if-clauses constrain the value of the hidden domain variable of the restricted quantifier. Chapter 4, on unless-clauses, and Chapter 5, on only if- and even if-clauses, present some issues in the compositional analysis of complex conditional clauses. These chapters significantly expand the data coverage of the theory of A-quantification. Building on previous work of mine on exceptives, I analyze unless-clauses as exceptive operators on A-quantifiers. The analysis of only if-clauses, treated as conditional clauses that combine if with the focus adverb only, unearthes some interesting new properties. Chapter 6, finally, examines the phenomenon of donkey-anaphora in the light of the results of the previous chapters. I show that a solution to the proportion problem may become possible once we combine the situation-semantic approach to adverbial quantification with the pragmatic theory developed in Chapter 2 and further elaborated in the analysis of donkey anaphora in complex conditionals. (shrink)