Quantum probability models may supersede existing probabilistic models because they account for behaviour inconsistent with classical probability theory that are attributable to normal limitations of cognition. This intriguing position, however, may overstate weaknesses in classical probability theory by underestimating the role of current knowledge states and may under-employ available knowledge about the limitations of cognitive processes. In addition, flexibility in model specification has risks for the use of quantum probability.

Local hidden-variable model of singlet-state correlations discussed in Czachor (Acta Phys Polon A 139:70, 2021a) is shown to be a particular case of an infinite hierarchy of local hidden-variable models based on an infinite hierarchy of calculi. Violation of Bell-type inequalities can be interpreted as a ‘confusion of languages’ problem, a result of mixing different but neighboring levels of the hierarchy. Mixing of non-neighboring levels results in violations beyond the Tsirelson bounds.

The topic of this thesis is how we should treat tiny probabilities of vast value. This thesis consists of six independent papers. Chapter 1 discusses the idea that utilities are bounded. It shows that bounded decision theories prescribe prospects that are better for no one and worse for some if combined with an additive axiology. Chapter 2, in turn, points out that standard axiomatizations of Expected Utility Theory violate dominance in cases that involve possible states of zero probability. Chapters (...) 3–6 discuss the idea that we should ignore tiny probabilities in practical decision-making. Chapter 3 argues that discounting small probabilities solves the ‘Intrapersonal Addition Paradox’ and thus helps avoid the Repugnant Conclusion. Chapter 4 explores what the most plausible version of this view might look like and what problems the different versions have. Chapter 5 focuses on one type of problem, namely, money pumps. The Independence Money Pump, in particular, presents a difficult challenge for those who wish to discount small probabilities. Finally, Chapter 6 discusses the implications of discounting small probabilities for the value of the far future. (shrink)

The rational price of the Pasadena and Altadena games, introduced by Nover and Hájek (2004 ), has been the subject of considerable discussion. Easwaran (2008 ) has suggested that weak expectations — the value to which the average payoffs converge in probability — can give the rational price of such games. We argue against the normative force of weak expectations in the standard framework. Furthermore, we propose to replace this framework by a bounded utility perspective: this shift renders the (...) problem more realistic and accounts for the role of weak expectations. In particular, we demonstrate that in a bounded utility framework, all agents, even if they have different value functions and disagree on the price of an individual game, will finally agree on the rational price of a repeated, averaged game. Thus, we explain the intuitive appeal of weak expectations, while avoiding both trivialization of the original paradox and the drawbacks of previous approaches. (shrink)

The Bounds of Sense is one of the most influential books ever written about Kant’s philosophy, and is one of the key philosophical works of the late Twentieth century. Although it is probably best known for its criticism of Kant’s transcendental idealism, it is also famous for the highly original manner in which Strawson defended and developed some of Kant’s fundamental insights into the nature of subjectivity, experience and knowledge. The book had a profound effect on the interpretation of Kant’s (...) philosophy when it was first published in 1966 and continues to influence discussion of Kant, the soundness of transcendental arguments, and debates in epistemology and metaphysics generally. (shrink)

We consider several puzzles of bounded rationality. These include the Allais- and Ellsberg paradox, the disjunction effect, and related puzzles. We argue that the present account of quantum cognition—taking quantum probabilities rather than classical probabilities—can give a more systematic description of these puzzles than the alternate treatments in the traditional frameworks of bounded rationality. Unfortunately, the quantum probabilistic treatment does not always provide a deeper understanding and a true explanation of these puzzles. One reason is that quantum approaches introduce additional (...) parameters which possibly can be fitted to empirical data but which do not necessarily explain them. Hence, the phenomenological research has to be augmented by responding to deeper foundational issues. In this article, we make the general distinction between foundational and phenomenological research programs, explaining the foundational issue of quantum cognition from the perspective of operational realism. This framework is motivated by assuming partial Boolean algebras. They are combined into a uniform system via a mechanism preventing the simultaneous realization of perspectives. Gleason’s theorem then automatically leads to a distinction between probabilities that are defined by pure states and probabilities arising from the statistical mixture of pure states. This formal distinction relates to the conceptual distinction between risk and ignorance. Another outcome identifies quantum aspects in dynamic macro-systems using the framework of symbolic dynamics. Finally, we discuss several ideas that are useful for justifying complementarity in cognitive systems. (shrink)

