1 Choice conjecture In axiomatizing nonclassical extensions of classical sentential logic one tries to make do, if one can, with adding to classical sentential logic a finite number of axiom schemes of the simplest kind and a finite number of inference rules of the simplest kind. The simplest kind of axiom scheme in effect states of a particular formula P that for any substitution of formulas for atoms the result of its application to P is to count as an axiom. (...) The simplest kind of onepremise inference rule in effect states of a particular pair of formulas P and Q that for any substitution of formulas for atoms, if the result of its application to P is a theorem, then the result of its application to Q is to count as a theorem; similarly for many-premise rules. Such are the schemes and rules of all the best-known modal and tense logics, for instance. Sometimes it is difficult to find such simple schemes and rules. In that case one may resort to less simple schemes or less simple rules. There is no generally recognized rigorous definition of "next simplest kind" of scheme. Neither is there any generally recognized definition of "next simplest kind" of rule, and hence there is no fully rigorous enunciation of the choice conjecture, the conjecture that schemes of the next simplest kind can always be avoided in favor of rules of the next simplest kind and vice versa. Nonetheless, there are cases where intuitively one does recognize that the schemes or rules in a given axiomatization are only slightly more complex than the simplest kind, including cases where one does have a choice between adopting slightly-more-complex-than-simplest schemes and adopting slightly-more-complex-than-simplest rules. In tense logic early examples of slightly more complex rules are found in [2] and [3] : there is one example of the embarrassed use of such rules in the former, and many examples of the enthusiastic use of such rules in the latter and its sequels. Accordingly the rules in question have come to be called "Gabbay-style" rules. (shrink)

A new formulation involving fulfillment of all the Kolmogorov axioms is suggested for acomplete probability theory. This proves to be not a purely mathematical discipline. Probability theory deals with abstract objects—images of various classes of concrete objects—whereas experimental statistics deals with concrete objects alone. Both have to be taken into account. Quantum physics and classical statistical physics prove to be different aspects ofone probabilistic physics. The connection of quantum mechanics with classical statistical mechanics is examined and the origin (...) of the Schrödinger equation is elucidated. Attention is given to the true meaning of the wave-corpuscle duality, and the incompleteness of nonrelativistic quantum mechanics is explained. (shrink)

In binary choice between discrete outcome lotteries, an individual may prefer lottery L1 to lottery L2 when the probability that L1 delivers a better outcome than L2 is higher than the probability that L2 delivers a better outcome than L1. Such a preference can be rationalized by three standard axioms (solvability, convexity and symmetry) and one less standard axiom (a fanning-in). A preference for the most probable winner can be represented by a skew-symmetric bilinear utility function. Such a (...) utility function has the structure of a regret theory when lottery outcomes are perceived as ordinal and the assumption of regret aversion is replaced with a preference for a win. The empirical evidence supporting the proposed system of axioms is discussed. (shrink)

Although it has become a common place to refer to the ׳sixth problem׳ of Hilbert׳s (1900) Paris lecture as the starting point for modern axiomatized probability theory, his own views on probability have received comparatively little explicit attention. The central aim of this paper is to provide a detailed account of this topic in light of the central observation that the development of Hilbert׳s project of the axiomatization of physics went hand-in-hand with a redefinition of the status of (...) probability theory and the meaning of probability. Where Hilbert first regarded the theory as a mathematizable physical discipline and later approached it as a ׳vague׳ mathematical application in physics, he eventually understood probability, first, as a feature of human thought and, then, as an implicitly defined concept without a fixed physical interpretation. It thus becomes possible to suggest that Hilbert came to question, from the early 1920s on, the very possibility of achieving the goal of the axiomatization of probability as described in the ׳sixth problem׳ of 1900. (shrink)

This paper contributes to the mathematical foundations of the model for utility theory developed by Richard Jeffrey in The Logic of Decision [5]. In it I discuss the relationship of Jeffrey's to classical models, state and interpret an existence theorem for numerical utilities and subjective probabilities and restate a theorem on their uniqueness.

In the literature, there are many axiomatizations of qualitative probability. They all suffer certain defects: either they are too nonspecific and allow nonunique quantitative interpretations or are overspecific and rule out cases with unique quantitative interpretations. In this paper, it is shown that the class of qualitative probability structures with nonunique quantitative interpretations is not first order axiomatizable and that the class of qualitative probability structures with a unique quantitative interpretation is not a finite, first order extension (...) of the theory of qualitative probability. The idea behind the method of proof is quite general and can be used in other measurement situations. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) (...) 15 purely inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

