Online research in philosophy

entry for the Entry for the Stanford Encyclopedia of Philosophy, 2007.

forthcoming in Studies on Language and Information (CSLI), Stanford.

Journal of Philosophical Logic 34, 97-119, 2005.

Daniel Ellsberg presented in Ellsberg (The Quarterly Journal of Economics 75:643–669, 1961) various examples questioning the thesis that decision making under uncertainty can be reduced to decision making under risk. These examples constitute one of the main challenges to the received view on the foundations of decision theory offered by Leonard Savage in Savage (1972). Craig Fox and Amos Tversky have, nevertheless, offered an indirect defense of Savage. They provided in Fox and Tversky (1995) an explanation of Ellsberg’s two-color problem (...) in terms of a psychological effect: ambiguity aversion . The ‘comparative ignorance’ hypothesis articulates how this effect works and explains why it is important to an understanding of the typical pattern of responses associated with Ellsberg’s two-color problem. In the first part of this article we challenge Fox and Tversky’s explanation. We present first an experiment that extends Ellsberg’s two-color problem where certain predictions of the comparative ignorance hypothesis are not confirmed. In addition the hypothesis seems unable to explain how the subjects resolve trade-offs between security and expected pay-off when vagueness is present. Ellsberg offered an explanation of the typical behavior elicited by his examples in terms of these trade-offs and in section three we offer a model of Ellsberg’s trade-offs. The model takes seriously the role of imprecise probabilities in explaining Ellsberg’s phenomenon. The so-called three-color problem was also considered in Fox and Tversky (1995). We argue that Fox and Tversky’s analysis of this case breaks a symmetry with their analysis of the two-color problem. We propose a unified treatment of both problems and we present a experiment that confirms our hypothesis. (shrink)

The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a necessary and a sufficient for them to play the backward induction solution in centipede games. To obtain this result, we (...) do not need to assume that rationality is commonly known (as is done in [Aumann (1995)]) or commonly hypothesized by the players (as done in [Samet (1996)]). The proposed model is compared with the account of hypothetical knowledge presented by Samet in [Samet (1996)] and with other possible strategies for extending information structures with conditional propositions. (shrink)

We present a decision-theoretically motivated notion of contraction which, we claim, encodes the principles of minimal change and entrenchment. Contraction is seen as an operation whose goal is to minimize loses of informational value. The operation is also compatible with the principle that in contracting A one should preserve the sentences better entrenched than A (when the belief set contains A). Even when the principle of minimal change and the latter motivation for entrenchment figure prominently among the basic intuitions in (...) the works of, among others, Quine and Ullian (1978), Levi (1980, 1991), Harman (1988) and Gärdenfors (1988), formal accounts of belief change (AGM, KM – see Gärdenfors (1988); Katsuno and Mendelzon (1991)) have abandoned both principles (see Rott (2000)). We argue for the principles and we show how to construct a contraction operation, which obeys both. An axiom system is proposed. We also prove that the decision-theoretic notion of contraction can be completely characterized in terms of the given axioms. Proving this type of completeness result is a well-known open problem in the field, whose solution requires employing both decision-theoretical techniques and logical methods recently used in belief change. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like (...) FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

One of the reasons for adopting hyperbolic discounting is to explain preference reversals. Another is that this value structure suggests an elegant theory of the will. I examine the capacity of the theory to solve Newcomb's problem. In addition, I compare Ainslie's account with other procedural theories of choice that seem at least equally capable of accommodating reversals of preference.

Normative accounts in terms of similarity can be deployed in order to provide semantics for systems of context-free default rules and other sophisticated conditionals. In contrast, procedural accounts of decision in terms of similarity (Rubinstein 1997) are hard to reconcile with the normative rules of rationality used in decision-making, even when suitably weakened.

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.

Following the pioneer work of Bruno De Finetti [12], conditional probability spaces (allowing for conditioning with events of measure zero) have been studied since (at least) the 1950's. Perhaps the most salient axiomatizations are Karl Popper's in [31], and Alfred Renyi's in [33]. Nonstandard probability spaces [34] are a well know alternative to this approach. Vann McGee proposed in [30] a result relating both approaches by showing that the standard values of infinitesimal probability functions are representable as Popper functions, and (...) that every Popper function is representable in terms of the standard real values of some infinitesimal measure.Our main goal in this article is to study the constraints on (qualitative and probabilistic) change imposed by an extended version of McGee's result. We focus on an extension capable of allowing for iterated changes of view. Such extension, we argue, seems to be needed in almost all considered applications. Since most of the available axiomatizations stipulate (definitionally) important constraints on iterated change, we propose a non-question-begging framework, Iterative Probability Systems (IPS) and we show that every Popper function can be regarded as a Bayesian IPS. A generalized version of McGee's result is then proved and several of its consequences considered. In particular we note that our proof requires the imposition of Cumulativity, i.e. the principle that a proposition that is accepted at any stage of an iterative process of acceptance will continue to be accepted at any later stage. The plausibility and range of applicability of Cumulativity is then studied. In particular we appeal to a method for defining belief from conditional probability (first proposed in [42] and then slightly modified in [6] and [3]) in order to characterize the notion of qualitative change induced by Cumulative models of probability kinematics. The resulting cumulative notion is then compared with existing axiomatizations of belief change and probabilistic supposition. We also consider applications in the probabilistic accounts of conditionals [1] and [30]. (shrink)

This article elaborates on foundational issues in the social sciences and their impact on the contemporary theory of belief revision. Recent work in the foundations of economics has focused on the role external social norms play in choice. Amartya Sen has argued in [Sen93] that the traditional rationalizability approach used in the theory of rational choice has serious problems accommodating the role of social norms. Sen’s more recent work [Sen96, Sen97] proposes how one might represent social norms in the theory (...) of choice, and in a very recent article [BS07] Walter Bossert and Kotaro Suzumura develop Sen’s proposal, offering an extension of the classical theory of choice that is capable of dealing with social norms. The first part of this article offers an alternative functional characterization of the extended notion of rationality employed by Bossert and Suzumura in [BS07]. This characterization, unlike the one offered in [BS07], represents a norm-sensitive notion of rationality in terms of a pure functional constraint unmediated by a notion of revealed preference (something that is crucial for the application developed in the second part of this article). This functional characterization is formulated for general domains (as is Bossert and Suzumura’s characterization) and is therefore empirically more applicable than usual characterizations of rationality. Interestingly, the functional constraint we propose is a variant of a condition first entertained in [AGM85] by Carlos Alchourr´on, Peter Gärdenfors and David Makinson in the area of belief change. (shrink)