_The Bounds of Sense_ is one of the most influential books ever written about Kant’s philosophy, and is one of the key philosophical works of the late Twentieth century. Although it is probably best known for its criticism of Kant’s transcendental idealism, it is also famous for the highly original manner in which Strawson defended and developed some of Kant’s fundamental insights into the nature of subjectivity, experience and knowledge. The book had a profound effect on the interpretation of Kant’s (...) philosophy when it was first published in 1966 and continues to influence discussion of Kant, the soundness of transcendental arguments, and debates in epistemology and metaphysics generally. (shrink)

PROBEX (PROBabilities from EXemplars), a model of probabilistic inference and probability judgment based on generic knowledge is presented. Its properties are that: (a) it provides an exemplar model satisfying bounded rationality; (b) it is a “lazy” algorithm that presumes no pre‐computed abstractions; (c) it implements a hybrid‐representation, similarity‐graded probability. We investigate the ecological rationality of PROBEX and find that it compares favorably with Take‐The‐Best and multiple regression (Gigerenzer, Todd, & the ABC Research Group, 1999). PROBEX is fitted to (...) the point estimates, decisions, and probability assessments by human participants. The best fit is obtained for a version that weights frequency heavily and retrieves only two exemplars. It is proposed that PROBEX implements speed and frugality in a psychologically plausible way. (shrink)

In a homogeneous jury, the votes are exchangeable correlated Bernoulli random variables. We derive the bounds on a homogeneous jury’s competence as the minimum and maximum probability of the jury being correct, which arise due to unknown correlations among the votes. The lower bound delineates the downside risk associated with entrusting decisions to the jury. In large and not-too-competent juries the lower bound may fall below the success probability of a fair coin flip—one half, while the (...) upper bound may not reach a certainty. We also derive the bounds on the voting power of an individual juror as the minimum and maximum probability of her/his casting a decisive vote. The maximum is less than one, while the minimum of zero can be attained for infinitely many combinations of distribution moments. (shrink)

We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then Cas information, the probability of A should intuitively (...) increase. We explain this intuition by making some implicit background information explicit. We consider several iterated conditionals, which allow us to formalize different kinds of latent information. We verify that for these iterated conditionals the prevision is greater than or equal to the probability of A. We also investigate the lower and upper bounds of the Affirmation of the Consequent inference. We conclude our study with some remarks on the supposed "independence" of two conditionals, and we interpret this property as uncorrelation between two random quantities. 2020 Elsevier Inc. All rights reserved. (shrink)

We derive the exact inefficiency upper bounds of the multiclass C-Logit stochastic user equilibrium in a transportation network. All travelers are classified on the basis of different values of time into M classes. The multiclass CL-SUE model gives a more realistic path choice probability in comparison with the logit-based stochastic user equilibrium model by considering the overlapping effects between paths. To find efficiency loss upper bounds of the multiclass CL-SUE, two equivalent variational inequalities for the multiclass CL-SUE model, i.e., (...) time-based variational inequality and monetary-based VI, are formulated. We give four different methods to define the inefficiency of the multiclass CL-SUE, i.e., to compare multiclass CL-SUE with multiclass system optimum, or to compare multiclass CL-SUE with multiclass C-Logit stochastic system optimum, under the time-based criterion and the monetary-based criterion, respectively. We further investigate the effects of various parameters which include the degree of path overlapping, the network complexity, degree of traffic congestion, the VOT of user classes, the network familiarity, and the total demand on the inefficiency bounds. (shrink)

Jeffrey conditionalization is generalized to the case in which new evidence bounds the possible revisions of a prior below by a Dempsterian lower probability. Classical probability kinematics arises within this generalization as the special case in which the evidentiary focal elements of the bounding lower probability are pairwise disjoint.

