Recent methodological debates regarding the place of feasibility considerations in normative political theory are hindered for want of a rigorous model of the feasibility frontier. To address this shortfall, I present an analysis of feasibility that generalizes the economic concept of a production possibility frontier and then develop a rigorous model of the feasibility frontier using the familiar possible worlds technology. I then show that this model has significant methodological implications for political philosophy. On the Target View, a political ideal (...) presents a long-term goal for morally progressive reform efforts and, thus, serves as an important reference point for our specification of normative political principles. I use the model to show that we can- not reasonably expect that adopting political ideals as long-term reform objectives will guide us toward the realization of morally optimal feasible states of affairs. I conclude by proposing that political philosophers turn their attention to the analysis of actual social failures rather than political ideals. (shrink)

The principle of plenitude says that every material object coincides with abundantly many further objects that differ in their modal profiles. A necessarily unmanifested disposition is a disposition that necessarily does not manifest. This paper argues that if the principle of plenitude holds, then there are some necessarily unmanifested dispositions. These necessarily unmanifested dispositions will be argued to evade some objections against the cases of necessarily unmanifested dispositions put forward by Carrie Jenkins and Daniel Nolan.

Judgment aggregation studies how to aggregate individual judgments on logically correlated propositions into collective judgments. Different logics can be used in judgment aggregation, for which Dietrich and Mongin have proposed a generalized model based on general logics. Despite its generality, however, all nonmonotonic logics are excluded from this model. This paper argues for using nonmonotonic logic in judgment aggregation. Then it generalizes Dietrich and Mongin’s model to incorporate a large class of nonmonotonic logics. This generalization broadens the theoretical boundaries of (...) judgment aggregation by proving that, even if these nonmonotonic logics are employed, certain typical impossibility results still hold. (shrink)

The object of this paper is to examine two approaches to giving non-vacuous truth conditions for counterpossibles, counterfactuals with impossible antecedents. I first develop modifications of a Lewis-style sphere semantics with impossible worlds. I argue that this approach sanctions intuitively invalid inferences and is supported by philosophically problematic foundations. I then develop modifications of certain ceteris paribus conditional logics with impossible worlds. Tableaux are given for each of these in an appendix and soundness and completeness results are proved. While certain (...) of the latter systems are shown to have similar problems to logics from the first approach, at least one relatively weak system appears to offer an adequate uniform semantics for counterpossibles and counterfactuals. (shrink)

The object of this paper is to examine half and full connexive extensions of the basic regular conditional logic CR. Extensions of this system are of interest because it is among the strongest well-known systems of conditional logic that can be augmented with connexive theses without inconsistency resulting. These connexive extensions are characterized axiomatically and their relations to one another are examined proof-theoretically. Subsequently, algebraic semantics are given and soundness, completeness, and decidability are proved for each system. The semantics is (...) also used to establish independence results. Finally, a deontic interpretation of one of the systems is examined and defended. (shrink)

Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds (...) semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK. (shrink)

A world is trivial if it makes every proposition true all at once. Such a world is impossible, an absurdity. Our world, we hope, is not an absurdity. It is important, nevertheless, for semantic and metaphysical theories that we be able to reason cogently about absurdities—if only to see that they are absurd. In this note we describe methods for ‘observing’ absurd objects like the trivial world without falling in to incoherence, using some basic techniques from modal logic. The goal (...) is to begin to locate the trivial world’s relative position in modal space; the outcome is that the less we assume about relative possibility, the more detail we can discern at the edge of reason. (shrink)

