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)

We relate Popper functions to regular and perfectly additive such non-Archimedean probability functions by means of a representation theorem: every such non-Archimedean probability function is infinitesimally close to some Popper function, and vice versa. We also show that regular and perfectly additive non-Archimedean probability functions can be given a lexicographic representation. Thus Popper functions, a specific kind of non-Archimedean probability functions, and lexicographic probability functions triangulate to the same place: they are (...) in a good sense interchangeable. (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)

In this paper the non-Archimedean multiple-validity is proposed for basic fuzzy logic BL∀∞ that is built as an ω-order extension of the logic BL∀. Probabilities are defined on the class of fuzzy subsets and, as a result, for the first time the non-Archimedean valued probability logic is constructed on the base of BL∀∞.

After generalizing the Archimedean property of real numbers in such a way as to make it adaptable to non-numeric structures, we demonstrate that the real numbers cannot be used to accurately measure non-Archimedean structures. We argue that, since an agent with Artificial General Intelligence (AGI) should have no problem engaging in tasks that inherently involve non-Archimedean rewards, and since traditional reinforcement learning rewards are real numbers, therefore traditional reinforcement learning probably will not lead to AGI. We indicate (...) two possible ways traditional reinforcement learning could be altered to remove this roadblock. (shrink)

Non-Archimedean probability functions allow us to combine regularity with perfect additivity. We discuss the philosophical motivation for a particular choice of axioms for a non-Archimedean probability theory and answer some philosophical objections that have been raised against infinitesimal probabilities in general. _1_ Introduction _2_ The Limits of Classical Probability Theory _2.1_ Classical probability functions _2.2_ Limitations _2.3_ Infinitesimals to the rescue? _3_ NAP Theory _3.1_ First four axioms of NAP _3.2_ Continuity and conditional (...) class='Hi'>probability _3.3_ The final axiom of NAP _3.4_ Infinite sums _3.5_ Definition of NAP functions via infinite sums _3.6_ Relation to numerosity theory _4_ Objections and Replies _4.1_ Cantor and the Archimedean property _4.2_ Ticket missing from an infinite lottery _4.3_ Williamson’s infinite sequence of coin tosses _4.4_ Point sets on a circle _4.5_ Easwaran and Pruss _5_ Dividends _5.1_ Measure and utility _5.2_ Regularity and uniformity _5.3_ Credence and chance _5.4_ Conditional probability _6_ General Considerations _6.1_ Non-uniqueness _6.2_ Invariance Appendix. (shrink)

We will flip a fair coin infinitely many times. Al calls the first flip, claiming it will land heads. Betty calls every odd numbered flip, claiming they will all land heads. Carl calls every flip bar none, claiming they will all land heads. Pre-theoretically, it seems that Al's claim is infinitely more likely than Betty's, and that Betty's claim is infinitely more likely than Carl's. But standard, real-valued probability theory says that, while Al's claim is infinitely more likely than (...) Betty's, Betty's claim is exactly as likely as Carl's. I use John Conway's surreal numbers to capture these pre-theoretic judgements about the relative probabilities of Al's, Betty's, and Carl's claims. Surreal-valued probabilities also allow us to calculate precise numerical values for those claims. For instance, we will see that Betty's claim has a probability equal to the reciprocal of the product of the square root of cardinality of the continuum and the fourth root of 2. The article provides a 'user's guide' to surreal-valued probabilities and raises questions for further research. (shrink)

This dissertation is a contribution to formal and computational philosophy. -/- In the first part, we show that by exploiting the parallels between large, yet finite lotteries on the one hand and countably infinite lotteries on the other, we gain insights in the foundations of probability theory as well as in epistemology. Case 1: Infinite lotteries. We discuss how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. The solution boils down to the (...) introduction of infinitesimal probability values, which can be achieved using non-standard analysis. Our solution can be generalized to uncountable sample spaces, giving rise to a Non-Archimedean Probability (NAP) theory. Case 2: Large but finite lotteries. We propose application of the language of relative analysis (a type of non-standard analysis) to formulate a new model for rational belief, called Stratified Belief. This contextualist model seems well-suited to deal with a concept of beliefs based on probabilities ‘sufficiently close to unity’. -/- The second part presents a case study in social epistemology. We model a group of agents who update their opinions by averaging the opinions of other agents. Our main goal is to calculate the probability for an agent to end up in an inconsistent belief state due to updating. To that end, an analytical expression is given and evaluated numerically, both exactly and using statistical sampling. The probability of ending up in an inconsistent belief state turns out to be always smaller than 2%. (shrink)

