ABSTRACT Drawing inspiration from Fred Dretske, L. S. Carrier, John A. Barker, and Robert Nozick, we develop a tracking analysis of knowing according to which a true belief constitutes knowledge if and only if it is based on reasons that are sensitive to the fact that makes it true, that is, reasons that wouldn’t obtain if the belief weren’t true. We show that our sensitivity analysis handles numerous Gettier-type cases and lottery problems, blocks pathways leading to skepticism, and validates the (...) epistemic closure thesis that correct inferences from known premises yield knowledge of the conclusions. We discuss the plausible views of Ted Warfield and Branden Fitelson regarding cases of knowledge acquired via inference from false premises, and we show how our sensitivity analysis can account for such cases. We present arguments designed to discredit putative counterexamples to sensitivity analyses recently proffered by Tristan Haze, John Williams and Neil Sinhababu, which involve true statements made by untrustworthy informants and strange clocks that sometimes display the correct time while running backwards. Finally, we show that in virtue of employing the paradox-free subjunctive conditionals codified by Relevance Logic theorists instead of the paradox-laden subjunctive conditionals codified by Robert Stalnaker and David Lewis. (shrink)

This paper is an experiment in Leibnizian analysis. The reader will recall that Leibniz considered all true sentences to be analytically so. The difference, on his account, between necessary and contingent truths is that sentences reporting the former are finitely analytic; those reporting the latter require infinite analysis of which God alone is capable. On such a view at least two competing conceptions of entailment emerge. According to one, a sentence entails another when the set of atomic requirements for the (...) first is included in the corresponding set for the other; according to the other conception, every atomic requirement of the entailed sentence is underwritten by an atomic constituent of the entailing one. The former conception is classical on the twentieth century understanding of the term; the latter is the one we explore here. Now if we restrict ourselves to the formal language of the propositional calculus, every sentence has a finite analysis into its conjunctive normal form. Semantically, then, every sentence of that language can be represented as a simple hypergraph, H, on the powerset of a universe of states. Entailment of the sort we wish to study can be represented as a known relation, subsumption between hypergraphs. Since the lattice of hypergraphs thus ordered is a DeMorgan lattice, the logic of entailment thus understood is the familiar system, FDE of first-degree entailment. We observe that, extensionalized, the relation of subsumption is itself a DeMorgan Lattice ordered by higher-order subsumption. Thus the semantic idiom that hypergraph-theory affords reveals a hierarchy of lattices capable of representing entailments of every finite degree. (shrink)

A system FDQ of first degree entailment with quantification, extending classical quantification logic Q by an entailment connective, is axiomatised, and the choice of axioms defended and also, from another viewpoint, criticised. The system proves to be the equivalent to the first degree part of the quantified entailmental system EQ studied by Anderson and Belnap; accordingly the semantics furnished are alternative to those provided for the first degree of EQ by Belnap. A worlds semantics for FDQ is presented, and the (...) soundness and completeness of FDQ proved, the main work of the paper going into the proof of completeness. The adequacy result is applied to yield, as well as the usual corollaries, weak relevance of FDQ and the fact that FDQ is the common first degree of a wide variety of (constant domain) quantified relevant logics. Finally much unfinished business at the first degree is discussed. (shrink)

A logic is a pair (P,Q) where P is a set of formulas of a fixed propositional language and Q is a set of rules. A formula is deducible from X in the logic (P, Q) if it is deducible from XP via Q. A matrix is strongly adequate to (P, Q) if for any , X, is deducible from X iff for every valuation in , is designated whenever all the formulas in X are. It is proved in the (...) present paper that if Q = {modus ponens, adjunction } and P {E, R, E +, R +, E I, R I } then there exists a matrix strongly adequate to (P, Q). (shrink)

Three-valued (strong-Kleene) modal logic provides the foundation for a new approach to formalizing causal explanation as a relation between partial situations. The approach makes fine-grained distinctions between aspects of events, even between aspects that are equivalent in classical logic. The framework can accommodate a variety of ontologies concerning the relata of causal explanation. I argue, however, for a tripartite ontology of objects corresponding to sentential nominals: facts, tropes (or facta or states of affairs), and situations (or events). I axiomatize the (...) relations and use canonical models to demonstrate completeness. (shrink)

In discussing propositional quantifiers we have considered two kinds of variables: variables occupying the argument places of connectives, and variables occupying the argument places of predicates.We began with languages which contained the first kind of variable, i.e., variables taking sentences as substituends. Our first point was that there appear to be no sentences in English that serve as adequate readings of formulas containing propositional quantifiers. Then we showed how a certain natural and illuminating extension of English by prosentences did provide (...) perspicuous readings. The point of introducing prosentences was to provide a way of making clear the grammar of propositional variables: propositional variables have a prosentential character — not a pronominal character. Given this information we were able to show, on the assumption that the grammar of propositional variables in philosopher's English should be determined by their grammar in formal languages (unless a separate account of their grammar is provided), that propositional variables can be used in a grammatically and philosophically acceptable way in philosophers' English. According to our criteria of well-formedness Carnap's semantic definition of truth does not lack an ‘essential’ predicate - despite arguments to the contrary. It also followed from our account of the prosentential character of bound propositional variables that in explaining propositional quantification, sentences should not be construed as names.One matter we have not discussed is whether such quantification should be called ‘propositional’, ‘sentential’, or something else. As our variables do not range over (they are not terms) either propositions, or sentences, each name is inappropriate, given the usual picture of quantification. But we think the relevant question in this context is, are we obtaining generality with respect to propositions, sentences, or something else?Because people have argued that all bound variables must have a pronominal character, we presented and discussed in the third section languages in which the variables take propositional terms as substituends. In our case we included names of propositions, that-clauses, and names of sentences in the set of propositional terms. We made a few comparisons with the languages discussed in the second section. We showed among other things how a truth predicate could be used to obtain generality. In contrast, the languages of the second section, using propositional variables, obtain generality without the use of a truth predicate. (shrink)

This paper introduces the inquisitive extension of R, denoted as InqR, which is a relevant logic of questions based on the logic R as the background logic of declaratives. A semantics for InqR is developed, and it is shown that this semantics is, in a precisely defined sense, dual to Routley-Meyer semantics for R. Moreover, InqR is axiomatized and completeness of the axiomatic system is established. The philosophical interpretation of the duality between Routley-Meyer semantics and the semantics for InqR is (...) also discussed. (shrink)

In this paper, we shall confine ourselves to the study of sentential constants in the system R of relevant implication.In dealing with the behaviour of the sentential constants in R, we shall think of R itself as presented in three stages, depending on the level of truth-functional involvement.