This article develops an axiomatic theory of induction that speaks to the recent debate on Bayesian orgulity. It shows the exact principles associated with the belief that data can corroborate universal laws. We identify two types of disbelief about induction: skepticism that the existence of universal laws of nature can be determined empirically, and skepticism that the true law of nature, if it exists, can be successfully identified. We formalize and characterize these two dispositions toward induction by introducing novel (...) axioms for subjective probabilities. We also relate these dispositions to the axiom of σ-additivity. (shrink)

The standard axiomatization of quantum mechanics (QM) is not fully explicit about the role of the time-parameter. Especially, the time reference within the probability algorithm (the Born Rule, BR) is unclear. From a probability principle P1 and a second principle P2 affording a most natural way to make BR precise, a logical conflict with the standard expression for the completeness of QM can be derived. Rejecting P1 is implausible. Rejecting P2 leads to unphysical results and to a conflict (...) with a generalization of P2, a principle P3. All three principles are shown to be without alternative. It is thus shown that the standard expression of QM completeness must be revised. An absolutely explicit form of the axioms is provided, including a precise form of the projection postulate. An appropriate expression for QM completeness, reflecting the restrictions of the Gleason and Kochen-Specker theorems is proposed. (shrink)

The basis of a rigorous formal axiomatization of quantum mechanics is constructed, built upon Dirac's bra-ket notation. The system is three-sorted, with separate variables for scalars, vectors and operators. First-order quantification over all three types of variable is permitted. Economy in the axioms is effected by, e.g., assigning a single logical function * to transform (i) a scalar into its complex conjugate, (ii) a ket vector into a bra and a bra into a ket, (iii) an operator into its adjoint. (...) The system is accompanied by a formal semantics. Further papers will deal with vector subspaces and projection operators, operators with continuous spectra, tensor products, observables, and quantum mechanical probabilities. (shrink)

On the basis of Mackey's axiomatic approach to quantum physics or, equivalently, of a “state-event-probability” (SEVP) structure, using a quite standard “fuzzification” procedure, a set of unsharp events (or “effects”) is constructed and the corresponding “state-effect-probability” (SEFP) structure is introduced. The introduction of some suitable axioms gives rise to a partially ordered structure of quantum Brouwer-Zadeh (BZ) poset; i.e., a poset endowed with two nonusual orthocomplementation mappings, a fuzzy-like orthocomplementation, and an intuitionistic-like orthocomplementation, whose set of sharp (...) elements is an orthomodular complete lattice. As customary, by these orthocomplementations the two modal-like necessity and possibility operators are introduced, and it is shown that Ludwig's and Jauch-Piron's approaches to quantum physics are “interpreted” in complete SEFP. As a marginal result, a standard procedure to construct a lot of unsharp realizations starting from any sharp realization of a fixed observable is given, and the relationship among sharp and corresponding unsharp realizations is studied. (shrink)

We axiomatize the notion of state over finitely generated free NM-algebras, the Lindenbaum algebras of pure Nilpotent Minimum logic. We show that states over the free n -generated NM-algebra exactly correspond to integrals of elements of with respect to Borel probability measures.

L. Hardy has formulated an axiomatization program of quantum mechanics and generalized probability theories that has been quite influential. In this paper, properties of typical Hamiltonian dynamical systems are used to argue that there are applications of probability in physical theories of systems with dynamical complexity that require continuous spaces of pure states. Hardy’s axiomatization program does not deal with such theories. In particular Hardy’s fifth axiom does not differentiate between such applications of classical probability and quantum (...) probability. (shrink)

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)

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-questionbegging 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)

How ought you to evaluate your options if you're uncertain about what's fundamentally valuable? A prominent response is Expected Value Maximisation (EVM)—the view that under axiological uncertainty, an option is better than another if and only if it has the greater expected value across axiologies. But the expected value of an option depends on quantitative probability and value facts, and in particular on value comparisons across axiologies. We need to explain what it is for such facts to hold. Also, (...) EVM is by no means self-evident. We need an argument to defend that it’s true. This book introduces an axiomatic approach to answer these worries. It provides an explication of what EVM means by use of representation theorems: intertheoretic comparisons can be understood in terms of facts about which options are better than which, and mutatis mutandis for intratheoretic comparisons and axiological probabilities. And it provides a systematic argument to the effect that EVM is true: the theory can be vindicated through simple axioms. The result is a formally cogent and philosophically compelling extension of standard decision theory, and original take on the problem of axiological or normative uncertainty. (shrink)