A probability distribution is regular if no possible event is assigned probability zero. While some hold that probabilities should always be regular, three counter-arguments have been posed based on examples where, if regularity holds, then perfectly similar events must have different probabilities. Howson (2017) and Benci et al. (2016) have raised technical objections to these symmetry arguments, but we see here that their objections fail. Howson says that Williamson’s (2007) “isomorphic” events are not in fact isomorphic, but Howson (...) is speaking of set-theoretic representations of events in a probability model. While those sets are not isomorphic, Williamson’s physical events are, in the relevant sense. Benci et al. claim that all three arguments rest on a conflation of different models, but they do not. They are founded on the premise that similar events should have the same probability in the same model, or in one case, on the assumption that a single rotation-invariant distribution is possible. Having failed to refute the symmetry arguments on such technical grounds, one could deny their implicit premises, which is a heavy cost, or adopt varying degrees of instrumentalism or pluralism about regularity, but that would not serve the project of accurately modelling chances. (shrink)

In a fair finite lottery with n tickets, the probability assigned to each ticket winning is 1/n and no other answer. That is, 1/n is unique. Now, consider a fair lottery over the natural numbers. What probability is assigned to each ticket winning in this lottery? Well, this probability value must be smaller than 1/n for all natural numbers n. If probabilities are real-valued, then there is only one answer: 0, as 0 is the only real and (...) non-negative value that is smaller than 1/n for all natural numbers n. However, this answer seems counter-intuitive, as it violates Regularity: for all possible events A that are assigned a probability, A is assigned a positive probability. It is possible for ticket i to win in the second lottery. So, the set {i} should be assigned a positive probability and not 0. Consequently, in order to satisfy Regularity, probabilities must be allowed to take on `non-real' values, e.g. a positive infinitesimal x that is smaller than 1/n for all natural numbers n. So, what regular probability is assigned to {i} in the second lottery? This probability value must be positive but smaller than 1/n for all natural numbers n. Given the definition of x, x is a correct answer. But x isn't unique, because every other positive infinitesimal is a correct answer as well and there are uncountably many positive infinitesimals. After all, every positive infinitesimal is strictly between 0 and 1/n for all natural numbers n. Nothing about a fair lottery over the natural numbers uniquely determines x as the correct answer and nothing about the lottery rules out other positive infinitesimals as a correct answer as well. What probability to assign to {i} is underdetermined. -/- In this thesis, I explore this difference between fair finite lotteries and fair infinite lotteries. The constraints governing the former uniquely determine the probabilities assigned to events in those lotteries, but this isn't true for the latter lotteries, when Regularity is a constraint on probabilities. Now, although there are uncountably many correct probability values that can be assigned to {i} in the second lottery, there are some applications of probability theory, for which at least one correct probability value must be chosen in order to accomplish that application, e.g. calculation of expected utilities. In this thesis, I spell out sufficient conditions for when a choice like that is problematic. These conditions apply to precise probabilities, imprecise probabilities, and qualitative probabilities. So, I will consider Benci et al. (2018)'s and Pruss (2021)'s suggestion of allowing probabilities to be imprecise, as well as resorting to qualitative probabilities, to overcome the choice problem. I will argue that both don't solve the problem. Furthermore, there's a hitherto unnoticed difficulty in deriving imprecise probabilities by supervaluating over precise `non-real' probability values. To avoid this difficulty, precise probability values should be real-valued. Thus, Regularity cannot be a constraint on probabilities. But as it turns out, dropping Regularity as a constraint and requiring precise probabilities to be real-valued solve the choice problem. (shrink)

