2016
DOI: 10.1111/phpe.12086
|View full text |Cite
|
Sign up to set email alerts
|

An Argument For Necessitism*

Abstract: This paper presents a new argument for necessitism, the claim that necessarily everything is necessarily something. The argument appeals to principles about the metaphysics of quantification and predication which are best seen as constraints on reality's fineness of grain. I give this argument in section 4; the impatient reader may skip directly there. Sections 1-3 set the stage by surveying three other arguments for necessitism. I argue that none of them are persuasive, but I think it is illuminating to consi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
8
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…Furthermore, if we accept The Identity Identity , we can derive these principles from the following natural analogues of Booleanism for the quantifiers: trueleft(false(λv10vn.Afalse)false(λv1vn.ABfalse))(false(λv1vn.v0(A)false)false(λv1vn.v0(A)Bfalse))left(false(λv10vn.Afalse)false(λv1vn.ABfalse))(false(λv1vn.v0(A)false)false(λv1vn.v0(A)Bfalse)) (Here B is a formula in which v 0 does not occur free. See Dorr and J. Goodman for more on these “Adjunction” principles.) To get to S5, on the other hand, we would have to add something much less clearly well‐motivated, namely the ‐necessity of distinctness: false(xτyfalse)false((xτy)false)For arguments that Booleans should reject this principle, see see Bacon MS and J. Goodman MS.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, if we accept The Identity Identity , we can derive these principles from the following natural analogues of Booleanism for the quantifiers: trueleft(false(λv10vn.Afalse)false(λv1vn.ABfalse))(false(λv1vn.v0(A)false)false(λv1vn.v0(A)Bfalse))left(false(λv10vn.Afalse)false(λv1vn.ABfalse))(false(λv1vn.v0(A)false)false(λv1vn.v0(A)Bfalse)) (Here B is a formula in which v 0 does not occur free. See Dorr and J. Goodman for more on these “Adjunction” principles.) To get to S5, on the other hand, we would have to add something much less clearly well‐motivated, namely the ‐necessity of distinctness: false(xτyfalse)false((xτy)false)For arguments that Booleans should reject this principle, see see Bacon MS and J. Goodman MS.…”
mentioning
confidence: 99%
“…(Here B is a formula in which v 0 does not occur free. See Dorr and J. Goodman for more on these “Adjunction” principles.) To get to S5, on the other hand, we would have to add something much less clearly well‐motivated, namely the ‐necessity of distinctness: false(xτyfalse)false((xτy)false)For arguments that Booleans should reject this principle, see see Bacon MS and J. Goodman MS.…”
mentioning
confidence: 99%
“…We can discern two important routes along which higher‐order modal logic is taken to lead to necessitism (for a third one, see Goodman, 2016b). Both proceed via higher‐order necessitism, the view that necessarily all higher‐order properties, relations and propositions exist necessarily (a formal instance of which is: □∀ X □∃ Y ( X ≡ Y )).…”
Section: Higher‐order Metaphysics Of Modalitymentioning
confidence: 99%
“…We cannot take for granted that (λx.φ) can be faithfully glossed as is an x such that φ – i.e., that it is equivalent to (λy.x(x=yφ)). (Goodman (2016) makes a parallel point in reply to those like like Stalnaker (2012) who maintain that (λx.(λy.¬z(z=y))x)a=(λx.¬z(z=x))a(λy.¬z(z=y))a=¬z(z=a) is a counterexample to Reduction Congruence for a that only contingently exist.) This is important to keep in mind, since below we will consider the view of Bacon & Russell (2017) according to which not only does this equivalence fail, but the above argument would fail only at step (iii) were the λ‐terms involved replaced with their quantification‐involving counterparts.…”
mentioning
confidence: 99%