The probability that a fair coin tossed yesterday landed heads is either 0 or 1, but the probability that it would land heads was 0.5. In order to account for the latter type of probabilities, past probabilities, a temporal restriction operator is introduced and axiomatically characterized. It is used to construct a representation of conditional past probabilities. The logic of past probabilities turns out to be strictly weaker than the logic of standard probabilities.

We report a solution to an open problem regarding the axiomatization of the convex hull of a type of nonclassical evaluations. We then investigate the meaning of this result for the larger context of the relation between rational credence functions and nonclassical probability. We claim that the notions of bets and Dutch Books typically employed in formal epistemology are of doubtful use outside the realm of classical logic, eventually proposing two novel ways of understanding Dutch Books in nonclassical settings.

In this paper we study the interaction between symmetric logic and probability. In particular, we axiomatize the convex hull of the set of evaluations of symmetric logic, yielding the notion of probability in symmetric logic. This answers an open problem of Williams ( 2016 ) and Paris ( 2001 ).

We propose an alternative approach to probability theory closely related to the framework of numerosity theory: non-Archimedean probability (NAP). In our approach, unlike in classical probability theory, all subsets of an infinite sample space are measurable and only the empty set gets assigned probability zero (in other words: the probability functions are regular). We use a non-Archimedean field as the range of the probability function. As a result, the property of countable additivity in Kolmogorov’s (...) axiomatization of probability is replaced by a different type of infinite additivity. (shrink)

The fundamental problem considered is that of the existence of a joint probability distribution for momentum and position at a given instant. The philosophical interest of this problem is that for the potential energy functions (or Hamiltonians) corresponding to many simple experimental situations, the joint "distribution" derived by the methods of Wigner and Moyal is not a genuine probability distribution at all. The implications of these results for the interpretation of the Heisenberg uncertainty principle are analyzed. The final (...) section consists of some observations concerning the axiomatic foundations of quantum mechanics. (shrink)

This reissue of D. A. Gillies highly influential work, first published in 1973, is a philosophical theory of probability which seeks to develop von Mises’ views on the subject. In agreement with von Mises, the author regards probability theory as a mathematical science like mechanics or electrodynamics, and probability as an objective, measurable concept like force, mass or charge. On the other hand, Dr Gillies rejects von Mises’ definition of probability in terms of limiting frequency and (...) claims that probability should be taken as a primitive or undefined term in accordance with modern axiomatic approaches. This of course raises the problem of how the abstract calculus of probability should be connected with the ‘actual world of experiments’. It is suggested that this link should be established, not by a definition of probability, but by an application of Popper’s concept of falsifiability. In addition to formulating his own interesting theory, Dr Gillies gives a detailed criticism of the generally accepted Neyman Pearson theory of testing, as well as of alternative philosophical approaches to probability theory. The reissue will be of interest both to philosophers with no previous knowledge of probability theory and to mathematicians interested in the foundations of probability theory and statistics. (shrink)

Order of information plays a crucial role in the process of updating beliefs across time. In fact, the presence of order effects makes a classical or Bayesian approach to inference difficult. As a result, the existing models of inference, such as the belief-adjustment model, merely provide an ad hoc explanation for these effects. We postulate a quantum inference model for order effects based on the axiomatic principles of quantum probability theory. The quantum inference model explains order effects by (...) transforming a state vector with different sequences of operators for different orderings of information. We demonstrate this process by fitting the quantum model to data collected in a medical diagnostic task and a jury decision-making task. To further test the quantum inference model, a new jury decision-making experiment is developed. Using the results of this experiment, we compare the quantum inference model with two versions of the belief-adjustment model, the adding model and the averaging model. We show that both the quantum model and the adding model provide good fits to the data. To distinguish the quantum model from the adding model, we develop a new experiment involving extreme evidence. The results from this new experiment suggest that the adding model faces limitations when accounting for tasks involving extreme evidence, whereas the quantum inference model does not. Ultimately, we argue that the quantum model provides a more coherent account for order effects that was not possible before. (shrink)

Kolmogorov''s axiomatization of probability includes the familiarratio formula for conditional probability: 0).$$ " align="middle" border="0">.