As van Fraassen pointed out in his opening remarks, Henry Kyburg's lottery paradox has long been known to raise difficulties in attempts to represent full belief as a probability greater than or equal to p, where p is some number less than 1. Recently, Patrick Maher has pointed out that to identify full belief with probability equal to 1 presents similar difficulties. In his paper, van Fraassen investigates ways of representing full belief by personal probability which avoid (...) the difficulties raised by Maher's measure-theoretic version of the lottery paradox. Van Fraassen's more subtle representation dissolves the simple identification of full belief with maximal personal probability. His investigation exploits the richer resources for representing opinion provided by taking conditional, rather than unconditional, personal probability as fundamental. It has interesting implications for equivalent alternative approaches based on non-Archimedean probability, as well as for equivalent approaches in which assumption contexts representing full belief relative to suppositions are taken as fundamental. (shrink)

Recent developments in generalized probability theory have renewed a debate about whether regularity (i.e., the constraint that only logical contradictions get assigned probability 0) should be a necessary feature of both chances and credences. Crucial to this debate, however, are some mathematical facts regarding the interplay between the existence of regular generalized probability measures and various cardinality assumptions. We improve on several known results in the literature regarding the existence of regular generalized probability measures. In particular, (...) we give necessary and sufficient conditions for the existence of regular generalized probability measures defined on the whole powerset of any sample space. (shrink)

I introduce a mathematical account of expectation based on a qualitative criterion of coherence for qualitative comparisons between gambles (or random quantities). The qualitative comparisons may be interpreted as an agent’s comparative preference judgments over options or more directly as an agent’s comparative expectation judgments over random quantities. The criterion of coherence is reminiscent of de Finetti’s quantitative criterion of coherence for betting, yet it does not impose an Archimedean condition on an agent’s comparative judgments, it does not require (...) the binary relation reflecting an agent’s comparative judgments to be reflexive, complete or even transitive, and it applies to an absolutely arbitrary collection of gambles, free of structural conditions (e.g., closure, measurability, etc.). Moreover, unlike de Finetti’s criterion of coherence, the qualitative criterion respects the principle of weak dominance, a standard of rational decision making that obliges an agent to reject a gamble that is possibly worse and certainly no better than another gamble available for choice. Despite these weak assumptions, I establish a qualitative analogue of de Finetti’s Fundamental Theorem of Prevision, from which it follows that any coherent system of comparative expectations can be extended to a weakly ordered coherent system of comparative expectations over any collection of gambles containing the initial set of gambles of interest. The extended weakly ordered coherent system of comparative expectations satisfies familiar additivity and scale invariance postulates (i.e., independence) when the extended collection forms a linear space. In the course of these developments, I recast de Finetti’s quantitative account of coherent prevision in the qualitative framework adopted in this article. I show that comparative previsions satisfy qualitative analogues of de Finetti’s famous bookmaking theorem and his Fundamental Theorem of Prevision.The results of this article complement those of another article (Pedersen, Strictly coherent preferences, no holds barred, Manuscript, 2013). I explain how those results entail that any coherent weakly ordered system of comparative expectations over a unital linear space can be represented by an expectation function taking values in a (possibly non-Archimedean) totally ordered field extension of the system of real numbers. The ordered field extension consists of formal power series in a single infinitesimal, a natural and economical representation that provides a relief map tracing numerical non-Archimedean features to qualitative non-Archimedean features. (shrink)

