We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)

We propose a new theory based on the notions of marginal and large difference which has natural models in the context of nonstandard mathematics. We introduce the notion of finite marginality and show a representation result which ensures, for finitely marginal countable models, the existence of a homomorphism of the structure of marginal and large difference into a nonstandard model of the natural numbers, and show the extent to which any such homomorphism is unique. Finally, we show that our theory (...) constitutes part of the underlying abstract structure of three distinct philosophical theories of vagueness: Dean’s neofeasibilism, Itzhaki’s theory of nonstandard heuristics, and our own initial sketch of a nonstandard primitivism about vagueness. (shrink)

ABSTRACTA probability model is underdetermined when there is no rational reason to assign a particular infinitesimal value as the probability of single events. Pruss claims that hyperreal probabilities are underdetermined. The claim is based upon external hyperreal-valued measures. We show that internal hyperfinite measures are not underdetermined. The importance of internality stems from the fact that Robinson’s transfer principle only applies to internal entities. We also evaluate the claim that transferless ordered fields may have advantages over hyperreals in probabilistic modeling. (...) We show that probabilities developed over such fields are less expressive than hyperreal probabilities. (shrink)

The problem of how to rationally aggregate probability measures occurs in particular when a group of agents, each holding probabilistic beliefs, needs to rationalise a collective decision on the basis of a single ‘aggregate belief system’ and when an individual whose belief system is compatible with several probability measures wishes to evaluate her options on the basis of a single aggregate prior via classical expected utility theory. We investigate this problem by first recalling some negative results from preference and judgment (...) aggregation theory which show that the aggregate of several probability measures should not be conceived as the probability measure induced by the aggregate of the corresponding expected utility preferences. We describe how McConway’s :410–414, 1981) theory of probabilistic opinion pooling can be generalised to cover the case of the aggregation of infinite profiles of finitely additive probability measures, too; we prove the existence of aggregation functionals satisfying responsiveness axioms à la McConway plus additional desiderata even for infinite electorates. On the basis of the theory of propositional-attitude aggregation, we argue that this is the most natural aggregation theory for probability measures. Our aggregation functionals for the case of infinite electorates are neither oligarchic nor integral-based and satisfy a weak anonymity condition. The delicate set-theoretic status of integral-based aggregation functionals for infinite electorates is discussed. (shrink)

The small, the tiny, and the infinitesimal have been the object of both fascination and vilification for millenia. One of the most vitriolic reviews in mathematics was that written by Errett Bishop about Keisler’s book Elementary Calculus: an Infinitesimal Approach. In this skit we investigate both the argument itself, and some of its roots in Bishop George Berkeley’s criticism of Leibnizian and Newtonian Calculus. We also explore some of the consequences to students for whom the infinitesimal approach is congenial. The (...) casual mathematical reader may be satisfied to read the text of the five act play, whereas the others may wish to delve into the 130 footnotes, some of which contain elucidation of the mathematics or comments on the history. (shrink)

This note employs the recently established consistency theorem for infinite regresses of probabilistic justification (Herzberg in Stud Log 94(3):331–345, 2010) to address some of the better-known objections to epistemological infinitism. In addition, another proof for that consistency theorem is given; the new derivation no longer employs nonstandard analysis, but utilises the Daniell–Kolmogorov theorem.

The rejection of an infinitesimal solution to the zero-fit problem by A. Elga ([2004]) does not seem to appreciate the opportunities provided by the use of internal finitely-additive probability measures. Indeed, internal laws of probability can be used to find a satisfactory infinitesimal answer to many zero-fit problems, not only to the one suggested by Elga, but also to the Markov chain (that is, discrete and memory-less) models of reality. Moreover, the generalization of likelihoods that Elga has in mind is (...) not as hopeless as it appears to be in his article. In fact, for many practically important examples, through the use of likelihoods one can succeed in circumventing the zero-fit problem. 1 The Zero-fit Problem on Infinite State Spaces 2 Elga's Critique of the Infinitesimal Approach to the Zero-fit Problem 3 Two Examples for Infinitesimal Solutions to the Zero-fit Problem 4 Mathematical Modelling in Nonstandard Universes? 5 Are Nonstandard Models Unnatural? 6 Likelihoods and Densities A Internal Probability Measures and the Loeb Measure Construction B The (Countable) Coin Tossing Sequence Revisited C Solution to the Zero-fit Problem for a Finite-state Model without Memory D An Additional Note on ‘Integrating over Densities’ E Well-defined Continuous Versions of Density Functions. (shrink)

The strict dominance principle that a wager always paying better than another is rationally preferable is one of the least controversial principles in decision theory. I shall show that (given the Axiom of Choice) there is a contradiction between strict dominance and plausible isomorphism or symmetry conditions, by showing how in several natural cases one can construct isomorphic wagers one of which strictly dominates the other. In particular, I will show that there is a pair of wagers on the outcomes (...) of a uniform spinner which differ simply in where the zero degrees point of the spinner is defined to be but where one wager dominates the other. I shall also argue that someone who accepts Williamson’s famous argument that the probability of an infinite sequence of heads is zero should accept the symmetry conditions, and thus has reason to weaken the strict dominance principle, and I shall propose a restriction of the principle to “implementable” wagers. Our main result also has implications for social choice principles. (shrink)