An increasingly prevalent approach to studying human cognition is to construe the mind as optimally allocating limited cognitive resources among cognitive processes. Under this bounded rationality approach (Icard in Philos Sci 85(1):79–101, 2018; Simon in Utility and probability, Palgrave Macmillan, 1980), it is common to assume that resource-bounded cognitive agents approximate normative solutions to statistical inference problems, and that much of the bias and variability in human performance can be explained in terms of the approximation strategies we employ. In (...) this paper, we argue that this approach restricts itself to an unnecessarily narrow scope of cognitive models, which limits its ability to explain how humans flexibly adapt their representations to novel environments. We argue that more attention should be paid to how we form our cognitive representations in the first place, and advocate for pluralistic framework which jointly optimizes over both representations and algorithms for manipulating them. We identify several fundamental trade-offs that manifest in this joint optimization, and draw on recent work to motivate a unified formal framework for this analysis. We illustrate a simplified version of this analysis with a case study in social cognition, and outline several new directions for research that this approach suggests. (shrink)

We use Bub's (2016) correlation arrays and Pitowksy's (1989b) correlation polytopes to analyze an experimental setup due to Mermin (1981) for measurements on the singlet state of a pair of spin-12 particles. The class of correlations allowed by quantum mechanics in this setup is represented by an elliptope inscribed in a non-signaling cube. The class of correlations allowed by local hidden-variable theories is represented by a tetrahedron inscribed in this elliptope. We extend this analysis to pairs of particles of arbitrary (...) spin. The class of correlations allowed by quantum mechanics is still represented by the elliptope; the subclass of those allowed by local hidden-variable theories by polyhedra with increasing numbers of vertices and facets that get closer and closer to the elliptope. We use these results to advocate for an interpretation of quantum mechanics like Bub's. Probabilities and expectation values are primary in this interpretation. They are determined by inner products of vectors in Hilbert space. Such vectors do not themselves represent what is real in the quantum world. They encode families of probability distributions over values of different sets of observables. As in classical theory, these values ultimately represent what is real in the quantum world. Hilbert space puts constraints on possible combinations of such values, just as Minkowski space-time puts constraints on possible spatio-temporal constellations of events. Illustrating how generic such constraints are, the equation for the elliptope derived in this paper is a general constraint on correlation coefficients that can be found in older literature on statistics and probability theory. Yule (1896) already stated the constraint. De Finetti (1937) already gave it a geometrical interpretation. (shrink)

Cimpian et al. observed that we accept generic statements of the form ‘Gs are f’ on relatively weak evidence, but that if we are unfamiliar with group G and we learn a generic statement about it, we still treat it inferentially in a much stronger way: all Gs are f. This paper makes use of notions like ‘representativeness’, ‘contingency’ and ‘relative difference’ from psychology to provide a uniform semantics of generics that explains why people accept generics based on weak evidence. (...) The spirit of the approach has much in common with Leslie’s cognition-based ideas about generics, but the semantics will be grounded on a strengthening of Cohen’s relative readings of generic sentences. In contrast to Leslie and Cohen, we propose a uniform semantic analysis of generics. The basic intuition is that a generic of the form ‘Gs are f’ is true because f is typical for G, which means that f is valuably associated with G. We will make use of Kahneman and Tversky’s Heuristics and Biases approach, according to which people tend to confuse questions about probability with questions about representativeness, to explain pragmatically why people treat many generic statements inferentially in a much stronger way. (shrink)

This paper presents statistical default logic, an expansion of classical (i.e., Reiter) default logic that allows us to model common inference patterns found in standard inferential statistics, including hypothesis testing and the estimation of a populations mean, variance and proportions. The logic replaces classical defaults with ordered pairs consisting of a Reiter default in the first coordinate and a real number within the unit interval in the second coordinate. This real number represents an upper-bound limit on the probability (...) of accepting the consequent of an applied default and that consequent being false. A method for constructing extensions is then defined that preserves this upper bound on the probability of error under a (skeptical) non-monotonic consequence relation. (shrink)