The quantum transition probability assignment is an equiareal transformation from the annulus of symplectic spinorial amplitudes to the disk of complex state vectors, which makes it equivalent to the equiareal projection of Archimedes. The latter corresponds to a symplectic synchronization method, which applies to the quantum phase space in view of Weyl’s quantization approach involving an Abelian group of unitary ray rotations. We show that Archimedes’ method of synchronization, in terms of a measure-preserving transformation to an equiareal disk, imposes (...) the integrality of the quantum of action, and requires the extension of the classical moment map from the real line to the circle. Additionally, the same synchronization method is encoded in the structure of the Heisenberg group, viewed as a principal bundle with a connection, whose curvature and anholonomy is expressed in terms of area bounding loops in relation to the underlying Abelian shadow on a symplectic plane. In this manner, we show that the geometric phase pertains to the minimal synchronized area \ of the 2-d symplectic Abelian shadow of the symplectic ball, modulo \. The integrality condition naturally leads to the consideration of modular commutative observables pertaining to the role of the discrete Heisenberg group. We prove that the structural transition from non-commutativity to modular commutativity in accordance to Weyl’s group-theoretic commutation relations takes place via universal factorization through the discrete Heisenberg group. In this way, we derive a homology-theoretic formulation of the synchronization method in terms of the area-bounding cells of the modular lattice \ in relation to any Abelian symplectic shadow. Thus, we finally obtain the physical interpretation of the analytic representation of quantum states as theta functions corresponding to the sections of a complex line bundle with an integral symplectic structure. (shrink)

We study the representation of sets of desirable gambles by sets of probability mass functions. Sets of desirable gambles are a very general uncertainty model, that may be non-Archimedean, and therefore not representable by a set of probability mass functions. Recently, Cozman (2018) has shown that imposing the additional requirement of even convexity on sets of desirable gambles guarantees that they are representable by a set of probability mass functions. Already more that 20 years earlier, Seidenfeld (...) et al. (1995) gave an axiomatisation of binary preferences—on horse lotteries, rather than on gambles—that also leads to a unique representation in terms of sets of probability mass functions. To reach this goal, they use two devices, which we will call ‘SSK–Archimedeanity’ and ‘SSK–extension’. In this paper, we will make the arguments of Seidenfeld et al. (1995) explicit in the language of gambles, and show how their ideas imply even convexity and allow for conservative reasoning with evenly convex sets of desirable gambles, by deriving an equivalence between the SSK–Archimedean natural extension, the SSK–extension, and the evenly convex natural extension. (shrink)

A probability distribution is regular if it does not assign probability zero to any possible event. Williamson argued that we should not require probabilities to be regular, for if we do, certain “isomorphic” physical events must have different probabilities, which is implausible. His remarks suggest an assumption that chances are determined by intrinsic, qualitative circumstances. Weintraub responds that Williamson’s coin flip events differ in their inclusion relations to each other, or the inclusion relations between their times, and this (...) can account for their differences in probability. Haverkamp and Schulz rebut Weintraub, but their rebuttal fails because the events in their example are even less symmetric than Williamson’s. However, Weintraub’s argument also fails, for it ignores the distinction between intrinsic, qualitative differences and relations of time and bare identity. Weintraub could rescue her argument by claiming that the events differ in duration, under a non-standard and problematic conception of duration. However, we can modify Williamson’s example with Special Relativity so that there is no absolute inclusion relation between the times, and neither event has longer duration except relative to certain reference frames. Hence, Weintraub’s responses do not apply unless chance is observer-relative, which is also problematic. Finally, another symmetry argument defeats even the appeal to frame-dependent durations, for there the events have the same finite duration and are entirely disjoint, as are their respective times and places. (shrink)

To analyse contingent propositions, this paper investigates how branching time structures can be combined with probability theory. In particular, it considers assigning infinitesimal probabilities—available in non-Archimedean probability theory—to individual histories. This allows us to introduce the concept of ‘remote possibility’ as a new modal notion between ‘impossibility’ and ‘appreciable possibility’. The proposal is illustrated by applying it to a future contingent and a historical counterfactual concerning an infinite sequence of coin tosses. The latter is a toy model (...) that is used to illustrate the applicability of the proposal to more realistic physical models. (shrink)

One of the main assumptions of mathematical tools in science is represented by the idea of measurability and additivity of reality. For discovering the physical universe additive measures such as mass, force, energy, temperature, etc. are used. Economics and conventional business intelligence try to continue this empiricist tradition and in statistical and econometric tools they appeal only to the measurable aspects of reality. However, a lot of important variables of economic systems cannot be observable and additive in principle. These variables (...) can be called symbolic values or symbolic meanings and studied within symbolic interactionism, the theory developed since George Herbert Mead and Herbert Blumer. In statistical and econometric tools of business intelligence we accept only phenomena with causal connections measured by additive measures. In the paper we show that in the social world we deal with symbolic interactions which can be studied by non-additive labels. For accepting the variety of such phenomena we should avoid additivity of basic labels and construct a new probabilistic method in business intelligence based on non-Archimedean probabilities. (shrink)

