Search results for 'generalized quantifiers' (try it on Scholar)

1000+ found
Sort by:
  1. Noun Phrases & Generalized Quantifiers (1987). Jon Barwise. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 31--1.score: 540.0
    No categories
     
    My bibliography  
     
    Export citation  
  2. Branching Generalized Quantifiers (1987). Dag Westerstahl. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 269.score: 540.0
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  3. Peter Fritz (2013). Modal Ontology and Generalized Quantifiers. Journal of Philosophical Logic 42 (4):643-678.score: 240.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Wiebe Van Der Hoek & Maarten De Rijke (1993). Generalized Quantifiers and Modal Logic. Journal of Logic, Language and Information 2 (1):19-58.score: 240.0
    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)  
     
    My bibliography  
     
    Export citation  
  5. Jakub Szymanik (2009). Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. Dissertation, University of Amsterdamscore: 240.0
    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 (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  6. Hanoch Ben-Yami (2009). Generalized Quantifiers, and Beyond. Logique Et Analyse (208):309-326.score: 240.0
    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 (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Fredrik Engström (2012). Generalized Quantifiers in Dependence Logic. Journal of Logic, Language and Information 21 (3):299-324.score: 240.0
    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 (8 more)  
     
    My bibliography  
     
    Export citation  
  8. Livio Robaldo (2010). Independent Set Readings and Generalized Quantifiers. Journal of Philosophical Logic 39 (1):23-58.score: 240.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Lauri Hella, Jouko Väänänen & Dag Westerståhl (1997). Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6 (3):305-335.score: 240.0
    We study generalized quantifiers on finite structures.With every function : we associate a quantifier Q by letting Q x say there are at least (n) elementsx satisfying , where n is the sizeof the universe. This is the general form ofwhat is known as a monotone quantifier of type .We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  10. Juha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.score: 240.0
    We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier $\sQ_1$ is definable in terms of another quantifier $\sQ_2$, the base logic being monadic second-order logic, reduces to the question if a quantifier $\sQ^{\star}_1$ is definable in $\FO(\sQ^{\star}_2,<,+,\times)$ for certain first-order quantifiers $\sQ^{\star}_1$ and $\sQ^{\star}_2$. We use our characterization to show new definability and non-definability results for second-order generalized quantifiers. In particular, we show that the monadic second-order (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  11. Dorit Ben Shalom (2003). One Connection Between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers. Journal of Logic, Language and Information 12 (1):47-52.score: 240.0
    The language of standard propositional modal logic has one operator (? or ?), that can be thought of as being determined by the quantifiers ? or ?, respectively: for example, a formula of the form ?F is true at a point s just in case all the immediate successors of s verify F.This paper uses a propositional modal language with one operator determined by a generalized quantifier to discuss a simple connection between standard invariance conditions on modal formulas (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Dorit Ben Shalom (2003). One Connection Between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers. Journal of Logic, Language and Information 12 (1):47-52.score: 240.0
    The language of standard propositional modal logic has one operator ( or ), that can be thought of as being determined by the quantifiers or , respectively: for example, a formula of the form is true at a point s just in case all the immediate successors of s verify .This paper uses a propositional modal language with one operator determined by a generalized quantifier to discuss a simple connection between standard invariance conditions on modal formulas and (...) quantifiers: the combined generalized quantifier conditions of conservativity and extension correspond to the modal condition of invariance under generated submodels, and the modal condition of invariance under bisimulations corresponds to the generalized quantifier being a Boolean combination of and. (shrink)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Georg Gottlob (1997). Relativized Logspace and Generalized Quantifiers Over Finite Ordered Structures. Journal of Symbolic Logic 62 (2):545-574.score: 240.0
    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 (6 more)  
     
    My bibliography  
     
    Export citation  
  14. Wiebe Hoek & Maarten Rijke (1993). Generalized Quantifiers and Modal Logic. Journal of Logic, Language and Information 2 (1):19-58.score: 240.0
    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)  
     
    My bibliography  
     
    Export citation  
  15. Jakub Szymanik (2010). Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language. Linguistics and Philosophy 33 (3):215-250.score: 216.0
    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 (9 more)  
     
    My bibliography  
     
    Export citation  
  16. Martin van den Berg (1996). Dynamic Generalized Quantifiers. In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. 63--94.score: 216.0
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  17. Per Lindström (1966). First Order Predicate Logic with Generalized Quantifiers. Theoria 32:186--195.score: 210.0
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  18. C. T. Mcmillan, R. Clark, P. Moore, C. Devita & M. Grossman (2005). Neural Basis for Generalized Quantifiers Comprehension. Neuropsychologia 43:1729--1737.score: 210.0
  19. Jouko Vaananen (1997). 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. Springer.score: 210.0
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  20. Lauri Hella, Kerkko Luosto & Jouko Väänänen (1996). The Hierarchy Theorem for Generalized Quantifiers. Journal of Symbolic Logic 61 (3):802-817.score: 208.0
    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 (7 more)  
     
    My bibliography  
     
    Export citation  
  21. Kerkko Luosto (2012). On Vectorizations of Unary Generalized Quantifiers. Archive for Mathematical Logic 51 (3-4):241-255.score: 204.0
    Vectorization of a class of structures is a natural notion in finite model theory. Roughly speaking, vectorizations allow tuples to be treated similarly to elements of structures. The importance of vectorizations is highlighted by the fact that if the complexity class PTIME corresponds to a logic with reasonable syntax, then it corresponds to a logic generated via vectorizations by a single generalized quantifier (Dawar in J Log Comput 5(2):213–226, 1995). It is somewhat surprising, then, that there have been few (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  22. Juha Kontinen (2004). Definability of Second Order Generalized Quantifiers. Dissertation, score: 192.0
    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 (3 more)  
     
    My bibliography  
     
    Export citation  
  23. John Nerbonne (1995). Nominal Comparatives and Generalized Quantifiers. Journal of Logic, Language and Information 4 (4):273-300.score: 188.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  24. Dag Westerståhl (1989). Aristotelian Syllogisms and Generalized Quantifiers. Studia Logica 48 (4):577-585.score: 180.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Edward L. Keenan (1993). Natural Language, Sortal Reducibility and Generalized Quantifiers. Journal of Symbolic Logic 58 (1):314-325.score: 180.0
    Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  26. Robin Clark (2011). Generalized Quantifiers and Number Sense. Philosophy Compass 6 (9):611-621.score: 180.0
    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)  
     
    My bibliography  
     
    Export citation  
  27. J. Atlas (1996). 'Only' Noun Phrases, Pseudo-Negative Generalized Quantifiers, Negative Polarity Items, and Monotonicity. Journal of Semantics 13 (4):265-328.score: 180.0
    The theory of Generalized Quantifiers has facilitated progress in the study of negation in natural language. In particular it has permitted the formulation of a DeMorgan taxonomy of logical strength of negative Noun Phrases (Zwarts 1996a,b). It has permitted the formulation of broad semantical generalizations to explain grammatical phenomena, e.g. the distribution of Negative Polarity Items (Ladusaw 1980; Linebarger 1981, 1987, 1991; Hoeksema 1986, 1995; Zwarts 1996a,b; Horn 1992, 1996b). In the midst of this theorizing Jaap Hoepelman invited (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. Tim Fernando, Conservative Generalized Quantifiers and Presupposition.score: 180.0
    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  
     
    My bibliography  
     
    Export citation  
  29. G. Y. Sher (1997). Partially-Ordered (Branching) Generalized Quantifiers: A General Definition. [REVIEW] Journal of Philosophical Logic 26 (1):1-43.score: 180.0
    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)  
     
    My bibliography  
     
    Export citation  
  30. Juha Kontinen (2006). The Hierarchy Theorem for Second Order Generalized Quantifiers. Journal of Symbolic Logic 71 (1):188 - 202.score: 180.0
    We study definability of second order generalized quantifiers on finite structures. Our main result says that for every second order type t there exists a second order generalized quantifier of type t which is not definable in the extension of second order logic by all second order generalized quantifiers of types lower than t.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Johan Van Benthem & Alice Ter Meulen (eds.) (1984). Generalized Quantifiers in Natural Language. Foris Publications.score: 180.0
    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) ...
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  32. Robin Cooper (1987). Preliminaries to the Treatment of Generalized Quantifiers in Situation Semantics. In. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 73--91.score: 180.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  33. Renato H. L. Pedrosa & Antonio M. A. Sette (1988). A Representation Theorem for Languages with Generalized Quantifiers Through Back-and-Forth Methods. Studia Logica 47 (4):401 - 411.score: 180.0
    We obtain in this paper a representation of the formulae of extensions ofL by generalized quantifiers through functors between categories of first-order structures and partial isomorphisms. The main tool in the proofs is the back-and-forth technique. As a corollary we obtain the Caicedo's version of Fraïssés theorem characterizing elementary equivalence for such languages. We also discuss informally some geometrical interpretations of our results.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  34. Dag Westerståhl (1987). Branching Generalized Quantifiers and Natural Language. In. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 269--298.score: 180.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  35. Peter Gdrdenfors (1987). Generalized Quantifiers and Plurals1. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 31--151.score: 180.0
    No categories
     
    My bibliography  
     
    Export citation  
  36. Lars G. Johnsen (1987). There-Sentences and Generalized Quantifiers. In. In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. 93--107.score: 180.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  37. Kees van Deemter (1984). Generalized Quantifiers: Finite Versus Infinite. In Johan Van Benthem & Alice Ter Meulen (eds.), Generalized Quantifiers in Natural Language. Foris Publications.score: 180.0
    No categories
     
    My bibliography  
     
    Export citation  
  38. S. Lappin (1996). Generalized Quantifiers, Exception Phrases, and Logicality. Journal of Semantics 13 (3):197-220.score: 176.0
    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 (9 more)  
     
    My bibliography  
     
    Export citation  
  39. Jon Barwise & Robin Cooper (1981). Generalized Quantifiers and Natural Language. Linguistics and Philosophy 4 (2):159--219.score: 162.0
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  40. Nina Gierasimczuk, Muddy Children, Generalized Quantifiers and Internal Complexity.score: 162.0
    This paper generalizes Muddy Children puzzle to account for a large class of possible public announcements with various quantifiers. We identify conditions for solvability of the extended puzzle, with its classical version as a particular case. The characterization suggests a novel way of modeling multi-agent epistemic reasoning. The framework is based on the concept of number triangle. The advantage of our approach over more general formalizations in epistemic logics, like Dynamic Epistemic Logic, is that it gives models of linear (...)
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  41. Risto Kaila (2002). Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers. Mathematical Logic Quarterly 48 (2):301-320.score: 162.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  42. Dag Westerståhl (2008). Decomposing Generalized Quantifiers. Review of Symbolic Logic 1 (3):355-371.score: 156.0
    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 (8 more)  
     
    My bibliography  
     
    Export citation  
  43. Kerkko Luosto (2000). Hierarchies of Monadic Generalized Quantifiers. Journal of Symbolic Logic 65 (3):1241-1263.score: 156.0
    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 (7 more)  
     
    My bibliography  
     
    Export citation  
  44. Xavier Caicedo (1995). Hilbert's Ε-Symbol in the Presence of Generalized Quantifiers. In. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. 63--78.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. Heinz-Dieter Ebbinghaus (1995). On the Model Theory of Some Generalized Quantifiers. In. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. 25--62.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  46. van M. Lambalgen (1996). Natural Deduction for Generalized Quantifiers. In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University. 54--225.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. Martin Otto (1992). EM Constructions for a Class of Generalized Quantifiers. Archive for Mathematical Logic 31 (5):355-371.score: 156.0
    We consider a class of Lindström extensions of first-order logic which are susceptible to a natural Skolemization procedure. In these logics Ehrenfeucht Mostowski (EM) functors for theories with arbitrarily large models can be obtained under suitable restrictions. Characteristic dependencies between algebraic properties of the quantifiers and the maximal domains of EM functors are investigated.Results are applied to Magidor Malitz logic,L(Q <ω), showing e.g. its Hanf number to be equal to ℶω(ℵ1) in the countably compact case. Using results of Baumgartner, (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  48. Alexandre G. Pinus (1995). Generalized Quantifiers in Algebra. In. In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. 215--228.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  49. Natasha Alechina (1995). On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic. Journal of Logic, Language and Information 4 (3):177-189.score: 154.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  50. J. A. G. Groenendijk, Dick de Jongh & M. J. B. Stokhof (eds.) (1986/1987). Studies in Discourse Representation Theory and the Theory of Generalized Quantifiers. Foris Publications.score: 154.0
    Semantic Automata Johan van Ben them. INTRODUCTION An attractive, but never very central idea in modern semantics has been to regard linguistic expressions ...
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000