Results for 'generalized quantifiers'

1000+ found
Order:
See also
  1. Generalized Quantifiers and Natural Language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
  2.  27
    Generalized Quantifiers and Natural Language.Jon Barwise - 1980 - Linguistics and Philosophy 4:159.
  3.  69
    Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.
    We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  4.  71
    Generalized Quantifiers, and Beyond.Hanoch Ben-Yami - 2009 - Logique Et Analyse (208):309-326.
    I show that the contemporary dominant analysis of natural language quantifiers that are one-place determiners by means of binary generalized quantifiers has failed to explain why they are, according to it, conservative. I then present an alternative, Geachean analysis, according to which common nouns in the grammatical subject position are plural logical subject-terms, and show how it does explain that fact and other features of natural language quantification.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  95
    Generalized Quantifiers and Modal Logic.Wiebe Van Der Hoek & Maarten De Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
    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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  6.  22
    Generalized Quantifiers and Modal Logic.Wiebe Hoek & Maarten Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7. Generalized Quantifiers in Linguistics and Logic.D. Keenan & D. Westerstahl - 2011 - In Johan Van Benthem & Alice Ter Meulen (eds.), Handbook of Logic and Language. Elsevier. pp. 837--893.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   20 citations  
  8.  85
    Conservative Generalized Quantifiers and Presupposition.Tim Fernando - manuscript
    Conservativity in generalized quantifiers is linked to presupposition filtering, under a propositions-as-types analysis extended with dependent quantifiers. That analysis is underpinned by modeltheoretically interpretable proofs which inhabit propositions they prove, thereby providing objects for quantification and hooks for anaphora.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  9.  24
    Generalized Quantifiers and Pebble Games on Finite Structures.Phokion G. Kolaitis & Jouko A. Väänänen - 1995 - Annals of Pure and Applied Logic 74 (1):23-75.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  10.  80
    Generalized Quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
  11. Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.
    Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  12.  21
    Generalized Quantifiers in Natural Language.Johan Van Benthem & Alice Ter Meulen (eds.) - 1984 - Foris Publications.
    REFERENCES Barwise, J. & R. Cooper (1981) — 'Generalized Quantifiers and Natural Language', Linguistics and Philosophy 4:2159-219. Van Benthem, J. (1983a) — ' Five Easy Pieces', in Ter Meulen (ed.), 1-17. Van Benthem, J. (1983b) ...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  37
    Independent Set Readings and Generalized Quantifiers.Livio Robaldo - 2010 - Journal of Philosophical Logic 39 (1):23-58.
    Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  14.  13
    Branching Generalized Quantifiers and Natural Language.Dag Westerståhl - 1987 - In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. pp. 269--298.
  15.  44
    Generalized Quantifiers and Number Sense.Robin Clark - 2011 - Philosophy Compass 6 (9):611-621.
    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, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  31
    Generalized Quantifiers and the Square of Opposition.Mark Brown - 1984 - Notre Dame Journal of Formal Logic 25 (4):303-322.
  17.  71
    Constructive Generalized Quantifiers.Göran Sundholm - 1989 - Synthese 79 (1):1 - 12.
  18.  22
    Generalized Quantifiers, Exception Phrases, and Logicality.S. Lappin - 1996 - Journal of Semantics 13 (3):197-220.
    On the Fregean view of NPs, quantified NPs are represented as operator-variable structures, while proper names are constants appearing in argument position. The Generalized Quantifier (GQ) approach characterizes quantified NPs as elements of a unified syntactic category and semantic type. According to the Logicality Thesis (May 1991), the distinction between quantified NPs, which undergo and operation of quantifier raising to yield operator-variable structures at Logical Form (LF), and non-quantified NPS, which appear in situ at LF, corresponds to a difference (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  19. The Hierarchy Theorem for Generalized Quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
    The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type t there is a generalized quantifier of type t which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than t. This was proved for unary similarity (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  20.  24
    Generalized Quantifiers in Natural Language.Daniele Mundici, Johan van Benthem & Alice ter Meulen - 1987 - Journal of Symbolic Logic 52 (3):876.
  21.  53
    Decomposing Generalized Quantifiers.Dag Westerståhl - 2008 - Review of Symbolic Logic 1 (3):355-371.
    This note explains the circumstances under which a type 1 quantifier can be decomposed into a type 1, 1 quantifier and a set, by fixing the first argument of the former to the latter. The motivation comes from the semantics of Noun Phrases (also called Determiner Phrases) in natural languages, but in this article, I focus on the logical facts. However, my examples are taken among quantifiers appearing in natural languages, and at the end, I sketch two more principled (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  28
    Relativized Logspace and Generalized Quantifiers Over Finite Ordered Structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
    We here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures L C , i.e., logarithmic space relativized to an oracle in C. We show (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  23.  77
    Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
    In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   13 citations  
  24.  9
    A Generalized Quantifier Logic for Naked Infinitives.Jaap van der Does - 1991 - Linguistics and Philosophy 14 (3):241-294.
  25.  56
    On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
    Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26.  29
    A Generalized Quantifier Logic for Naked Infinitives.Jaap Does - 1991 - Linguistics and Philosophy 14 (3):241 - 294.
  27.  69
    Partially-Ordered (Branching) Generalized Quantifiers: A General Definition.Gila Sher - 1997 - Journal of Philosophical Logic 26 (1):1-43.
    Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  28.  34
    On Second-Order Generalized Quantifiers and Finite Structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
    We consider the expressive power of second - order generalized quantifiers on finite structures, especially with respect to the types of the quantifiers. We show that on finite structures with at most binary relations, there are very powerful second - order generalized quantifiers, even of the simplest possible type. More precisely, if a logic is countable and satisfies some weak closure conditions, then there is a generalized second - order quantifier which is monadic, unary (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  29.  19
    Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
    We study second order generalized quantifiers on finite structures. One starting point of this research has been the notion of definability of Lindström quantifiers. We formulate an analogous notion for second order generalized quantifiers and study definability of second order generalized quantifiers in terms of Lindström quantifiers.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30. Dynamic Generalized Quantifiers.Martin van den Berg - 1996 - In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. pp. 63--94.
  31.  77
    Aristotelian Syllogisms and Generalized Quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  32.  25
    Nominal Comparatives and Generalized Quantifiers.John Nerbonne - 1995 - Journal of Logic, Language and Information 4 (4):273-300.
    This work adopts the perspective of plural logic and measurement theory in order first to focus on the microstructure of comparative determiners; and second, to derive the properties of comparative determiners as these are studied in Generalized Quantifier Theory, locus of the most sophisticated semantic analysis of natural language determiners. The work here appears to be the first to examine comparatives within plural logic, a step which appears necessary, but which also harbors specific analytical problems examined here.Since nominal comparatives (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  33.  43
    Proof-Theoretic Reconstruction of Generalized Quantifiers.Nissim Francez & Gilad Ben-Avi - 2015 - Journal of Semantics 32 (3):313-371.
  34.  7
    Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2010 - Archive for Mathematical Logic 49 (3):379-398.
    We study second order generalized quantifiers on finite structures. One starting point of this research has been the notion of definability of Lindström quantifiers. We formulate an analogous notion for second order generalized quantifiers and study definability of second order generalized quantifiers in terms of Lindström quantifiers.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35. Generalized Quantifier Theory and the Semantics of Focus.Sjaak De Mey - 1996 - In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University.
     
    Export citation  
     
    Bookmark   1 citation  
  36. The Square of Opposition and Generalized Quantifiers.Duilio D'Alfonso - 2012 - In J.-Y. Beziau & Dale Jacquette (eds.), Around and Beyond the Square of Opposition. Birkhäuser. pp. 219--227.
    In this paper I propose a set-theoretical interpretation of the logical square of opposition, in the perspective opened by generalized quantifier theory. Generalized quantifiers allow us to account for the semantics of quantificational Noun Phrases, and of other natural language expressions, in a coherent and uniform way. I suggest that in the analysis of the meaning of Noun Phrases and Determiners the square of opposition may help representing some semantic features responsible to different logical properties of these (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  37.  63
    Temporal Prepositions and Temporal Generalized Quantifiers.Ian Pratt & Nissim Francez - 2001 - Linguistics and Philosophy 24 (2):187-222.
    In this paper, we show how the problem of accounting for the semanticsof temporal preposition phrases (tPPs) leads us to some surprisinginsights into the semantics of temporal expressions ingeneral. Specifically, we argue that a systematic treatment of EnglishtPPs is greatly facilitated if we endow our meaning assignments with context variables, a device which allows a tPP to restrict domainsof quantification arising elsewhere in a sentence. We observe that theuse of context variables implies that tPPs can modify expressions intwo ways, and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  38.  28
    Generalized Quantifiers and Elementary Extensions of Countable Models.Małgorzata Dubiel - 1977 - Journal of Symbolic Logic 42 (3):341-348.
  39. Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
    We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  40.  12
    Generalized Quantifiers in Declarative and Interrogative Sentences.Raffaella Bernardi & Richard Moot - 2003 - Logic Journal of the IGPL 11 (4):419-434.
    In this paper we present a logical system able to compute the semantics of both declarative and interrogative sentences. Our proposed analysis takes place at both the sentential and at the discourse level. We use syntactic inference on the sentential level for declarative sentences, while the discourse level comes into play for our treatment of questions. Our formalization uses a type logic sensitive to both the syntactic and semantic properties of natural language. We will show how an account of the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  58
    First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
  42.  7
    The Hierarchy Theorem for Generalized Quantifiers.Lauri Hella, Kerkko Luosto & Jouko Vaananen - 1996 - Journal of Symbolic Logic 61 (2):802-817.
    The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type $t$ there is a generalized quantifier of type $t$ which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than $t$. This was proved for unary similarity (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  23
    On Generalized Quantifiers in Arithmetic.Carl Morgenstern - 1982 - Journal of Symbolic Logic 47 (1):187-190.
  44.  9
    Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-En-Provence, France, August 11-22, 1997, Revised Lectures.Jouko Vaananen - 1997 - Springer.
    This book comprises revised full versions of lectures given during the 9th European Summer School in Logic, Languages, and Information, ESSLLI'97, held in Aix-en-Provence, France, in August 1997. The six lectures presented introduce the reader to the state of the art in the area of generalized quantifiers and computation. Besides an introductory survey by the volume editor various aspects of generalized quantifiers are studied in depth.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  45.  8
    Partially-Ordered Generalized Quantifiers: A General Definition.G. Y. Sher - 1997 - Journal of Philosophical Logic 26 (1):1-43.
    Following Henkin's discovery of partially-ordered quantification with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  46.  23
    Decidability and Generalized Quantifiers.Andreas Baudisch (ed.) - 1980 - Akademie Verlag.
  47. Hierarchies of Monadic Generalized Quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
    A combinatorial criterium is given when a monadic quantifier is expressible by means of universe-independent monadic quantifiers of width n. It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the Hartig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48.  17
    A Double Team Semantics for Generalized Quantifiers.Antti Kuusisto - 2015 - Journal of Logic, Language and Information 24 (2):149-191.
    We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49.  6
    Forcing and Generalized Quantifiers.J. Krivine - 1973 - Annals of Mathematical Logic 5 (3):199.
  50. Natural Deduction for Generalized Quantifiers.van M. Lambalgen - 1996 - In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. pp. 54--225.
     
    Export citation  
     
    Bookmark   6 citations  
1 — 50 / 1000