Online research in philosophy

This paper is about Spohn's theory of epistemic beliefs. The main ingredients of Spohn's theory are (i) a functional representation of an epistemic state called a disbelief function, and (ii) a rule for revising this function in light of new information. The main contribution of this paper is as follows. First, we provide a new axiomatic definition of an epistemic state and study some of its properties. Second, we state a rule for combining disbelief functions that is mathematically equivalent to Spohn's belief revision rule. Whereas Spohn's rule is defined in terms of the initial epistemic state and some features of the final epistemic state, the rule of combination is defined in terms of the initial epistemic state and the incremental epistemic state representing the information gained. Third, we state a rule of subtraction that allows one to recover the addendum epistemic state from the initial and final epistemic states. Fourth, we study some properties of our rule of combination. One distinct advantage of our rule of combination is that besides belief revision, it can also be used to describe an initial epistemic state for many variables when this information is provided in the form of several independent epistemic states each involving a small number of variables. Another advantage of our reformulation is that we are able to demonstrate that Spohn's theory of epistemic beliefs shares the essential abstract features of probability theory and the Dempster-Shafer theory of belief functions. One implication of this is that we have a ready-made algorithm for propagating disbelief functions using only local computation.

The main ingredients of Spohn's theory of epistemic beliefs are (1) a functional representation of an epistemic state called a disbelief function and (2) a rule for revising this function in light of new information. The main contribution of this paper is as follows. First, we provide a new axiomatic definition of an epistemic state and study some of its properties. Second, we study some properties of an alternative functional representation of an epistemic state called a Spohnian belief function. Third, we state a rule for combining disbelief functions that is mathematically equivalent to Spohn's belief revision rule. Whereas Spohn's rule is defined in terms of the initial epistemic state and some features of the final epistemic state, the rule of combination is defined in terms of the initial epistemic state and the incremental epistemic state representing the information gained. Fourth, we state a rule of subtraction that allows one to recover the addendum epistemic state from the initial and final epistemic states. Fifth, we study some properties of our rule of combination. One distinct advantage of our rule of combination is that besides belief revision, it can be used to describe an initial epistemic state for many variables when this information is given as several independent epistemic states each involving few variables. Another advantage of our reformulation is that we can show that Spohn's theory of epistemic beliefs shares the essential abstract features of probability theory and the Dempster-Shafer theory of belief functions. One implication of this is that we have a ready-made algorithm for propagating disbelief functions using only local computation.

The “ethics of belief” refers to a cluster of questions at the intersection of epistemology, philosophy of mind, psychology, and ethics. The central question in the debate is whether there are norms of some sort governing our habits of belief formation, belief maintenance, and belief relinquishment. Is it ever or always morally wrong (or epistemically irrational, or imprudent) to hold a belief on insufficient evidence? Is it ever or always morally right (or epistemically rational, or prudent) to believe on the basis of sufficient evidence, or to withhold belief in the perceived absence of it? Is it ever or always obligatory to seek out all available epistemic evidence for a belief? Are there some ways of obtaining evidence that are themselves immoral or imprudent?

This is a comprehensive study of the English word 'or', and the logical operators variously proposed to present its meaning. Although there are indisputably disjunctive uses of or in English, it is a mistake to suppose that logical disjunction represents its core meaning. 'Or' is descended from the Anglo-Saxon word meaning second, a form which survives in such expressions as "every other day." Its disjunctive uses arise through metalinguistic applications of an intermediate adverbial meaning which is conjunctive rather than disjunctive in character. These conjunctive uses have puzzled philosophers and logicians, and have been discussed extensively under such headings as "free choice permission." This study examines the textbook myths that have clouded our understanding of how or and other "logical" vocabulary comes to have something approaching its logical meaning in natural languages. It considers the various historical conceptions of disjunction and its place in logic from the Stoics to the present day.

A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.

Richard Jeffrey's generalization of Bayes' rule of conditioning follows, within the theory of belief functions, from Dempster's rule of combination and the rule of minimal extension. Both Jeffrey's rule and the theory of belief functions can and should be construed constructively, rather than normatively or descriptively. The theory of belief functions gives a more thorough analysis of how beliefs might be constructed than Jeffrey's rule does. The inadequacy of Bayesian conditioning is much more general than Jeffrey's examples of uncertain perception might suggest. The ``parameter α '' that Hartry Field has introduced into Jeffrey's rule corresponds to the "weight of evidence" of the theory of belief functions.

This paper will be concerned with the conjunctive interpretation of a family of disjunctive constructions. The relevant conjunctive interpretation, sometimes referred to as a “free choice effect,” (FC) is attested when a disjunctive sentence is embedded under an existential modal operator. I will provide evidence that the relevant generalization extends (with some caveats) to all constructions in which a disjunctive sentence appears under the scope of an existential quantifier, as well as to seemingly unrelated constructions in which conjunction appears under the scope of negation and a universal quantifier.

Given a belief function ? on the set of all subsets of prizes, how should ? values be understood as a decision alternative? This paper presents and characterizes an induced-measure interpretation of belief functions.

I argue that the conjunctive distribution of permissibility over or, which is a puzzling feature of free-choice permission is just one instance of a more general class of conjunctive occurrences of the word, and that these conjunctive uses are more directly explicable by the consideration that or is a descendant of oper than by reference to the disjunctive occurrences which logicalist prejudices may tempt us to regard as semantically more fundamental. I offer an account of how the disjunctive uses of or may have come about through an intermediate discourse-adverbial use of or, drawing a parallel with but, which, etymologically, is disjunctive rather than conjunctive and whose conjunctive uses seem to represent just such a discourse-adverbial application.