Online research in philosophy

Coherentism maintains that coherent beliefs are more likely to be true than incoherent beliefs, and that coherent evidence provides more confirmation of a hypothesis when the evidence is made coherent by the explanation provided by that hypothesis. Although probabilistic models of credence ought to be well-suited to justifying such claims, negative results from Bayesian epistemology have suggested otherwise. In this essay we argue that the connection between coherence and confirmation should be understood as a relation mediated by the causal relationships among the evidence and a hypothesis, and we offer a framework for doing so by fitting together probabilistic models of coherence, confirmation, and causation. We show that the causal structure among the evidence and hypothesis is sometimes enough to determine whether the coherence of the evidence boosts confirmation of the hypothesis, makes no difference to it, or even reduces it. We also show that, ceteris paribus, it is not the coherence of the evidence that boosts confirmation, but rather the ratio of the coherence of the evidence to the coherence of the evidence conditional on a hypothesis.

Let E be a set of n propositions E1, ..., En. We seek a probabilistic measure C(E) of the ‘degree of coherence’ of E. Intuitively, we want C to be a quantitative, probabilistic generalization of the (deductive) logical coherence of E. So, in particular, we require C to satisfy the following..

Los's probability semantics are used to identify the appropriate probability conditional for use in probabilistic explanations. This conditional is shown to have applications to probabilistic reasoning in expert systems. The reasoning scheme of the system MYCIN is shown to be probabilistically invalid; however, it is shown to be "close" to a probabilistically valid inference scheme.

I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, , in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, C->B holds just in case P[B|C] is greater than or equal to r. Thus, each conditional in a given family behaves like conditional probability above some specific support level.

It is shown that the probabilistic theories of coherence proposed up to now produce a number of counter-intuitive results. The last section provides some reasons for believing that no probabilistic measure will ever be able to adequately capture coherence. First, there can be no function whose arguments are nothing but tuples of probabilities, and which assigns different values to pairs of propositions {A, B} and {A, C} if A implies both B and C, or their negations, and if P(B)=P(C). But such sets may indeed differ in their degree of coherence. Second, coherence is sensitive to explanatory relations between the propositions in question. Explanation, however, can hardly be captured solely in terms of probability.

According to orthodox (Kolmogorovian) probability theory, conditional probabilities are by definition certain ratios of unconditional probabilities. As a result, orthodox conditional probabilities are undefined whenever their antecedents have zero unconditional probability. This has important ramifications for the notion of probabilistic independence. Traditionally, independence is defined in terms of unconditional probabilities (the factorization of the relevant joint unconditional probabilities). Various “equivalent” formulations of independence can be given using conditional probabilities. But these “equivalences” break down if conditional probabilities are permitted to have conditions with zero unconditional probability. We reconsider probabilistic independence in this more general setting. We argue that a less orthodox but more general (Popperian) theory of conditional probability should be used, and that much of the conventional wisdom about probabilistic independence needs to be rethought.

The aim of the paper is to draw a connection between a semantical theory of conditional statements and the theory of conditional probability. First, the probability calculus is interpreted as a semantics for truth functional logic. Absolute probabilities are treated as degrees of rational belief. Conditional probabilities are explicitly defined in terms of absolute probabilities in the familiar way. Second, the probability calculus is extended in order to provide an interpretation for counterfactual probabilities--conditional probabilities where the condition has zero probability. Third, conditional propositions are introduced as propositions whose absolute probability is equal to the conditional probability of the consequent on the antecedent. An axiom system for this conditional connective is recovered from the probabilistic definition. Finally, the primary semantics for this axiom system, presented elsewhere, is related to the probabilistic interpretation.

The present chapter describes a probabilistic framework of human reasoning. It is based on probability logic. While there are several approaches to probability logic, we adopt the coherence based approach.

Probabilistic models have started to replace classical logic as the standard reference paradigm in human deductive reasoning. Mental probability logic emphasizes general principles where human reasoning deviates from classical logic, but agrees with a probabilistic approach (like nonmonotonicity or the conditional event interpretation of conditionals).

This contribution consists of two parts. In the first part we discuss general features of reasoning systems including consequence relations, how uncertainty may enter argument forms, probability intervals, and probabilistic informativeness. These concepts are of central importance for the psychological task analysis. In the second part we report new experimental data on the paradoxes of the material conditional, the probabilistic modus ponens, the complement task, and data on the probabilistic truth table task. The results of the experiments provide evidence for the hypothesis that people represent indicative conditionals by conditional probability assertions.

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws.