- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Conservative generalized quantifiers and presupposition
Abstract
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.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - 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.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
On the expressive power of monotone natural language quantifiers over finite models.Jouko Väänänen & Dag Westerståhl - 2002 - Journal of Philosophical Logic 31 (4):327-358.
Analytics
Added to PP
2009-01-28
Downloads
90 (#182,396)
6 months
4 (#657,928)
2009-01-28
Downloads
90 (#182,396)
6 months
4 (#657,928)
Historical graph of downloads
Citations of this work
Proof-theoretic semantics for a natural language fragment.Nissim Francez & Roy Dyckhoff - 2010 - Linguistics and Philosophy 33 (6):447-477.
Situations as indices and as denotations.Tim Fernando - 2009 - Linguistics and Philosophy 32 (2):185-206.
References found in this work
Adverbs of quantification.David K. Lewis - 1975 - In Edward Louis Keenan (ed.), Formal semantics of natural language: papers from a colloquium sponsored by the King's College Research Centre, Cambridge. New York: Cambridge University Press. pp. 3--15.
A semantic characterization of natural language determiners.Edward L. Keenan & Jonathan Stavi - 1986 - Linguistics and Philosophy 9 (3):253 - 326.
Logic with the quantifier “there exist uncountably many”.H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1-93.
A Language and Axioms for Explicit Mathematics.Solomon Feferman, J. N. Crossley, Maurice Boffa, Dirk van Dalen & Kenneth Mcaloon - 1984 - Journal of Symbolic Logic 49 (1):308-311.
Weak vs. strong Readings of donkey sentences and monotonicity inference in a dynamic setting.Makoto Kanazawa - 1994 - Linguistics and Philosophy 17 (2):109 - 158.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-v4fj8 uwo