We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Science using prototypes, plans, or schemata; formal semantics in natural language, especially the semantics of the `if-then' conditional construct; and the logic of subjunctive conditionals first developed using a possible worlds semantics by Stalnaker and Lewis. The basic premise of the paper is that both schema-based inference and the semantics of conditionals are based on (...) Dretske's notion of information flow and Barwise and Perry's notion of a constraint in situation semantics. That is, the connection between antecedent and consequent of a conditional `if were the case then would be the case' is an informational relation holding with respect to a pragmatically determined utterance situation. The bridge between AI and conditional logic is that a prototype or planning schema represents a situation type, and the background assumptions underlying the application of a schema in a situation correspond to channel conditions on the flow of information. Adapting the work of Stalnaker and Lewis, the semantics of conditionals is modeled by a refinement ordering on situations: a conditional `if then ' holds with respect to a situation if all the minimal refinements of the situation that support also support . We present new logics of situations, information flow, and subjunctive conditionals based on three-valued partial logic that formalizes our approach, and conclude with a discussion of the resulting theory of conditionals, including the "paradoxes" of conditional implication, the difference between truth conditions and assertability conditions for subjunctive conditionals, and the relationship between subjunctive and indicative conditionals. (shrink)

Necessity and sufficiency are the building blocks of all successful explanations. Yet despite their importance, these notions have been conceptually underdeveloped and inconsistently applied in explainable artificial intelligence, a fast-growing research area that is so far lacking in firm theoretical foundations. In this article, an expanded version of a paper originally presented at the 37th Conference on Uncertainty in Artificial Intelligence, we attempt to fill this gap. Building on work in logic, probability, and causality, we establish the central role of (...) necessity and sufficiency in XAI, unifying seemingly disparate methods in a single formal framework. We propose a novel formulation of these concepts, and demonstrate its advantages over leading alternatives. We present a sound and complete algorithm for computing explanatory factors with respect to a given context and set of agentive preferences, allowing users to identify necessary and sufficient conditions for desired outcomes at minimal cost. Experiments on real and simulated data confirm our method’s competitive performance against state of the art XAI tools on a diverse array of tasks. (shrink)

David Lewis has long defended an analysis of counterfactuals in terms of comparative similarity of possible worlds. The purpose of this paper is to reevaluate Lewis’s response to one of the oldest and most familiar objections to this proposal, the future similarity objection.

This paper formulates a general epistemological argument against what I call non-causal realism, generalizing domain specific arguments by Benacerraf, Field, and others. First I lay out the background to the argument, making a number of distinctions that are sometimes missed in discussions of epistemological arguments against realism. Then I define the target of the argument—non-causal realism—and argue that any non-causal realist theory, no matter the subject matter, cannot be given a reasonable epistemology and so should be rejected. Finally I discuss (...) and respond to several possible responses to the argument. In addition to clearing up and avoiding numerous misunderstandings of arguments of this kind that are quite common in the literature, this paper aims to present and endorse a rigorous and fully general epistemological argument against realism. (shrink)

Disagreeing with most authors on vagueness, the author proposes a solution that he calls ‘three-valued semantic pluralism’ to the age-old sorites paradox. In essence, it is a three-valued semantics for a first-order vague language with identity with the additional suggestion that a vague language has more than one correct interpretation. Unlike the traditional three-valued approach to a vague language, three-valued semantic pluralism can accommodate the phenomenon of higher-order vagueness and the phenomenon of penumbral connection when equipped with ‘suitable conditionals’. The (...) author also shows that three-valued semantic pluralism is a natural consequence of a restricted form of the Tolerance principle ) and a few related ideas, and argues that ) is well-motivated by considerations about how we learn, teach, and use vague predicates. (shrink)

Comparative syllogism is a type of scientific reasoning widely used, explicitly or implicitly, for inferences from observations to conclusions about effectiveness, but its philosophical significance has not been fully elaborated or appreciated. In its simplest form, the comparative syllogism derives a conclusion about the effectiveness of a factor (e.g. a treatment or an exposure) on a certain property via an experiment design using a test (experimental) group and a comparison (control) group. Our objective is to show that the comparative syllogism (...) can be understood as encoding a simulation view of counterfactuals, in that counterfactual situations are conceptual constructs that can be correctly simulated by homogeneous comparison groups. In this simulation view, the empirical data from the comparison groups play an evidential role in the evaluation of counterfactuals and in obtaining counterfactual knowledge. We further indicate how successful experimental designs can help us to obtain correct simulations, and thus to bring us to scientifically-empirically based counterfactual knowledge. (shrink)