Probability ratio and likelihood ratio measures of inductive support and related notions have appeared as theoretical tools for probabilistic approaches in the philosophy of science, the psychology of reasoning, and artificial intelligence. In an effort of conceptual clarification, several authors have pursued axiomatic foundations for these two families of measures. Such results have been criticized, however, as relying on unduly demanding or poorly motivated mathematical assumptions. We provide two novel theorems showing that probability ratio and likelihood ratio (...) measures can be axiomatized in a way that overcomes these difficulties. (shrink)

The use of negative probabilities is discussed for certain problems in which a stochastic process approach is indicated. An extension of probability theory to include signed (negative and positive) probabilities is outlined and both philosophical and axiomatic examinations of negative probabilities are presented. Finally, a class of applications illustrates the use and implications of signed probability theory.

We express here the statement » The probability of a given b equals r « symbolically by » p = r «. A formal axiomatic calculus can be constructed comprising all the well‐known laws of probability theory. This calculus can be interpreted in various ways. The present paper is a criticism of the subjective interpretation; that is to say, of any interpretation which assumes that probability expresses degrees of incomplete knowledge: a is the statement incompletely known, (...) b is our total knowledge, and p is the degree to which a is entailed by b. The subjective interpretation has often been proposed as an explanation and even a sharpening of the various objective theories . It is shown in the paper that this proposal cannot be realised because the subjective theory cannot lead to results which are compatible with the objective theory. This is due to various reasons, the most important of which is that the objective theory interprets » b « in » p « as a statement of the objective conditions of an experiment and » a « as one of its possible results. The subjective theory on the other hand interprets » b « as our total relevant knowledge which will in general include some knowledge of previous results of the experiment. It is shown that this must lead to incompatibility owing to the fact that this knowledge of previous results must influence the value of the probability.It is shown, in this way, that any probabilistic theory of the process of learning from experience—that is to say, any probabilistic theory of induction—must lead to contradictions.RésuméL'énoncé: » La probabilité de a, si b est donné, est égale à r « est ici exprimé symboliquement par » p = r «. On peut construire un système axiomatique formel qui contient toutes les règles bien connues du calcul des probabilités. Ce calcul formel peut ětre interprété de manières très différentes. L'article contient une critique des interprétations subjectives, c'est‐à‐dire des interprétations qui admettent que la probabilité exprime des degrés de connaissance incomplète: a est un énoncé qu'on ne connaǐt que partiellement, b est notre connaissance totale, et p exprime le degré auquel a est implicitement contenu dans b. L'interprétation subjective a souvent été proposée comme une explication et un renforcement des différentes théories objectives . Dans cet article, l'auteur montre que ce projet n'est pas réalisable, car la théorie subjective mène à des résultats qui contredisent la théorie objective. Plusieurs circonstances sont responsables de cette situation; la plus importante, c'est que la théorie interprète le » b « dans » p « comme une description des conditions objectives d'une expérience . D'autre part, la théorie subjective interprète » b « comme notre savoir total , et ce savoir inclura en général des informations sur les résultats obtenus antérieurement pour cette expérience. L'auteur montre que ce fait conduit à une contradiction entre les deux interprétations, car cette connaissance doit avoir une influence sur la valeur subjective de la probabilité.A l'aide de ce raisonnement, on peut montrer que la théorie des probabilités appliquée au processus inductif tirant une expérience du domaine expérimental conduit à des contradictions.ZusammenfassungDie Aussage » Die Wahrscheinlichkeit von a, wenn b gegeben ist, ist gleich r « wird hier symbolisch durch » p = r « ausgedrückt. Ein formales Axiomensystem kann konstruiert werden, das alle die wohlbekannten Regeln der Wahrscheinlichkeitsrechnung enthält. Dieser formale Kalkül kann in sehr verschiedener Weise interpretiert werden. Der Artikel enthält eine Kritik der subjektiven Interpretationen; das heisst, jener Interpretationen die annehmen, dass die Wahrscheinlichkeit Grade von unvollständigem Wissen ausdrückt: a ist ein Satz der unvollständig gewusst wird, b ist unser Gesamtwissen, und p drückt den Grad aus zu dem a in b implizit enthalten ist. Die subjektive Interpretation wurde oft als eine Erklärung und Verschärfung der verschiedenen objektiven Theorien vorgeschlagen. In dem Artikel wird gezeigt, dass der Vorschlag undurchführbar ist, da die subjektive Theorie zu Resultaten führt, die der objektiven Theorie widersprechen. Verschiedene Umstände tragen zu dieser Situation bei. Der wichtigste dieser Umstände ist, dass die objektive Theorie das » b « in » p « als eine Beschreibung der objektiven Bedingungen eines Experimentes interpretiert . Andererseits interpretiert die subjektive Theorie » b « als unser Gesamtwissen , und dieses wird im allgemeinen Informationen bezüglich früherer Resultate dieses Experiments einschliessen. Es wird gezeigt, dass das zu einem Widerspruch zwischen den Interpretationen führt, da dieses Wissen Einfluss auf den subjektiven Wahrscheinlichkeitswert haben muss.Mit Hilfe dieses Gedankenganges wird gezeigt, dass die Wahrscheinlichkeitstheorie des induktiven Lernens aus der Erfahrung zu Widersprüchen führt. (shrink)

