Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Michael Glanzberg (2006). Context and Unrestricted Quantification. In Michael Glanzberg (ed.). Oxford University Press.Quantification is haunted by the specter of paradoxes. Since Russell, it has been a persistent idea that the paradoxes show what might have appeared to be absolutely unrestricted quantification to be somehow restricted. In the contemporary literature, this theme is taken up by Dummett (1973, 1993) and Parsons (1974a,b). Parsons, in particular, argues that both the Liar and Russell’s paradoxes are to be resolved by construing apparently absolutely unrestricted quantifiers as appropriately restricted.
Discussion of Michael Glanzberg, Context and unrestricted quantification
Nothing in this forum yet.
Similar books and articles
Call a quantifier unrestricted if it ranges over absolutely all things: not just over all physical things or all things relevant to some particular utterance or discourse but over absolutely everything there is. Prima facie, unrestricted quantification seems to be perfectly coherent. For such quantification appears to be involved in a variety of claims that all normal human beings are capable of understanding. For instance, some basic logical and mathematical truths appear to involve unrestricted quantification, such as the truth that (...)
I present a puzzle for absolutely unrestricted quantification. One important advantage of absolutely unrestricted quantification is that it allows us to entertain perfectly general theories. Whereas most of our theories restrict attention to one or another parcel of reality, other theories are genuinely comprehensive taking absolutely all objects into their domain. The puzzle arises when we notice that absolutely unrestricted theories sometimes impose incompatible constraints on the size of the universe.
No categories
Many of those who accept the universalist thesis that mereological composition is unrestricted also maintain that the folk typically restrict their quantifiers in such a way as to exclude strange fusions when they say things that appear to conflict with universalism. Despite its prima facie implausibility, there are powerful arguments for universalism. By contrast, there is remarkably little evidence for the thesis that strange fusions are excluded from the ordinary domain of quantification. Furthermore, this reconciliatory strategy seems hopeless when applied (...)
Many of those who accept the universalist thesis that mereological composition is unrestricted also maintain that the folk typically restrict their quantifiers in such a way as to exclude strange fusions when they say things that appear to conflict with universalism. Despite its prima facie implausibility, there are powerful arguments for universalism. By contrast, there is remarkably little evidence for the thesis that strange fusions are excluded from the ordinary domain of quantification. Furthermore, this reconciliatory strategy seems hopeless when applied (...)
Curry's paradox, so named for its discoverer, namely Haskell B. Curry, is a paradox within the family of so-called paradoxes of self-reference (or paradoxes of circularity). Like the liar paradox (e.g., ‘this sentence is false’) and Russell's paradox , Curry's paradox challenges familiar naive theories, including naive truth theory (unrestricted T-schema) and naive set theory (unrestricted axiom of abstraction), respectively. If one accepts naive truth theory (or naive set theory), then Curry's paradox becomes a direct challenge to one's theory of (...)
There are four broad grounds upon which the intelligibility of quantification over absolutely everything has been questioned—one based upon the existence of semantic indeterminacy, another on the relativity of ontology to a conceptual scheme, a third upon the necessity of sortal restriction, and the last upon the possibility of indefinite extendibility. The argument from semantic indeterminacy derives from general philosophical considerations concerning our understanding of language. For the Skolem–Lowenheim Theorem appears to show that an understanding of quanti- fication over absolutely (...)