I reply to Ahmed’s rejection (2011) of my argument (Walters 2009) that all counterfactuals with true antecedents and consequents are themselves true.

Is A & C sufficient for the truth of ‘if A were the case, C would be the case’? Jonathan Bennett thinks not, although the counterexample he gives is inconsistent with his own account of counterfactuals. In any case, I argue that anyone who accepts the case of Morgenbesser's coin, as Bennett does, should reject Bennett’s counterexample. Moreover, I show that the principle underlying his counterexample is unmotivated and indeed false. More generally, I argue that Morgenbesser’s coin commits us to (...) the sufficiency of A & C for the truth of the corresponding counterfactual. (shrink)

The consequence argument purports to show that determinism is true only if no one has free will. Judgments about whether the argument is sound depend on how one understands locutions of the form 'p and no one can render p false'. The main interpretation on offer appeals to counterfactual sufficiency: s can render p false just in case there is something s can do such that, were s to do it, p would be false; otherwise, s cannot render p false. (...) Here I show that, in the context of the consequence argument, this interpretation conflicts with widely endorsed principles governing the logic of counterfactuals. (shrink)

Abduction was first introduced in the epistemological context of scientific discovery. It was more recently analyzed in artificial intelligence, especially with respect to diagnosis analysis or ordinary reasoning. These two fields share a common view of abduction as a general process of hypotheses formation. More precisely, abduction is conceived as a kind of reverse explanation where a hypothesis H can be abduced from events E if H is a good explanation of E. The paper surveys four known schemes for abduction (...) that can be used in both fields. Its first contribution is a taxonomy of these schemes according to a common semantic framework based on belief revision. Its second contribution is to produce, for each non-trivial scheme, a representation theorem linking its semantic framework to a set of postulates. Its third contribution is to present semantic and axiomatic arguments in favor of one of these schemes, ordered abduction, which has never been vindicated in the literature. (shrink)

The debate over Hypothetical Syllogism is locked in stalemate. Although putative natural language counterexamples to Hypothetical Syllogism abound, many philosophers defend Hypothetical Syllogism, arguing that the alleged counterexamples involve an illicit shift in context. The proper lesson to draw from the putative counterexamples, they argue, is that natural language conditionals are context-sensitive conditionals which obey Hypothetical Syllogism. In order to make progress on the issue, I consider and improve upon Morreau’s proof of the invalidity of Hypothetical Syllogism. The improved proof (...) relies upon the semantic claim that conditionals with antecedents irrelevant to the obtaining of an already true consequent are themselves true. Moreover, this semantic insight allows us to provide compelling counterexamples to Hypothetical Syllogism that are resistant to the usual contextualist response. (shrink)

Are counterfactuals with true antecedents and consequents automatically true? That is, is Conjunction Conditionalization: if (X & Y), then (X > Y) valid? Stalnaker and Lewis think so, but many others disagree. We note here that the extant arguments for Conjunction Conditionalization are unpersuasive, before presenting a family of more compelling arguments. These arguments rely on some standard theorems of the logic of counterfactuals as well as a plausible and popular semantic claim about certain semifactuals. Denying Conjunction Conditionalization, then, requires (...) rejecting other aspects of the standard logic of counterfactuals, or else our intuitive picture of semifactuals. (shrink)

The morphological marking that distinguishes conditionals that are called “counterfactual” from those that are not, can also be found in other modal constructions, such as in the expression of wishes and oughts. We propose to call it “X-marking”. In this article, we lay out desiderata for a successful theory of X-marking and make some initial informal observations. Much remains to be done.

McCall (1984) offered a semantics of counterfactual conditionals based on “real possible worlds” that avoids using the vague notion of similarity between possible worlds. I will propose an interpretation of McCall’s counterfactuals in a formal framework based on Baltag-Moss-Solecki events and protocols. Moreover, I will argue that using this interpretation one can avoid an objection raised by Otte (1987).