A generalization of the standard n-person game is presented, with flexible information requirements suitable for players constrained by bounded rationality. Strategies (complete contingency plans) are replaced by "policies," i. e., end-mean pairs of candidate goals and "controls" (partial contingency plans). The existence of individual objective functions over the joint policy choice set is axiomatized in terms of primitive preference and probability orders. Conditions are given for the existence of pure policy Nash equilibrium points in n-person games, and pure policy (...) Nash bargaining and equilibrium threat solutions in 2-person policy games. Connectedness of the policy and payoff sets is not required. (shrink)

One of the central tasks of a theory of argumentation is to supply a theory of appraisal: a set of standards and norms according to which argumentation, and the reasoning involved in it, is properly evaluated. In their most general form, these can be understood as rational norms, where the core idea of rationality is that we rightly respond to reasons by according the credence we attach to our doxastic and conversational commitments with the probative strength of the reasons we (...) have for them. Certain kinds of rational failings are so because they are manifestly illogical – for example, maintaining overtly contradictory commitments, violating deductive closure by refusing to accept the logical consequences of one’s present commitments, or failing to track basing relations by not updating one’s commitments in view of new, defeating information. Yet, according to the internal and empirical critiques, logic and probability theory fail to supply a fit set of norms for human reasoning and argument. Particularly, theories of bounded rationality have put pressure on argumentation theory to lower the normative standards of rationality for reasoners and arguers on the grounds that we are bounded, finite, and fallible agents incapable of meeting idealized standards. This paper explores the idea that argumentation, as a set of practices, together with the procedures and technologies of argumentation theory, is able to extend cognition such that we are better able to meet these idealized logical standards, thereby extending our responsibilities to adhere to idealized rational norms. (shrink)

My title is intended to recall Terence Fine's excellent survey, Theories of Probability [1973]. I shall consider some developments that have occurred in the intervening years, and try to place some of the theories he discussed in what is now a slightly longer perspective. Completeness is not something one can reasonably hope to achieve in a journal article, and any selection is bound to reflect a view of what is salient. In a subject as prone to dispute as (...) this, there will inevitably be many who will disagree with any author's views, and I take the opportunity to apologize in advance to all such people for what they will see as the narrowness and distortion of mine. (shrink)

A non-monotonic theory of probability is put forward and shown to have applicability in the quantum domain. It is obtained simply by replacing Kolmogorov's positivity axiom, which places the lower bound for probabilities at zero, with an axiom that reduces that lower bound to minus one. Kolmogorov's theory of probability is monotonic, meaning that the probability of A is less then or equal to that of B whenever A entails B. The new theory violates monotonicity, (...) as its name suggests; yet, many standard theorems are also theorems of the new theory since Kolmogorov's other axioms are retained. What is of particular interest is that the new theory can accommodate quantum phenomena (photon polarization experiments) while preserving Boolean operations, unlike Kolmogorov's theory. Although non-standard notions of probability have been discussed extensively in the physics literature, they have received very little attention in the philosophical literature. One likely explanation for that difference is that their applicability is typically demonstrated in esoteric settings that involve technical complications. That barrier is effectively removed for non-monotonic probability theory by providing it with a homely setting in the quantum domain. Although the initial steps taken in this paper are quite substantial, there is much else to be done, such as demonstrating the applicability of non-monotonic probability theory to other quantum systems and elaborating the interpretive framework that is provisionally put forward here. Such matters will be developed in other works. (shrink)