In standard probability theory, probability zero is not the same as impossibility. But many have suggested that only impossible events should have probability zero. This can be arranged if we allow infinitesimal probabilities, but infinitesimals do not solve all of the problems. We will see that regular probabilities are not invariant over rigid transformations, even for simple, bounded, countable, constructive, and disjoint sets. Hence, regular chances cannot be determined by space-time invariant physical laws, and regular credences cannot (...) satisfy seemingly reasonable symmetry principles. Moreover, the examples here are immune to the objections against Williamson’s infinite coin flips. (shrink)

Non-Archimedean population axiologies – also known as lexical views – claim (i) that a sufficient number of lives at a very high positive welfare level would be better than any number of lives at a very low positive welfare level and/or (ii) that a sufficient number of lives at a very low negative welfare level would be worse than any number of lives at a very high negative welfare level. Such axiologies are popular because they can avoid the (Negative) (...) Repugnant Conclusion and satisfy the adequacy conditions given in the central impossibility result in population axiology due to Gustaf Arrhenius. I provide a novel argument against them which appeals to the way that good and bad lives can intuitively outweigh one another. (shrink)

Analyzing situations where information is partial, incomplete or contradictory has created a demand for quantitative belief measures that are weaker than classic probability theory. In this paper, we compare two frameworks that have been proposed for this task, Dempster-Shafer theory and non-standard probability theory based on Belnap-Dunn logic. We show the two frameworks to assume orthogonal perspectives on informational shortcomings, but also provide a partial correspondence result. Lastly, we also compare various dynamical rules of the two frameworks, all (...) seen as generalizations of classic Bayes’ conditioning. (shrink)

Classical real-valued probabilities come at a philosophical cost: in many infinite situations, they assign the same probability value—namely, zero—to cases that are impossible as well as to cases that are possible. There are three non-classical approaches to probability that can avoid this drawback: full conditional probabilities, qualitative probabilities and hyperreal probabilities. These approaches have been criticized for failing to preserve intuitive symmetries that can be preserved by the classical probability framework, but there has not been a systematic (...) study of the conditions under which these symmetries can and cannot be preserved. This paper fills that gap by giving complete characterizations under which symmetries understood in a certain “strong” way can be preserved by these non-classical probabilities, as well as by offering some results to make it plausible that the strong notion of symmetry here is the right one. Philosophical implications are briefly discussed, but the main purpose of the paper is to offer technical results to help make further philosophical discussion more sophisticated. (shrink)

We prove a representation theorem for preference relations over countably infinite lotteries that satisfy a generalized form of the Independence axiom, without assuming Continuity. The representing space consists of lexicographically ordered transfinite sequences of bounded real numbers. This result is generalized to preference orders on abstract superconvex spaces.

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)

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)

In previous work, a non-standard theory of probability was formulated and used to systematize interference effects involving the simplest type of quantum systems. The main result here is a self-contained, non-trivial generalization of that theory to capture interference effects involving a much broader range of quantum systems. The discussion also focuses on interpretive matters having to do with the actual/virtual distinction, non-locality, and conditional probabilities.

We study the impact of a kind of non‐archimedean stratifications (t‐stratifications) on tangent cones of definable sets in real closed fields. We prove that such stratifications induce stratifications of the same nature on the tangent cone of a definable set at a fixed point. As a consequence, the archimedean counterpart of a t‐stratification is shown to induce Whitney stratifications on the tangent cones of a semi‐algebraic set. Extensions of these results are proposed for real closed fields with further (...) structure. (shrink)