This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli’s discussion of “convex Bayesianism” (in particular their proposals concerning E-admissibility, independence, and convexity). The paper offers an organized review of the literature on independence for sets of probability distributions; new results on graphoid properties and on the justification of “strong independence” (using exchangeability) are presented. Finally, the connection between Kyburg and Pittarelli’s results and (...) recent developments on the axiomatization of non-binary preferences, and its impact on “complete” independence, are described. (shrink)

Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions (...) or between two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable. (shrink)

Choices rarely deal with certainties; and, where assertoric logic and modal logic are insufficient, those seeking to be reasonable turn to one or more things called “probability.” These things typically have a shared mathematical form, which is an arithmetic construct. The construct is often felt to be unsatisfactory for various reasons. A more general construct is that of a preordering, which may even be incomplete, allowing for cases in which there is no known probability relation between two propositions (...) or between two events. Previous discussion of incomplete preorderings has been as if incidental, with researchers focusing upon preorderings for which quantifications are possible. This article presents formal axioms for the more general case. Challenges peculiar to some specific interpretations of the nature of probability are brought to light in the context of these propositions. A qualitative interpretation is offered for probability differences that are often taken to be quantified. A generalization of Bayesian updating is defended without dependence upon coherence. Qualitative hypothesis testing is offered as a possible alternative in cases for which quantitative hypothesis testing is shown to be unsuitable. [NB: There is a transcription error in (A6), the quantification “∀(Y,c₂)” should be applied within the large parentheses to the proposition on the third row. You have my apologies!]. (shrink)

Belnap-Dunn logic, sometimes also known as First Degree Entailment, is a four-valued propositional logic that complements the classical truth values of True and False with two non-classical truth values Neither and Both. The latter two are to account for the possibility of the available information being incomplete or providing contradictory evidence. In this paper, we present a probabilistic extension of BD that permits agents to have probabilistic beliefs about the truth and falsity of a proposition. We provide a sound and (...) complete axiomatization for the framework defined and also identify policies for conditionalization and aggregation. Concretely, we introduce four-valued equivalents of Bayes’ and Jeffrey updating and also suggest mechanisms for aggregating information from different sources. (shrink)

We present a new axiomatization of the classical discounted expected utility model, which is primarily used as a decision model for consumption streams under risk. This new axiomatization characterizes discounted expected utility as a model that satisfies natural extensions of standard axioms as in the one-period case and two additional axioms. The first axiom is a weak form of time separability. It only requires that the choice between certain constant consumption streams and lotteries should be made by just taking into (...) account the time periods where the consumption is different. The second axiom, the time–probability equivalence, requires that risk and time preferences basically work in the same way. Moreover, we prove that preferences satisfying the natural extensions of the standard axioms as well as the first axiom can be represented in a simple form relying on three functions linked to the risk or time preferences in simple situations. Finally, we illustrate that several examples that are not fully time separable satisfy all our axioms except for the time–probability equivalence. (shrink)

