Epistemology is the study of knowledge and justified belief. Belief is thus central to epistemology. It comes in a qualitative form, as when Sophia believes that Vienna is the capital of Austria, and a quantitative form, as when Sophia's degree of belief that Vienna is the capital of Austria is at least twice her degree of belief that tomorrow it will be sunny in Vienna. Formal epistemology, as opposed to mainstream epistemology (Hendricks 2006), is epistemology done in a formal way, (...) that is, by employing tools from logic and mathematics. The goal of this entry is to give the reader an overview of the formal tools available to epistemologists for the representation of belief. A particular focus will be the relation between formal representations of qualitative belief and formal representations of quantitative degrees of belief. (shrink)

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...) it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

This paper is about conjunctions and disjunctions in the scope of non-doxastic atti- tude verbs. These constructions generate a certain type of ignorance implicature. I argue that the best way to account for these implicatures is by appealing to a notion of contex- tual redundancy (Schlenker, 2008; Fox, 2008; Mayr and Romoli, 2016). This pragmatic approach to ignorance implicatures is contrasted with a semantic account of disjunctions under `wonder' that appeals to exhausti cation (Roelofsen and Uegaki, 2016). I argue that (...) exhausti cation-based theories cannot handle embedded conjunctions, so a pragmatic account of ignorance implicatures is superior. (shrink)

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also namedimplicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent.$${p\Rightarrow q}$$p⇒qis thus defined as$${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$¬◊(p∧¬q)∧◊p∧◊¬q. We explore the logical properties of this conditional in (...) a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle’s theses and weak Boethius’ thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut. (shrink)

Plural definite descriptions across many languages display two well-known properties. First, they can give rise to so-called non-maximal readings, in the sense that they ‘allow for exceptions’. Second, while they tend to have a quasi-universal quantificational force in affirmative sentences, they tend to be interpreted existentially in the scope of negation. Building on previous works, we offer a theory in which sentences containing plural definite expressions trigger a family of possible interpretations, and where general principles of language use account for (...) their interpretation in various contexts and syntactic environments. Our theory solves a number of problems that these previous works encounter, and has broader empirical coverage in that it offers a precise analysis for sentences that display complex interactions between plural definites, quantifiers and bound variables, as well as for cases involving non-distributive predicates. The resulting proposal is briefly compared with an alternative proposal by Križ, which has similar coverage but is based on a very different architecture and sometimes makes subtly different predictions. (shrink)

The variably strict analysis of conditionals does not only largely dominate the philosophical literature, since its invention by Stalnaker and Lewis, it also found its way into linguistics and psychology. Yet, the shortcomings of Lewis–Stalnaker’s account initiated a plethora of modifications, such as non-vacuist conditionals, presuppositional indicatives, perfect conditionals, or other conditional constructions, for example: reason relations, difference-making conditionals, counterfactual dependency, or probabilistic relevance. Many of these new connectives can be treated as strengthened or weakened conditionals. They are definable conditionals. (...) This article develops a technique to infer the logic for such definable conditionals from the known logic of the underlying defining conditional. The technique is applied to central examples. The results show that a large part of the zoo of conditionals arises from a basic conditional—a constant nucleus of the different contextual and conceptual variations of variably strict conditionals. (shrink)

Motivated by supplying a new strategy for connexive logic and a better semantics for conditionals so that negating a conditional amounts to negating its consequent under the condition, we propose a new semantics for connexive conditional logic, by combining Kleene’s three-valued logic and a slight modification of Stalnaker’s semantics for conditionals. In the new semantics, selection functions for selecting closest worlds for evaluating conditionals can be undefined. Truth and falsity conditions for conditionals are then supplemented with a precondition that the (...) selection function is defined. Based on the new semantics, we define six conditional logics by different classes of models, using two notions of validity, one preserving truth and the other preserving tolerant truth. We prove soundness and completeness of these logics and compare them with some conditional logics in the literature. Our partial function plus precondition strategy may be used in other semantic frameworks to generate more connexive logics. (shrink)

This paper explores the connective ‘because’, based on the idea that ‘_C_ because _A_’ implies the acceptance/truth of the antecedent _A_ as well as of the consequent _C_, and additionally that the antecedent makes a difference for the consequent. To capture this idea of difference-making a ‘relevantized’ version of the Ramsey Test for conditionals is employed that takes the antecedent to be relevant to the consequent in the following sense: a conditional is true/accepted in a state \(\sigma \) just in (...) case (i) the consequent is true/accepted when \(\sigma \) is revised by the antecedent _and_ (ii) the consequent fails to be true/accepted when \(\sigma \) is revised by the antecedent’s negation. To extend this to a semantics for ‘because’, we add that (iii) the antecedent and (iv) the consequent are accepted/true in the state \(\sigma \). We get metaphysical or doxastic interpretations of these clauses, depending on what we mean by a model and a state. We introduce several semantics known from suppositional conditionals, which we reinterpret for difference-making conditionals and ‘because’. We present a minimal logic for ‘because’ sentences and show how it can be extended in ways that parallel the hierarchy of extensions of the logic of suppositional conditionals. We establish correspondence results between axioms for ‘because’ and properties of states, and prove that the specified logics are sound with respect to the semantics. (shrink)

This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...) of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

The paper is motivated by the need of accounting for the practical syllogism as a piece of defeasible reasoning. To meet the need, the paper first refers to ranking theory as an account of defeasible descriptive reasoning. It then argues that two kinds of ought need to be distinguished, purely normative and fact-regarding obligations. It continues arguing that both kinds of ought can be iteratively revised and should hence be represented by ranking functions, too, just as iteratively revisable beliefs. Its (...) central proposal will then be that the fact-regarding normative ranking function must be conceived as the sum of a purely normative ranking function and an epistemic ranking function. The distinctions defends this proposal with a comparative discussion of some critical examples and some other distinctions made in the literature. It gives a more rigorous justification of this proposal. Finally, it starts developing the logic of purely normative and of fact-regarding normative defeasible reasoning, points to the difficulties of completing the logic of the fact-regarding side, but reaches the initial aim of accounting for the defeasible nature of the practical syllogism. (shrink)

Proves Completeness for the Evidential Conditional.