In this paper I explore a version of standard (expected utility) decision theory in which the probability parameter is interpreted as an objective chance believed by agents to obtain and values of this parameter are fixed by indicative conditionals linking possible actions with possible outcomes. After reviewing some recent developments centering on the common-cause counterexamples to the standard approach, I introduce and briefly discuss the key notions in my own approach. (This approach has essentially the same results as the causal (...) approach in common-cause cases.) I then discuss the Rule of Dominance and find, in the context of the present proposal, that it cannot serve as an independent source of action justification. Turning next to Newcomb''s Problem, I argue that the much discussed issue of back-tracking counterfactuals is something of a red herring for decision theory. Once the twin distractions of back-tracking counterfactuals and Dominance Reasoning are set aside the 1-box solution emerges as a natural consequence of the present proposal. It is of interest that this proposal agrees with the causal approach in the standard common-cause examples and the expected-utility approach in the Newcomb case: one can be smart and rich and keep on smoking. (shrink)

In Spanish (and other Romance languages) certain predicates select the subjunctive mood in the embedded clause, while others select the indicative mood. In this paper, I present a new analysis for the predicates that select the subjunctive mood in Spanish that is based on a semantics of comparison. The main generalization proposed here is the following: in Spanish, a predicate selects the subjunctive mood in its embedded proposition if the proposition is compared to its contextual alternatives on a scale introduced (...) by the predicate. In this proposal, predicates that select the subjunctive mood are thus analyzed as gradable predicates. Furthermore, the subjunctive mood morpheme is claimed to make a semantic contribution, namely to evaluate the contextual alternatives that are compared by the predicate. In comparing this proposal to other approaches, I show that it can more straightforwardly account for a number of properties of these predicates (entailment relations, practical inferences, and contexts with more than two alternatives). New empirical evidence for two crucial properties of the predicates that select the subjunctive mood is provided: these predicates are focus sensitive and they are gradable, two properties that follow directly from the proposal developed here. In the vast literature on mood, the link between the appearance of the subjunctive mood and these important properties has never been made before. (shrink)

In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...) implementation. Having a clear list of the desired inferences right from the beginning makes it possible to refine the properties of the system step by step until its completion. I distinguish and detail seven advantages of the usage of TDD for the conception of a logical theory. Most importantly, this methodology increases the predictability of the inferential power of the theory. A second important benefit is that the time required for the conception of the logic goes down dramatically. This methodology will change both ideas and practices. Logic is no longer considered to be a formal science, but rather to be an empirical one. Research in the field is geared toward specific and concrete goals. Programs are considered tools used to verify the conformity of formal theories. To sum up, I defend the view that, in some situations, this way of designing a formal system brings significant benefits, and that the construction of new logics can be conducted similarly to the development of open source software. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

How can we use models to understand real phenomena if models misrepresent the very phenomena we seek to understand? Some accounts suggest that models may afford understanding by providing causal knowledge about phenomena via how-possibly explanations. However, general equilibrium models, for example, pose a challenge to this solution since their contribution appears to be purely mathematical results. Despite this, practitioners widely acknowledge that it improves our understanding of the world. I argue that the Arrow–Debreu model provides a mathematical how-possibly explanation (...) which establishes claims of mathematical dependence. The account developed reveals how mathematical knowledge can inform claims about the world, allow ‘what-if-things-had-been-different’ inferences, and thus improve our understanding. (shrink)

This paper provides an update semantics for counterfactual conditionals. It does so by giving a dynamic twist to the ‘Premise Semantics’ for counterfactuals developed in Veltman (1976) and Kratzer (1981). It also offers an alternative solution to the problems with naive Premise Semantics discussed by Angelika Kratzer in ‘Lumps of Thought’ (Kratzer, 1989). Such an alternative is called for given the triviality results presented in Kanazawa et al. (2005, this issue).