The first clear and precise statement of the axioms of qualitative probability was given by de Finetti ([1], Section 13). A more detailed treatment, based however on more complex axioms for conditional qualitative probability, was given later by Koopman [5]. De Finetti and Koopman derived a probability measure from a qualitative probability under the assumption that, for any integer n, there are n mutually exclusive, equally probable events. L. J. Savage [6] has shown that this strong (...) assumption is unnecessary. More precisely, he proves that if a qualitative probability is only fine and tight, then there is one and only one probability measure compatible with it. No property equivalent to countable additivity has been used as yet in the development of qualitative probability theory. However, since the concept of countable additivity is of such fundamental importance in measure theory, it is to be expected that an equivalent property would be of interest in qualitative probability theory, and that in particular it would simplify the proof of the existence of compatible probability measures. Such a property is introduced in this paper, under the name of monotone continuity. It is shown that, if a qualitative probability is atomless and monotonely continuous, then there is one and only one probability measure compatible with it, and this probability measure is countably additive. It is also proved that any fine and tight qualitative probability can be extended to a monotonely continuous qualitative probability, and therefore, contrary to what might be expected, there is no loss in generality if we consider only qualitative probabilities which are monotonely continuous. At the present time there is still a controversy over the interpretation which should be given to the word probability in the scientific and technical literature. Although the present writer subscribes to the opinion that this interpretation may be different in different contexts, in this paper we do not enter into this controversy. We simply remark that a qualitative probability, as a numerical one, may be interpreted either as an objective or as a subjective probability, and therefore the following axiomatic theory is compatible with both interpretations of probability. (shrink)

In this paper we present two families of probability logics (denoted _QLP_ and \(QLP^{ORT}\) ) suitable for reasoning about quantum observations. Assume that \(\alpha \) means “O = a”. The notion of measuring of an observable _O_ can be expressed using formulas of the form \(\square \lozenge \alpha \) which intuitively means “if we measure _O_ we obtain \(\alpha \) ”. In that way, instead of non-distributive structures (i.e., non-distributive lattices), it is possible to relay on classical logic extended (...) with the corresponding modal laws for the modal logic \({\textbf{B}}\). We consider probability formulas of the form \(CS_{z_{1},\rho _{1}; \ldots ; z_{m},\rho _{m}} \square \lozenge \alpha \) related to an observable _O_ and a possible world (vector) _w_: if _a_ is an eigenvalue of _O_, \(w_{1}\),..., \(w_{m}\) form a base of a closed subspace of the considered Hilbert space which corresponds to eigenvalue _a_, and if _w_ is a linear combination of the basis vectors such that \(w=c_{1}\cdot w_{1}+ \cdots + c_{m}\cdot w_{m}\) for some \(c_{i}\in {\mathbb {C}}\), then \(\Vert c_{1}-z_{1}\Vert \le \rho _{1}\),..., \(\Vert c_{m}-z_{m}\Vert \le \rho _{m}\), and the probability of obtaining _a_ while measuring _O_ in the state _w_ is equal to \(\Sigma _{i=1}^{m}\Vert c_{i}\Vert ^{2}\). Formulas are interpreted in reflexive and symmetric Kripke models equipped with probability distributions over families of subsets of possible worlds that are orthocomplemented lattices, while for \(QLP^{ORT}\) also satisfy ortomodularity. We give infinitary axiomatizations, prove the corresponding soundness and strong completeness theorems, and also decidability for _QLP_-logics. (shrink)

In 1959 Carnap published a probability model that was meant to allow forreasoning by analogy involving two independent properties. Maher (2000)derived a generalized version of this model axiomatically and defended themodel''s adequacy. It is thus natural to now consider how the model mightbe extended to the case of more than two properties. A simple extension waspublished by Hess (1964); this paper argues that it is inadequate. Amore sophisticated one was developed jointly by Carnap and Kemeny in theearly 1950s but (...) never published; this paper gives the first published descriptionof Carnap and Kemeny''s model and argues that it too is inadequate. Since noother way of extending the two-property model is currently known, the conclusionof this paper is that a satisfactory extension to multiple properties requires somenew approach. (shrink)

Maxmin Expected Utility was first axiomatized by Gilboa and Schmeidler in an Anscombe–Aumann setup Anscombe and Aumann which includes exogenous probabilities. The model was later axiomatized in a purely subjective setup, where no exogenous probabilities are assumed. The purpose of this note is to show that in all these axiomatizations, the only assumptions that are needed are the basic ones that are used to extract a cardinal utility function, together with the two typical Maxmin assumptions, Uncertainty Aversion and Certainty Independence, (...) applied only to 0.5:0.5 mixtures. For the purely subjective characterizations, this means that assumptions involving an unbounded number of variables can be replaced with assumptions that involve only a finite number thereof. (shrink)

