- 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
Are Quantifier Phrases Always Quantificational? The Case of 'Every F'
Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 20 (2):143-172 (2013)
Abstract
This paper argues that English quantifier phrases of the form ‘every F’ admit of a literal referential interpretation, contrary to the standard semantic account of this expression, according to which it denotes a set and a second-order relation. Various arguments are offered in favor of the referential interpretation, and two likely objections to it are forestalled.Author's Profile
My notes
Similar books and articles
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.
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.
One Connection between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers.Dorit Ben Shalom - 2003 - Journal of Logic, Language and Information 12 (1):47-52.
Domain restriction and the arguments of quantificational determiners.Anastasia Giannakidou - manuscript
Generalized quantifiers and modal logic.Wiebe Van Der Hoek & Maarten De Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Nominal comparatives and generalized quantifiers.John Nerbonne - 1995 - Journal of Logic, Language and Information 4 (4):273-300.
The hierarchy theorem for generalized quantifiers.Lauri Hella, Kerkko Luosto & Jouko Väänänen - 1996 - Journal of Symbolic Logic 61 (3):802-817.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
On the definability of the quantifier “there exist uncountably many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.
Unary quantifiers on finite models.Jouko Väänänen - 1997 - Journal of Logic, Language and Information 6 (3):275-304.
Analytics
Added to PP
2013-05-29
Downloads
0
6 months
0
2013-05-29
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Author's Profile
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-5ff6c685cb-cc9fg uwo