This article discusses the classical problem of zero probability of universal generalizations in Rudolf Carnap’s inductive logic. A correction rule for updating the inductive method on the basis of evidence will be presented. It will be shown that this rule has the effect that infinite streams of uniform evidence assume a non-zero limit probability. Since Carnap’s inductive logic is based on finite domains of individuals, the probability of the corresponding universal quantification changes accordingly. This implies that universal (...) generalizations can receive positive prior and posterior probabilities, even for (countably) infinite domains. (shrink)

Non-bivalent languages (languages containing sentences that can be true, false or neither) are given a probabilitistic interpretation in terms of betting quotients. Necessary and sufficient conditions for avoiding Dutch books—the laws of non-bivalent probability—in such a setting are provided.

Adams' famous thesis that the probabilities of conditionals are conditional probabilities is incompatible with standard probability theory. Indeed it is incompatible with any system of monotonic conditional probability satisfying the usual multiplication rule for conditional probabilities. This paper explores the possibility of accommodating Adams' thesis in systems of non-monotonic probability of varying strength. It shows that such systems impose many familiar lattice theoretic properties on their models as well as yielding interesting logics of conditionals, but that a (...) standard complementation operation cannot be defined within them, on pain of collapsing probability into bivalence. (shrink)

This book examines in detail two of the fundamental questions raised by quantum mechanics. First, is the world indeterministic? Second, are there connections between spatially separated objects? In the first part, the author examines several interpretations, focusing on how each proposes to solve the measurement problem and on how each treats probability. In the second part, the relationship between probability (specifically determinism and indeterminism) and non-locality is examined, and it is argued that there is a non-trivial relationship between (...) probability and non-locality. The author then re-examines some of the interpretations of part one of the book in the light of this argument, and considers how they fare with regard to locality and Lorentz invariance. The book will appeal to anyone with an interest in the interpretation of quantum mechanics, including researchers in the philosophy of physics and theoretical physics, as well as graduate students in those fields. (shrink)

In this article, we introduce a hierarchy on the class of non-archimedean Polish groups that admit a compatible complete left-invariant metric. We denote this hierarchy by $\alpha $ -CLI and L- $\alpha $ -CLI where $\alpha $ is a countable ordinal. We establish three results: (1) G is $0$ -CLI iff $G=\{1_G\}$ ; (2) G is $1$ -CLI iff G admits a compatible complete two-sided invariant metric; and (3) G is L- $\alpha $ -CLI iff G is locally $\alpha (...) $ -CLI, i.e., G contains an open subgroup that is $\alpha $ -CLI. Subsequently, we show this hierarchy is proper by constructing non-archimedean CLI Polish groups $G_\alpha $ and $H_\alpha $ for $\alpha <\omega _1$, such that: (1) $H_\alpha $ is $\alpha $ -CLI but not L- $\beta $ -CLI for $\beta <\alpha $ ; and (2) $G_\alpha $ is $(\alpha +1)$ -CLI but not L- $\alpha $ -CLI. (shrink)