A physical and mathematical framework for the analysis of probabilities in quantum theory is proposed and developed. One purpose is to surmount the problem, crucial to any reconciliation between quantum theory and space-time physics, of requiring instantaneous “wave-packet collapse” across the entire universe. The physical starting point is the idea of an observer as an entity, localized in space-time, for whom any physical system can be described at any moment, by a set of (not necessarily pure) quantum states compatible with (...) his observations of the system at that moment. The mathematical starting point is the theory of local algebras from axiomatic relativistic quantum field theory. A function defining thea priori probability of mistaking one local state for another is analysed. This function is shown to possess a broad range of appropriate properties and to be uniquely defined by a selection of them. Through a general model for observations, it is argued that the probabilities defined here are as compatible with experiment as the probabilities of conventional interpretations of quantum mechanics but are more likely to be compatible, not only with modern developments in mathematical physics, but also with a complete and consistent theory of measurement. (shrink)

This article presents and compares various algebraic structures that arise in axiomatic unsharp quantum physics. We begin by stating some basic principles that such an algebraic structure should encompass. Following G. Mackey and G. Ludwig, we first consider a minimal state-effect-probability (minimal SEFP) structure. In order to include partial operations of sum and difference, an additional axiom is postulated and a SEFP structure is obtained. It is then shown that a SEFP structure is equivalent to an effect algebra (...) with an order determining set of states. We also consider σ-SEFP structures and show that these structures distinguish Hilbert space from incomplete inner product spaces. Various types of sharpness are discussed and under what conditions a Brouwer complementation can be defined to obtain a BZ-poset is investigated. In this case it is shown that every effect has a best lower and upper sharp approximation and that the set of all Brouwer sharp effects form an orthoalgebra. (shrink)

We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

In this contribution, we focus on probabilistic problems with a denumerably or non-denumerably infinite number of possible outcomes. Kolmogorov (1933) provided an axiomatic basis for probability theory, presented as a part of measure theory, which is a branch of standard analysis or calculus. Since standard analysis does not allow for non-Archimedean quantities (i.e. infinitesimals), we may call Kolmogorov's approach "Archimedean probability theory". We show that allowing non-Archimedean probability values may have considerable epistemological advantages in the infinite (...) case. The current paper focuses on the motivation for our new axiomatization. (shrink)

We consider a setting where a decision maker’s uncertainty is represented by a set of probability measures, rather than a single measure. Measure-by-measure updating of such a set of measures upon acquiring new information is well known to suffer from problems. To deal with these problems, we propose using weighted sets of probabilities: a representation where each measure is associated with a weight, which denotes its significance. We describe a natural approach to updating in such a situation and a (...) natural approach to determining the weights. We then show how this representation can be used in decision making, by modifying a standard approach to decision making—minimizing expected regret—to obtain minimax weighted expected regret. We provide an axiomatization that characterizes preferences induced by MWER both in the static and dynamic case. (shrink)

In this work, we focus on the philosophical aspects and technical challenges that underlie the axiomatization of the non-Kolmogorovian probability framework, in connection with the problem of quantum contextuality. This fundamental feature of quantum theory has received a lot of attention recently, given that it might be connected to the speed-up of quantum computers—a phenomenon that is not fully understood. Although this problem has been extensively studied in the physics community, there are still many philosophical questions that should be (...) properly formulated. We analyzed different problems from a conceptual standpoint using the non-Kolmogorovian probability approach as a technical tool. (shrink)

§1. The mission of axiomatic set theory. What is set theory needed for in the foundations of mathematics? Why cannot we transact whatever foundational business we have to transact in terms of our ordinary logic without resorting to set theory? There are many possible answers, but most of them are likely to be variations of the same theme. The core area of ordinary logic is by a fairly common consent the received first-order logic. Why cannot it take care of (...) itself? What is it that it cannot do? A large part of every answer is probably that first-order logic cannot handle its own model theory and other metatheory. For instance, a first-order language does not allow the codification of the most important semantical concept, viz. the notion of truth, for that language in that language itself, as shown already in Tarski. In view of such negative results it is generally thought that one of the most important missions of set theory is to provide the wherewithal for a model theory of logic. For instance Gregory H. Moore asserts in his encyclopedia article “Logic and set theory” thatSet theory influenced logic, both through its semantics, by expanding the possible models of various theories and by the formal definition of a model; and through its syntax, by allowing for logical languages in which formulas can be infinite in length or in which the number of symbols is uncountable. (shrink)