Shoot an arrow at a wall, and then paint a target around it so that the arrow sticks squarely in the bull's eye. Alternatively, paint a fixed target on a wall, and then shoot an arrow so that it sticks squarely in the bull's eye. How do these situations differ? In both instances the precise place where the arrow lands is highly improbable. Yet in the one, one can do no better than attribute the arrow's landing to chance, whereas in (...) the other one rightly attributes the arrow's landing to the archer's skill. ;Highly improbable events occur all the time, and by themselves may legitimately be attributed to chance. Yet when an event also conforms to a pattern given independently of that event , one rightly refuses to attribute the event to chance. Patterns given independently of events are called specifications. This dissertation explicates the relation of independence between specification and event, and sets precise bounds on what may count as a probability small enough to eliminate chance. Although this dissertation connects with how statistics eliminates chance, it considerably extends and clarifies the range of application for chance-elimination arguments based on small probabilities. ;The dual notions of specification and small probability together help justify a regulative principle of probability called the Law of Small Probability, which asserts that specified events of small probability do not occur by chance. This principle engenders a form of inference called the design inference, and a mode of explanation called design. To infer design in explaining an event is to eliminate decisively explanations of that event which appeal to law-like regularities or chance. (shrink)

Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1,..., N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This extends the work on 0-1 laws that considers the limiting probability of first-order sentences, by considering asymptotic (...) conditional probabilities. As shown by Liogon'kii [24], if there is a non-unary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We extend this result to show that asymptotic conditional probabilities do not always exist for any reasonable notion of limit. Liogon'kii also showed that the problem of deciding whether the limit exists is undecidable. We analyze the complexity of three problems with respect to this limit: deciding whether it is well-defined, whether it exists, and whether it lies in some nontrivial interval. Matching upper and lower bounds are given for all three problems, showing them to be highly undecidable. (shrink)

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. (...) This goal is achieved by taking Adams' (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams' logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of - C given B are both close to one but the bound on the former's deviation from 1 is much smaller than the latter's, then it may be concluded that in all likelihood the conditional probability of C given A ∧ B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor's rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl's System-Z⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their randomstructures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL. (shrink)

This paper is a discussion note on Isaacs et al. (2022), who have claimed to offer a new motivation for imprecise probabilities, based on the mathematical phenomenon of non-measurability. In this note, I clarify some consequences of their proposal. In particular, I show that if their proposal is applied to a bounded 3-dimensional space, then they have to reject at least one of the following: (i) If A is at most as probable as B and B is at most as (...) probable as C, then A is at most as probable as C. (ii) Let A ∩ C = B ∩ C = ∅. A is at most as probable as B iff (A ∪ C) is at most as probable as (B ∪ C). But rejecting either statement seems unattractive. (shrink)

Logical argument forms are investigated by second order probability density functions. When the premises are expressed by beta distributions, the conclusions usually are mixtures of beta distributions. If the shape parameters of the distributions are assumed to be additive (natural sampling), then the lower and upper bounds of the mixing distributions (P´olya-Eggenberger distributions) are parallel to the corresponding lower and upper probabilities in conditional probability logic.

Although the concept of uncertainty is as old as Epicurus’s writings, and an excellent quantitative theory, with entropy as the measure of uncertainty having been developed in recent times, there has been little exploration of the qualitative theory. The purpose of the present paper is to give a qualitative axiomatization of uncertainty, in the spirit of the many studies of qualitative comparative probability. The qualitative axioms are fundamentally about the uncertainty of a partition of the probability space of (...) events. Of course, it is common to speak of the uncertainty, or randomness, of a random variable, but only the partition defined by the values of the random variable enter into the definition of uncertainty, not the actual values. It is straightforward to add axioms for decision making following the general line of Savage from the 1950s. Indeed, in the spirit of Epicurus, it is really our intuitive feeling about the uncertainty of the future that motivates much of our thinking about decisions. Here, the distinction between the concepts of probability and uncertainty can be made by citing many familiar examples. Without spelling out the technical details, the axiomatization of qualitative probability with uncertainty as the most important primitive concept, it is possible to raise a different kind of question about bounded rationality. This new question is whether or not one should bound the uncertainty in thinking and investigating any detailed framework of decision making. Discussion of this point is certainly different from the question of bounding rationality by not maximizing expected utility. In practice, we naturally bound uncertainty in our analysis of decision-making problems. As in the case of formulating an alternative for maximizing expected utility, so is the case of rational alternatives to maximizing uncertainty. There are several issues to consider. In the spirit of my other work in qualitative probability, I explore alternatives rather than attempt to give a definitive argument for one single solution. (shrink)