A probability aggregation rule assigns to each profile of probability functions across a group of individuals (representing their individual probability assignments to some propositions) a collective probability function (representing the group's probability assignment). The rule is “non-manipulable” if no group member can manipulate the collective probability for any proposition in the direction of his or her own probability by misrepresenting his or her probability function (“strategic voting”). We show that, except in trivial (...) cases, no probability aggregation rule satisfying two mild conditions (non-dictatorship and consensus preservation) is non-manipulable. (shrink)

Application of recently developed non-Archimedean algebra to a flat and finite universe of total mass M 0 and radius R 0 is described. In this universe, mass m of a body and distance R between two points are bounded from above, i.e., 0≤m≤M 0, 0≤R≤R 0. The universe is characterized by an event horizon at R 0 (there is nothing beyond it, not even space). The radial distance metric is compressed toward horizon, which is shown to cause the phenomenon (...) of red shift. The corresponding modified Minkowski's metric and Lorentz transforms are obtained. Applications to Newtonian gravity shows a weakening at large scales (R→R 0) and a regular behavior as R→0. (shrink)

Many philosophers have claimed that extensive or additive measurement is incompatible with the existence of "higher values", any amount of which is better than any amount of some other value. In this paper, it is shown that higher values can be incorporated in a non-standard model of extensive measurement, with values represented by sets of ordered pairs of real numbers, rather than by single reals. The suggested model is mathematically fairly simple, and it applies to structures including negative as well (...) as positive values. (shrink)

A serious error in the proof of a recent characterization of the existence of full conditional probabilities invariant under symmetries is corrected.

This paper generalises an argument for probabilism due to Lindley [9]. I extend the argument to a number of non-classical logical settings whose truth-values, seen here as ideal aims for belief, are in the set $\{0,1\}$, and where logical consequence $\models $ is given the “no-drop” characterization. First I will show that, in each of these settings, an agent’s credence can only avoid accuracy-domination if its canonical transform is a (possibly non-classical) probability function. In other words, if an agent (...) values accuracy as the fundamental epistemic virtue, it is a necessary requirement for rationality that her credence have some probabilistic structure. Then I show that for a certain class of reasonable measures of inaccuracy, having such a probabilistic structure is sufficient to avoid accuracy-domination in these non-classical settings. (shrink)

We prove that under some technical assumptions on a general, non-classical probability space, the probability space is extendible into a larger probability space that is common cause closed in the sense of containing a common cause of every correlation between elements in the space. It is argued that the philosophical significance of this common cause completability result is that it allows the defence of the Common Cause Principle against certain attempts of falsification. Some open problems concerning possible (...) strengthening of the common cause completability result are formulated. (shrink)

Keynes's A Treatise on Probability (Keynes, 1921) contains some quite unusual concepts, such as non-numerical probabilities and the ‘weights of the arguments’ that support probability judgements. Their controversial interpretation gave rise to a huge literature about ‘what Keynes really did mean’, also because Keynes's later views in macroeconomics ultimately rest on his ideas on uncertainty and expectations formation.

We prove that under some technical assumptions on a general, non-classical probability space, the probability space is extendible into a larger probability space that is common cause closed in the sense of containing a common cause of every correlation between elements in the space. It is argued that the philosophical significance of this common cause completability result is that it allows the defence of the Common Cause principle against certain attempts of falsification. Some open problems concerning possible (...) strengthening of the common cause completability result are formulated. (shrink)

This section discusses mostly some unsolved problems. . . .I hope that some mathematicians who are interested in a classification of sets of real numbers, in particular sets with Lebesgue measure zero, will read it and try to find solutions for the problems here outlined.

We develop a dimension theory for D-semianalytic sets over an arbitrary non-Archimedean complete field. Our main results are the equivalence of several notions of dimension and a theorem on additivity of dimensions of projections and fibers in characteristic 0. We also prove a parameterized version of normalization for D-semianalytic sets.

A New Chance for Infinitesimals? This article discusses the connection between the Zenonian paradox of magnitude and probability on infinite sample spaces. Two important premises in the Zenonian argument are: the Archimedean axiom, which excludes infinitesimal magnitudes, and perfect additivity. Standard probability theory uses real numbers that satisfy the Archimedean axiom, but it rejects perfect additivity. The additivity requirement for real-valued probabilities is limited to countably infinite collections of mutually incompatible events. A consequence of this is (...) that there exists no standard probability function that describes a fair lottery on the natural numbers. If we reject the Archimedean axiom, allowing infinitesimal probability values, we can retain perfect additivity and describe a fair, countable infinite lottery. The article gives a historical overview to understand how the first option has become the current standard, whereas the latter remains ‘non-standard’. (shrink)

Are the real numbers rich enough to measure intelligence? We generalize a result of Alexander and Hutter about the so-called Legg-Hutter intelligence measures of reinforcement learning agents. Using the generalized result, we exhibit a paradox: in one particular version of the Legg-Hutter intelligence measure, certain agents all have intelligence 0, even though in a certain sense some of them outperform others. We show that this paradox disappears if we vary the Legg-Hutter intelligence measure to be hyperreal-valued rather than real-valued.

This paper is a comparison of how first-order Kyburgian Evidential Probability (EP), second-order EP, and objective Bayesian epistemology compare as to the KLM system-P rules for consequence relations and the monotonic / non-monotonic divide.