InSuppose and Tell, Williamson makes a new and original attempt to defend the material conditional account of indicative conditionals. His overarching argument is that this account offers the best explanation of the data concerning how people evaluate and use such conditionals. We argue that Williamson overlooks several important alternative explanations, some of which appear to explain the relevant data at least as well as, or even better than, the material conditional account does. Along the way, we also show that Williamson (...) errs at important junctures about what exactly the relevant data are. (shrink)

The best arguments for possible worlds as states of affairs furnish us with equally good arguments for impossible worlds of the same sort. I argue for a theory of impossible worlds on which the impossible worlds correspond to maximal inconsistent classes of propositions. Three objections are rejected. In the final part of the paper, I present a menu of impossible worlds and explore some of their interesting formal properties.

In this paper, Universal any and Negative Polarity Item any are uniformly analyzed as ‘counterfactual’ donkey sentences (in disguise). Their difference in meaning is reduced here to the distinction between strong and weak readings of donkey sentences. It is shown that this explains the universal and existential character of Universal- and NPI-any, respectively, and the positive and negative contexts in which they are licensed. Our uniform analysis extends to the use of any in command and permission sentences. It predicts that (...) whereas the use of any in permission sentences is licensed and gives rise to a universal reading, it is not licensed in command sentences. (shrink)

Causal eliminativists maintain that all causal talk is false. The prospects for such a view seem to be stymied by an indispensability argument, charging that any agent must distinguish between effective and ineffective strategies, and that such a distinction must commit that agent to causal notions. However, this argument has been under-explored. The contributions of this paper are twofold: first, I provide a thorough explication of the indispensability argument and the various ways it might be defended. Second, I point to (...) an important limitation in the argument and suggest that it does not give us sufficient reason to reject eliminativism. In support of this last claim, I show that the distinction between effective and ineffective strategies could perfectly well be grounded in a counterfactual rather than a causal decision theory and argue that there are fully adequate explanations of how we could come to make the requisite counterfactual judgments that need not invoke causal concepts. (shrink)

Conditional learning, where agents learn a conditional sentence ‘If A, then B,’ is difficult to incorporate into existing Bayesian models of learning. This is because conditional learning is not uniform: in some cases, learning a conditional requires decreasing the probability of the antecedent, while in other cases, the antecedent probability stays constant or increases. I argue that how one learns a conditional depends on the causal structure relating the antecedent and the consequent, leading to a causal model of conditional learning. (...) This model extends traditional Bayesian learning by incorporating causal models into agents’ epistemic states. On this theory, conditional learning proceeds in two steps. First, an agent learns a new causal model with the appropriate relationship between the antecedent and the consequent. Then, the agent narrows down the set of possible worlds to include only those which make the conditional proposition true. This model of learning can incorporate both standard cases of Bayesian learning and the non-uniform learning required to learn conditional information. (shrink)

According to Adams, the acceptability of an indicative conditional goes with the conditional probability of the consequent given the antecedent. However, some conditionals seem to be inappropriate, although their corresponding conditional probability is high. These are cases with a missing link between antecedent and consequent. Other conditionals are appropriate even though the conditional probability is low. Finally, we have the so-called biscuit conditionals. In this paper we will generalize analyses of Douven and others to account for the appropriateness of conditionals (...) in terms of evidential support. Our generalization involves making use of Value, or intensity. We will show how this generalization helps to account for biscuit conditionals and conditional threats and promises. Finally, a link is established between this analysis of conditionals and an analysis of generic sentences. (shrink)

Causal models show promise as a foundation for the semantics of counterfactual sentences. However, current approaches face limitations compared to the alternative similarity theory: they only apply to a limited subset of counterfactuals and the connection to counterfactual logic is not straightforward. This article addresses these difficulties using exogenous interventions, where causal interventions change the values of exogenous variables rather than structural equations. This model accommodates judgments about backtracking counterfactuals, extends to logically complex counterfactuals, and validates familiar principles of counterfactual (...) logic. This combines the interventionist intuitions of the causal approach with the logical advantages of the similarity approach. (shrink)

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