We consider work extraction from two finite reservoirs with constant heat capacity, when the thermodynamic coordinates of the process are not fully specified, i.e., are described by probabilities only. Incomplete information refers to both the specific value of the temperature as well as the label of the reservoir to which it is assigned. Based on the concept of inference, we characterize the reduced performance resulting from this lack of control. Indeed, the estimates for the average efficiency reveal that uncertainty regarding (...) the exact labels reduces the maximal expected efficiency below the Carnot value ), its minimum value reproducing the well known Curzon–Ahlborn value: \ . We also estimate the efficiency before the value of the temperature is revealed. It is found that if the labels are known with certainty, then in the near-equilibrium limit the efficiency scales as \ , while if there is maximal uncertainty in the labels, then the average estimate for efficiency drops to \ . We also suggest how the inferred properties of the incomplete model can be mapped onto a model with complete information but with an additional source of thermodynamic irreversibility. (shrink)

This paper is concerned with a two-sorted probabilistic language, denoted by $\textsf{QPL}$, which contains quantifiers over events and over reals, and can be viewed as an elementary language for reasoning about probability spaces. The fragment of $\textsf{QPL}$ containing only quantifiers over reals is a variant of the well-known ‘polynomial’ language from Fagin et al. (1990, Inform. Comput., 87, 78–128). We shall prove that the $\textsf{QPL}$-theory of the Lebesgue measure on $\left [ 0, 1 \right ]$ is decidable, and moreover, (...) all atomless spaces have the same $\textsf{QPL}$-theory. Also, we shall introduce the notion of elementary invariant for $\textsf{QPL}$ and use it to translate the semantics for $\textsf{QPL}$ into the setting of elementary analysis. This will allow us to obtain further decidability results as well as to provide exact complexity upper bounds for a range of interesting undecidable theories. (shrink)

McKay & Dennett (M&D) look for adaptive misbeliefs that result from the normal, though fallible, functioning of human cognition. Their account can be substantially improved by the addition of two elements: (1) significance of a belief's testability for its functionality, and (2) an account of reason appropriate to understanding systemic misbelief. Together, these points show why religion probably is an adaptive misbelief.

Nonmonotonic reasoning is often claimed to mimic human common sense reasoning. Only a few studies, though, investigated this claim empirically. In the present paper four psychological experiments are reported, that investigate three rules of system p, namely the and, the left logical equivalence, and the or rule. The actual inferences of the subjects are compared with the coherent normative upper and lower probability bounds derived from a non-infinitesimal probability semantics of system p. We found a relatively good agreement (...) of human reasoning and principles of nonmonotonic reasoning according to the coherence interpretation of system p. Contrary to the results reported in the “heuristics and biases” tradition, the subjects committed relatively few upper bound violations (conjunction fallacies). More lower than upper bound violations were observed. When the premises were presented in terms of intervals higher mean lower bounds were observed as when the premises were presented in terms of point percentages. (shrink)

There are narrowest bounds for P(h) when P(e) = y and P(h/e) = x, which bounds collapse to x as y goes to 1. A theorem for these bounds -- bounds for probable modus ponens -- entails a principle for updating on possibly uncertain evidence subject to these bounds that is a generalization of the principle for updating by conditioning on certain evidence. This way of updating on possibly uncertain evidence is appropriate when updating by ’probability kinematics’ or ’Jeffrey-conditioning’ (...) is, and apparently in countless other cases as well. A more complicated theorem due to Karl Wagner -- bounds for probable modus tollens -- registers narrowest bounds for P(not h) when P(not e) = y and P(e/h) = x. This theorem serves another principle for updating on possibly uncertain evidence that might be termed ’contraditioning’, though it is for a way of updating that seems in practice to be frequently not appropriate. It is definitely not a way of putting down a theory -- for example, a random-chanc. (shrink)

