Modal knowledge accounts that are based on standards possible-worlds semantics face well-known problems when it comes to knowledge of necessities. Beliefs in necessities are trivially sensitive and safe and, therefore, trivially constitute knowledge according to these accounts. In this paper, I will first argue that existing solutions to this necessity problem, which accept standard possible-worlds semantics, are unsatisfactory. In order to solve the necessity problem, I will utilize an unorthodox account of counterfactuals, as proposed by Nolan, on which we also (...) consider impossible worlds. Nolan’s account for counterpossibles delivers the intuitively correct result for sensitivity i.e. S’s belief is sensitive in intuitive cases of knowledge of necessities and insensitive in intuitive cases of knowledge failure. However, we acquire the same plausible result for safety only if we reject his strangeness of impossibility condition and accept the modal closeness of impossible worlds. In this case, the necessity problem can be analogously solved for sensitivity and safety. For some, such non-moderate accounts might come at too high a cost. In this respect, sensitivity is better off than safety when it comes to knowing necessities. (shrink)

The standard Lewis–Stalnaker semantics of counterfactuals, given the Strong Centering Thesis, implies that all true–true counterfactuals are trivially true. McGlynn developed a theory, based on Penczek, to rehabilitate the non-triviality of true–true counterfactuals. I show here that counterfactuals with true but irrelevant components are counterexamples to McGlynn’s account. I argue that an extended version of the connection hypothesis is sustainable, and grounds a full theory of counterfactuals explicable in a broadly standard way, if an indispensable asymmetry between semifacuals and other (...) counterfactuals is acknowledged. (shrink)

According to the Simple Conditional Analysis of disposition ascriptions, disposition ascriptions are to be analyzed in terms of counterfactual conditionals. The Simple Conditional Analysis is notoriously vulnerable to counterexamples. In this paper, I introduce a new sort of counterexample to the Simple Conditional Analysis of disposition ascriptions, which I call ‘tricks’. I then explore a number of possible strategies to modify the Simple Conditional Analysis so as to avoid tricks and conclude that, in order to avoid tricks, the associated counterfactual (...) should be evaluated at the closest possible world at which the manifestation of the disposition does not obtain. (shrink)