The current trend in knowledge revision in the Dynamic Epistemic Logic tradition focuses on the addition of new knowledge, rather than the possibility of losing knowledge. Yet there are natural situations, such as an agent who does not want another agent to know that she knows a certain piece of information, where there is a need to be able to model the retraction of a proposition from a knowledge base. One situation where this is systematically required is the variant of (...) the medieval theory of obligationes known as dubitatio, where one of the agents in the dialogue is obliged to hold the initial proposition, the dubitatum, as doubtful, regardless of what other propositions she may concede or deny during the disputation. In this paper, we use dubitatio as a motivation for studying deceitful agents, and we discuss various ways that an agent can move from a model where f is known to one where f is not known. (shrink)

This paper discusses a set of observations, many of which are novel, concerning differences between the adjectival modals _certain_ and _possible_ and their adverbial counterparts _certainly_ and _possibly_. It argues that the observations can be derived from a standard interpretation of _certain_/_certainly_ as universal and _possible_/_possibly_ as existential quantifiers over possible worlds, in conjunction with the hypothesis that the adjectives quantify over knowledge and the adverbs quantify over belief. The claims on which the argument relies include the following: (i) knowledge (...) implies belief, (ii) agents have epistemic access to their belief, (iii) relevance is closed under speakers’ belief, and (iv) commitment is pragmatically inconsistent with explicit denial of belief. (shrink)

Proper functionalism claims that a belief has epistemic warrant only if it’s formed according to the subject’s truth-aimed cognitive design plan. The most popular putative counter-examples to proper functionalism all involve agents who form beliefs in seemingly warrant-enabling ways that don’t appear to proceed according to any sort of design. The Swampman case is arguably the most famous scenario of this sort. However, some proper functionalists accept that subjects like Swampman have warrant, opting instead to adopt a non-standard account of (...) design. But critics of proper functionalism hold that this strategy comes at a high cost: the design-plan condition now seems explanatorily superfluous. James Taylor construes cases like Swampman as posing a dilemma for the proper functionalist: either deny warrant in these cases and concede that proper functionalism doesn’t capture our intuitions, or affirm warrant and undermine the explanatory power of the design-plan condition. Proper functionalists have replied to both horns of this dilemma. Recently, Kenny Boyce and Andrew Moon have argued that warrant-affirming intuitions on cases like Swampman are motivated by a principle that has a clear counter-example. Also, Alvin Plantinga presents a set of cases that supposedly cause problems for any analysis of warrant that lacks a design-plan condition. In this essay, I present a counter-argument to Boyce and Moon’s argument, and show that a more robust reliability condition can accommodate Plantinga’s problem cases. I conclude that we’re left with no good reason to doubt that cases like Swampman raise a troubling dilemma for the proper functionalist. (shrink)

The generality problem is one of the most pressing challenges for reliabilism. The problem begins with this question: of all the process types exemplified by a given process token, which types are the relevant ones for determining whether the resultant belief counts as knowledge? As philosophers like Earl Conee and Richard Feldman have argued, extant responses to the generality problem have failed, and it looks as if no solution is forthcoming. In this paper, I present a new response to the (...) generality problem that illuminates the nature of knowledge-enabling reliability. My response builds upon the insights of Juan Comesaña’s well-founded solution to the generality problem, according to which relevant types are content–evidence pairs, i.e., descriptions of both the target belief’s content and the evidence on which the belief was based. While most responses to the generality problem, including Comesaña’s, only posit one relevant type for any given process token, I argue that knowledge-enabling reliability requires a process token to be reliable with respect to multiple content–evidence pairs, each with varying degrees of descriptive specificity. I call this solution multi-type evidential reliabilism. After offering a clear formulation of MTE, I conclude by arguing that MTE is sufficiently informative to rebut Conee and Feldman’s generality problem objection to a reliability condition on knowledge. (shrink)