Levi Spectre

Epistemic closure under deductive inference: what is it and can we afford it?

The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic uncertainty in known premises. The first strategy, while effective, retains little of the original idea—conclusions even of modus ponens inferences from known premises are not always known. We then look at the second strategy, inspecting the most elaborate and promising attempt to secure the epistemic role of basic inferences, namely Timothy Williamson’s safety theory of knowledge. We argue that while it indeed has the merit of allowing basic inferences such as modus ponens to extend knowledge, Williamson’s theory faces formidable difficulties. These difficulties, moreover, arise from the very feature responsible for its virtue- the infallibilism of knowledge.

Sleeping Beauty meets Monday

The Sleeping Beauty problem—first presented by A. Elga in a philosophical context—has captured much attention. The problem, we contend, is more aptly regarded as a paradox: apparently, there are cases where one ought to change one’s credence in an event’s taking place even though one gains no new information or evidence, or alternatively, one ought to have a credence other than 1/2 in the outcome of a future coin toss even though one knows that the coin is fair. In this paper we argue for two claims. First, that Sleeping Beauty does gain potentially new relevant information upon waking up on Monday. Second, his credence shift is warranted provided it accords with a calculation that is a result of conditionalization on the relevant information: “this day is an experiment waking day” (a day within the experiment on which one is woken up). Since Sleeping Beauty knows what days d could refer to, he can calculate the probability that the referred to waking day is a Monday or a Tuesday providing an adequate resolution of the paradox.

A pragmatic argument against equal weighting

We present a minimal pragmatic restriction on the interpretation of the weights in the “Equal Weight View” (and, more generally, in the “Linear Pooling” view) regarding peer disagreement and show that the view cannot respect it. Based on this result we argue against the view. The restriction is the following one: if an agent,

Belief is weak

\hbox {i}

At the threshold of knowledge

i, assigns an equal or higher weight to another agent,

Knowledge Closure and Knowledge Openness : A Study of Epistemic Closure Principles

\hbox {j}