A number of philosophers have attempted to solve the problem of null-probability possible events in Bayesian epistemology by proposing that there are infinitesimal probabilities. Hájek and Easwaran have argued that because there is no way to specify a particular hyperreal extension of the real numbers, solutions to the regularity problem involving infinitesimals, or at least hyperreal infinitesimals, involve an unsatisfactory ineffability or arbitrariness. The arguments depend on the alleged impossibility of picking out a particular hyperreal extension of the real numbers (...) and/or of a particular value within such an extension due to the use of the Axiom of Choice. However, it is false that the Axiom of Choice precludes a specification of a hyperreal extension—such an extension can indeed be specified. Moreover, for all we know, it is possible to explicitly specify particular infinitesimals within such an extension. Nonetheless, I prove that because any regular probability measure that has infinitesimal values can be replaced by one that has all the same intuitive features but other infinitesimal values, the heart of the arbitrariness objection remains. (shrink)

Timothy Williamson claimed to prove with a coin-tossing example that hyperreal probabilities cannot save the principle of regularity. A premise of his argument is that two specified infinitary events must be assigned the same probability because, he claims, they are isomorphic. But as has been pointed out, they are not isomorphic. A way of framing Williamson’s argument that does not make it depend on the isomorphism claim is in terms of shifts in Bernoulli processes, the usual mathematical model of sequential (...) coin tossing. But even so framed, the argument still fails. (shrink)

This article establishes the existence of a definable , countably saturated nonstandard enlargement of the superstructure over the reals. This nonstandard universe is obtained as the union of an inductive chain of bounded ultrapowers . The underlying ultrafilter is the one constructed by Kanovei and Shelah [10].

We present a uniform version of Di Nola Theorem, this enables to embed all MV-algebras of a bounded cardinality in an algebra of functions with values in a single non-standard ultrapower of the real interval [0,1]. This result also implies the existence, for any cardinal α, of a single MV-algebra in which all infinite MV-algebras of cardinality at most α embed. Recasting the above construction with iterated ultrapowers, we show how to construct such an algebra of values in a definable (...) way, thus providing a sort of “canonical” set of values for the functional representation. (shrink)

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

In a well-known paper, Timothy Williamson claimed to prove with a coin-flipping example that infinitesimal-valued probabilities cannot save the principle of Regularity, because on pain of inconsistency the event ‘all tosses land heads’ must be assigned probability 0, whether the probability function is hyperreal-valued or not. A premise of Williamson’s argument is that two infinitary events in that example must be assigned the same probability because they are isomorphic. It was argued by Howson that the claim of isomorphism fails, but (...) a more radical objection to Williamson’s argument is that it had been, in effect, refuted long before it was published. (shrink)

We analyze recent criticisms of the use of hyperreal probabilities as expressed by Pruss, Easwaran, Parker, and Williamson. We show that the alleged arbitrariness of hyperreal fields can be avoided by working in the Kanovei–Shelah model or in saturated models. We argue that some of the objections to hyperreal probabilities arise from hidden biases that favor Archimedean models. We discuss the advantage of the hyperreals over transferless fields with infinitesimals. In Paper II we analyze two underdetermination theorems by Pruss and (...) show that they hinge upon parasitic external hyperreal-valued measures, whereas internal hyperfinite measures are not underdetermined. (shrink)

Consider the regularity thesis that each possible event has non-zero probability. Hájek challenges this in two ways: there can be nonmeasurable events that have no probability at all and on a large enough sample space, some probabilities will have to be zero. But arguments for the existence of nonmeasurable events depend on the axiom of choice. We shall show that the existence of anything like regular probabilities is by itself enough to imply a weak version of AC sufficient to prove (...) the Banach–Tarski Paradox on the decomposition of a ball into two equally sized balls, and hence to show the existence of nonmeasurable events. This provides a powerful argument against unrestricted orthodox Bayesianism that works even without AC. A corollary of our formal result is that if every partial order extends to a total preorder while maintaining strict comparisons, then the Banach–Tarski Paradox holds. This yields an argument that incommensurability cannot be avoided in ambitious versions of decision theory. (shrink)

This paper presents an analysis of the sorites paradox for collective nouns and gradable adjectives within the framework of classical logic. The paradox is explained by distinguishing between qualitative and quantitative representations. This distinction is formally represented by the use of a different mathematical model for each type of representation. Quantitative representations induce Archimedean models, but qualitative representations induce non-Archimedean models. By using a non-standard model of \ called \, which contains infinite and infinitesimal numbers, the two paradoxes are shown (...) to have distinct structures. The sorites paradox for collective nouns arises from the use of infinite numbers, whereas the sorites paradox for gradable adjectives arises from the use of infinitesimal numbers. Each paradox can be traced to a different source of vagueness. The sorites paradox for collective nouns is caused by \, and the sorites paradox for gradable adjectives is caused by \ \. If correct, this analysis implies that infinite and infinitesimal numbers are cognitively real, and that they play a role in the semantic interpretation of natural language. (shrink)

Łoś's theorem for bounded D -ultrapowers, D being the ultrafilter introduced by Kanovei and Shelah [4], is established.

We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown to provide smooth proofs of several results in general model theory.