It is the purpose of the following pages to reconsider the basic problem of induction. According to Hume the concomitance of A with B on one or more occasions gives no valid presumption that A will be accompanied by B on any other occasion. The data of experience may give rise to an association of ideas or set up mental habits, but they provide no reasonable grounds for expecting similar concomitances or sequences in future. If this is correct, we have (...) no starting point for the formation of any valid opinions about matters of fact; we remain ice-bound in a region of total scepticism. (shrink)

We prove new results on common cause closedness of quantum probability spaces, where by a quantum probability space is meant the projection lattice of a non-commutative von Neumann algebra together with a countably additive probability measure on the lattice. Common cause closedness is the feature that for every correlation between a pair of commuting projections there exists in the lattice a third projection commuting with both of the correlated projections and which is a Reichenbachian common cause of (...) the correlation. The main result we prove is that a quantum probability space is common cause closed if and only if it has at most one measure theoretic atom. This result improves earlier ones published in [1]. The result is discussed from the perspective of status of the Common Cause Principle. Open problems on common cause closedness of general probability spaces (L, ϕ) are formulated, where L is an orthomodular bounded lattice and ϕ is a probability measure on L. (shrink)

This research examined whether youth's forecasted risk taking is best predicted by a compensatory (namely, subjective expected utility) or non-compensatory (e.g., single-factor) model. Ninety youth assessed the importance of perceived benefits, importance of perceived drawbacks, subjective probability of benefits, and subjective probability of drawbacks for 16 risky behaviors clustered evenly into recreational and health/safety domains. In both domains, there was strong support for a noncompensatory model in which only the perceived importance of the benefits of engaging in a (...) risky behavior predicted youths' forecasted engagement in risky behavior. The study overcomes earlier methodological weaknesses by fully decomposing participants' assessments into importance and probability aspects for both benefits and drawbacks. As such, the findings provide clear evidence in support of a boundedrationality perspective on youth decision making regarding risk taking. (shrink)

For many among the scientifically informed public, and even among physicists, Heisenberg's uncertainty principle epitomizes quantum mechanics. Nevertheless, more than 86 years after its inception, there is no consensus over the interpretation, scope, and validity of this principle. The aim of this chapter is to offer one such interpretation, the traces of which may be found already in Heisenberg's letters to Pauli from 1926, and in Dirac's anticipation of Heisenberg's uncertainty relations from 1927, that stems form the hypothesis of finite (...) nature. Instead of a mere mathematical theorem of quantum theory, or a manifestation of "wave-particle duality", the uncertainty relations turn out to be a result of a more fundamental premise, namely, the inherent limitation on spatial resolution that follows from the bound on physical resources. The implication of this view are far reaching: it depicts the Hilbert space formalism as a phenomenological, "effective", formalism that approximates an underlying discrete structure; it supports a novel interpretation of probability in statistical physics that sees probabilities as deterministic, dynamical transition probabilities which arise from objective and inherent measurement errors; and it helps to clarify several puzzles in the foundations of statistical physics, such as the status of the "disturbance" view of measurement in quantum theory, or the tension between ontology and epistemology in the attempts to describe nature with physical theories whose formalisms include subjective probabilities. Finally, this view also renders obsolete the entire class of interpretations of quantum theory that adhere to "the reality of the wave function". (shrink)

According to a standard view, quantum mechanics is a contextual theory and quantum probability does not satisfy Kolmogorov’s axioms. We show, by considering the macroscopic contexts associated with measurement procedures and the microscopic contexts underlying them, that one can interpret quantum probability as epistemic, despite its non-Kolmogorovian structure. To attain this result we introduce a predicate language L, a classical probability measure on it and a family of classical probability measures on sets of μ-contexts, each element (...) of the family corresponding to a measurement procedure. By using only Kolmogorovian probability measures we can thus define mean conditional probabilities on the set of properties of any quantum system that admit an epistemic interpretation but are not bound to satisfy Kolmogorov’s axioms. The generalized probability measures associated with states in QM can then be seen as special cases of these mean probabilities, which explains how they can be non-classical and provides them with an epistemic interpretation. Moreover, the distinction between compatible and incompatible properties is explained in a natural way, and purely theoretical classical conditional probabilities coexist with empirically testable quantum conditional probabilities. (shrink)

Although the concept of uncertainty is as old as Epicurus’s writings, and an excellent quantitative theory, with entropy as the measure of uncertainty having been developed in recent times, there has been little exploration of the qualitative theory. The purpose of the present paper is to give a qualitative axiomatization of uncertainty, in the spirit of the many studies of qualitative comparative probability. The qualitative axioms are fundamentally about the uncertainty of a partition of the probability space of (...) events. Of course, it is common to speak of the uncertainty, or randomness, of a random variable, but only the partition defined by the values of the random variable enter into the definition of uncertainty, not the actual values. It is straightforward to add axioms for decision making following the general line of Savage from the 1950s. Indeed, in the spirit of Epicurus, it is really our intuitive feeling about the uncertainty of the future that motivates much of our thinking about decisions. Here, the distinction between the concepts of probability and uncertainty can be made by citing many familiar examples. Without spelling out the technical details, the axiomatization of qualitative probability with uncertainty as the most important primitive concept, it is possible to raise a different kind of question about bounded rationality. This new question is whether or not one should bound the uncertainty in thinking and investigating any detailed framework of decision making. Discussion of this point is certainly different from the question of bounding rationality by not maximizing expected utility. In practice, we naturally bound uncertainty in our analysis of decision-making problems. As in the case of formulating an alternative for maximizing expected utility, so is the case of rational alternatives to maximizing uncertainty. There are several issues to consider. In the spirit of my other work in qualitative probability, I explore alternatives rather than attempt to give a definitive argument for one single solution. (shrink)

Let be n events in a probability space, and suppose that we have only partial information about the distribution: The probabilites of the events themselves, and their pair intersections. With this partial information we cannot, usually, deternine the probability of an event B in the algebra generated by the 's, but we can obtain lower and upper bounds. This is done by a linear program related to the correlation polytope c(n), a structure introduced in [3], [4]. In the (...) first part of the paper I demonstrate how laws of large numbers (for sequences of events which are not necessarily independent) can be proved, using only the duality theorem of linear programming. These include the weak law of large numbers (necessary and sufficient condition) and various sufficient conditions for strong laws. The connection between these laws and the facet structure of the correlation polytope is established. In the second part of the paper I consider a more general case. Assume that our information consists of the values of the probabilities of all intersections of the 's up to size k, k < n. The techniques of linear programming lead naturally to an application of the theory of polynomial approximation in estimating the size of various events. In particular, I prove an approximate version of the central limit theorem. (shrink)

Econometric analysis of discrete choice has made considerable use of random utility models to interpret observed choice behavior. Much empirical research concerns choice problems in which persons act with partial knowledge of the utilities of the feasible actions. Economists use random expected utility models to analyze such choice problems. A common practice is to specify fully the expectations that persons hold, in which case choice analysis reduces to inference on preferences alone. However, the expectations assumptions made in empirical research rarely (...) have much foundation. To enable more credible research, this paper considers inference when one specifies a set of expectations that decision makers may plausibly hold. I first pose the idea in abstraction and then specialize to binary response with linear utilities, where the analysis is particularly straightforward. I initially assume that decision makers possess unique subjective probability distributions on the states of nature and make choices that maximize expected utility. I later consider the possibility that persons place only partial probabilistic structure on the states of nature and make undominated choices. (shrink)

The story of the body. Fay Bound Alberti takes the human body apart in order to put it back anew, telling the cultural history of our key organs and systems from the inside out, from blood to guts, brains to sex organs.

Many contemporary scholars argue that Schelling’s version of intellectual intuition retains certain central features of the Kantian and Fichtean conceptions. One of the common claims is that, as with Kant and Fichte, Schelling’s intellectual intuition is the power of the subject’s productive understanding. However, we show that for the Schelling of the Identitätsphilosophie period, intellectual intuition is the power not of an understanding that intuits, or a productive intellect, but of a receptive and penetrating sensibility that understands.