In this note, I point out a mathematically well-defined way of non-trivially comparing the sizes of uncountable sets of equal cardinality.

This paper deals with two different problems in which infinity plays a central role. I first respond to a claim that infinity renders counting knowledge-level beliefs an infeasible approach to measuring and comparing how much we know. There are two methods of comparing sizes of infinite sets, using the one-to-one correspondence principle or the subset principle, and I argue that we should use the subset principle for measuring knowledge. I then turn to the normalizability and coarse (...) tuning objections to fine-tuning arguments for the existence of God or a multiverse. These objections center on the difficulty of talking about the epistemic probability of a physical constant falling within a finite life-permitting range when the possible range of that constant is infinite. Applying the lessons learned regarding infinity and the measurement of knowledge, I hope to blunt much of the force of these objections to fine-tuning arguments. (shrink)

We show that strong measure zero sets -totally bounded metric space) can be characterized by the nonexistence of a winning strategy in a certain infinite game. We use this characterization to give a proof of the well known fact, originally conjectured by K. Prikry, that every dense \ subset of the real line contains a translate of every strong measure zero set. We also derive a related result which answers a question of J. Fickett.

Cantor’s theory of cardinal numbers offers a way to generalize arithmetic from finite sets to infinite sets using the notion of one-to-one association between two sets. As is well known, all countable infinite sets have the same ‘size’ in this account, namely that of the cardinality of the natural numbers. However, throughout the history of reflections on infinity another powerful intuition has played a major role: if a collectionAis properly included in a collectionBthen the (...) ‘size’ ofAshould be less than the ‘size’ ofB(part–whole principle). This second intuition was not developed mathematically in a satisfactory way until quite recently. In this article I begin by reviewing the contributions of some thinkers who argued in favor of the assignment of different sizes to infinite collections of natural numbers (Thabit ibn Qurra, Grosseteste, Maignan, Bolzano). Then, I review some recent mathematical developments that generalize the part–whole principle to infinite sets in a coherent fashion (Katz, Benci, Di Nasso, Forti). Finally, I show how these new developments are important for a proper evaluation of a number of positions in philosophy of mathematics which argue either for the inevitability of the Cantorian notion of infinite number (Gödel) or for the rational nature of the Cantorian generalization as opposed to that, based on the part–whole principle, envisaged by Bolzano (Kitcher). (shrink)

We classify the measures on the lattice ℒ of all closed subspaces of infinite-dimensional orthomodular spaces (E, Ψ) over fields of generalized power series with coefficients in ℝ. We prove that every σ-additive measure on ℒ can be obtained by lifting measures from the residual spaces of (E, Ψ). The measures being lifted are known, for the residual spaces are Euclidean. From the classification we deduce, among other things, that the set of all measures on ℒ is not separating.

We consider how to represent the measurable sets in an infinite measure space. We use sequences of simple measurable sets converging under metrics to represent general measurable sets. Then we study the computability of the measure and the set operators of measurable sets with respect to such representations.

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)

We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of (...) the computable topological spaces constructed. (shrink)

We study randomness beyond${\rm{\Pi }}_1^1$-randomness and its Martin-Löf type variant, which was introduced in [16] and further studied in [3]. Here we focus on a class strictly between${\rm{\Pi }}_1^1$and${\rm{\Sigma }}_2^1$that is given by the infinite time Turing machines introduced by Hamkins and Kidder. The main results show that the randomness notions associated with this class have several desirable properties, which resemble those of classical random notions such as Martin-Löf randomness and randomness notions defined via effective descriptive set theory such (...) as${\rm{\Pi }}_1^1$-randomness. For instance, mutual randoms do not share information and a version of van Lambalgen’s theorem holds.Towards these results, we prove the following analogue to a theorem of Sacks. If a real is infinite time Turing computable relative to all reals in some given set of reals with positive Lebesgue measure, then it is already infinite time Turing computable. As a technical tool towards this result, we prove facts of independent interest about random forcing over increasing unions of admissible sets, which allow efficient proofs of some classical results about hyperarithmetic sets. (shrink)

In ‘Fair Infinite Lotteries’ (FIL), Wenmackers and Horsten use non-standard analysis to construct a family of nicely-behaved hyperrational-valued probability measures on sets of natural numbers. Each probability measure in FIL is determined by a free ultrafilter on the natural numbers: distinct free ultrafilters determine distinct probability measures. The authors reply to a worry about a consequent ‘arbitrariness’ by remarking, “A different choice of free ultrafilter produces a different ... probability function with the same standard part but infinitesimal differences.” (...) They illustrate this remark with the example of the sets of odd and even numbers. Depending on the ultrafilter, either each of these sets has probability 1/2, or the set of odd numbers has a probability infinitesimally higher than 1/2 and the set of even numbers infinitesimally lower. The point of the current paper is simply that the amount of indeterminacy is much greater than acknowledged in FIL: there are sets of natural numbers whose probability is far more indeterminate than that of the set of odd or the set of even numbers. (shrink)

000000001. Introduction Call a theory of the good—be it moral or prudential—aggregative just in case (1) it recognizes local (or location-relative) goodness, and (2) the goodness of states of affairs is based on some aggregation of local goodness. The locations for local goodness might be points or regions in time, space, or space-time; or they might be people, or states of nature.1 Any method of aggregation is allowed: totaling, averaging, measuring the equality of the distribution, measuring the minimum, (...) etc.. Call a theory of the good finitely additive just in case it is aggregative, and for any finite set of locations it aggregates by adding together the goodness at those locations. Standard versions of total utilitarianism typically invoke finitely additive value theories (with people as locations). A puzzle can arise when finitely additive value theories are applied to cases involving an infinite number of locations (people, times, etc.). Suppose, for example, that temporal locations are the locus of value, and that time is discrete, and has no beginning or end.2 How would a finitely additive theory (e.g., a temporal version of total utilitarianism) judge the following two worlds? Goodness at Locations (e.g. times) w1:..., 2, 2, 2, 2, 2, 2, 2, 2, 2, ..... w2:..., 1, 1, 1, 1, 1, 1, 1, 1, 1, ..... Example 1 At each time w1 contains 2 units of goodness and w2 contains only 1. Intuitively, we claim, if the locations are the same in each world, finitely additive theorists will want to claim that w1 is better than w2. But it's not clear how they could coherently hold this view. For using standard mathematics the sum of each is the same infinity, and so there seems to be no basis for claiming that one is better than the other.3 (Appealing to Cantorian infinities is of no help here, since for any Cantorian infinite N, 2xN=1xN.). (shrink)

On our ordinary representations of space, space is composed of indivisible, dimensionless points; extended regions are understood as infinite sets of points. Region-based theories of space reverse this atomistic picture, by taking as primitive several relations on extended regions, and recovering points as higher-order abstractions from regions. Over the years, such theories have focused almost exclusively on the topological and geometric structure of space. We introduce to region-based theories of space a new primitive binary relation (‘qualitative probability’) that (...) is tied to _measure_. It expresses that one region is _smaller than or equal in size_ to another. Algebraic models of our theory are _separation_ _σ_-_algebras with qualitative probability_: \((\mathbb {B}, \ll, \preceq )\), where \(\mathbb {B}\) is a Boolean _σ_-algebra, ≪ is a separation relation on \(\mathbb {B}\), and ≼ is a qualitative probability on \(\mathbb {B}\). We show that from algebraic models of this kind we can, in an interesting class of cases, recover a compact Hausdorff topology _X_, together with a countably additive measure _μ_ on a _σ_-field of Borel subsets of that topology, and that \((\mathbb {B}, \ll, \preceq )\) is isomorphic to a ‘standard model’ arising out of the pair (_X_, _μ_). It follows from one of our main results that any closed ball in Euclidean space, \(\mathbb {R}^{n}\), together with Lebesgue measure arises in this way from a separation _σ_-algebra with qualitative probability. (shrink)

We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, (...) unresetting and resetting infinite-time register machines, and α-Turing machines for countable admissible ordinals α. (shrink)

This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the (...) shortest input string for U to output s. In the other way, the so-called universal probability m is introduced first, and then H is defined as –log2m without reference to the concept of program-size.Mathematically, the statistics of outcomes in a quantum measurement are described by a positive operator-valued measure in the most general setting. Based on the theory of computability structures on a Banach space developed by Pour-El and Richards, we extend the universal probability to an analogue of POVM in an infinite dimensional quantum system, called a universal semi-POVM. We also give another characterization of Chaitin's Ω numbers by universal probabilities. Then, based on this characterization, we propose to define an extension of Ω as a sum of the POVM elements of a universal semi-POVM. The validity of this definition is discussed.In what follows, we introduce an operator version equation image of H in a Hilbert space of infinite dimension using a universal semi-POVM, and study its properties. (shrink)

The great mathematician, physicist, and philosopher, Hermann Weyl, once called mathematics the “science of the infinite.” This is a fitting title: contemporary mathematics—especially Cantorian set theory—provides us with marvelous ways of taming and clarifying the infinite. Nonetheless, I believe that the epistemic significance of mathematical infinity remains poorly understood. This dissertation investigates the role of the infinite in three diverse areas of study: number theory, cosmology, and probability theory. A discovery that emerges from my work is that (...) the epistemic role of the infinite varies, often in surprising ways, across different domains of knowledge. -/- My first chapter examines the role of mathematical infinity in number theory. It is reasonable to think that theorems concerning finite patterns and structures in the natural numbers are particularly “simple” or “elementary.” Indeed, such statements are comprehensible to a wide range of investigators, regardless of their mathematical training. One might then expect proofs of these theorems to be similarly comprehensible. However, many proofs, especially those that utilize only finitary methods, are exceedingly difficult to understand. Consequently, one finds that finitary theorems are often re-proved using infinitary techniques. My claim is that this is because infinitary proofs are often explanatory, while finitary proofs are not. This chapter analyzes why this is the case. Along the way, I investigate other questions of long-standing interest in the philosophy of mathematics, e.g., the role of purity/impurity ascriptions and the nature of the content of a theorem. In particular, I diagnose the explanatory potential of the infinite by articulating a new construal of content. This new construal both saves intuitive epistemic ascriptions made in mathematical practice and explains the unexpected role of the infinite in providing explanatory proofs of finitary statements. Thus, in number theory, my claim is that the infinite often plays an explanatory role. -/- My second chapter turns to the role of the infinite in cosmology. It investigates a question much discussed by philosophers and physicists alike: is the spatial extent of the universe finite or infinite? Contemporary cosmological research has indicated that one of the essential determinants of the extent of the universe is the topology we ascribe to space. Topology is a global property, which may suggest that it is not testable through local observation. Nonetheless, some cosmologists have indicated that it may be empirically detected, thereby providing an answer to the question of spatial extent. I argue that, in fact, the epistemic status of the topology of space is extremely subtle and not well captured by any of the categories commonly employed by philosophers of science. In particular, I argue that topological properties are neither empirical nor a priori (even in suitably weakened senses). Furthermore, I claim that we should prefer topological properties that generate finite universe models (consistent with our best data) in order to avoid extremely thorny issues concerning the physics of an infinite universe. I argue for such a preference on the grounds of the simplicity and explanatory power of finite universe models. Thus, in cosmology, my claim is that the finite often plays an explanatory and simplifying role. -/- My third chapter investigates several paradoxes that arise in the foundations of infinitary probability theory: the Label Invariance Paradox, God’s Lottery, and Bertrand’s Paradox. I argue that these have been poorly understood because they do not expressly concern probability theory, but rather our intuitions about—and formal techniques for dealing with— infinite sets. The paradoxes in question are, in fact, symptoms of our complete reliance upon Cantorian cardinality and its associated criterion of sameness of “size.” That is, two sets have the same cardinality if and only if the elements of the sets can be placed in 1-1 correspondence. When applied to infinite sets, this criterion produces counterintuitive verdicts. For instance, given a fair lottery on the natural numbers, we expect that the probability of drawing an even number is 1/2, and likewise for drawing an odd number. However, one can construct “relabellings” of the naturals such that the probability of drawing an even number remains 1/2, while the probability for drawing an odd number becomes 1/4. I argue that, ultimately, it is the coarseness of Cantorian cardinality that generates the probabilistic paradoxes. I then propose that finer-grained measures of infinite sets from mathematical logic and number theory can help to dissolve the paradoxes in question. Thus, in probability theory, we find that particular kinds of infinitary techniques effectively systematize our theory, while others lead to paradox. (shrink)

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals κ with the property that the collection of all initial segments of the wellordering is definable by a Σ1‐formula with parameter κ. A short argument shows that the existence of a measurable cardinal δ implies that such wellorderings do not exist at δ‐inaccessible cardinals of cofinality not equal to δ and their successors. In contrast, our main result (...) shows that these wellorderings exist at all other uncountable cardinals in the minimal model containing a measurable cardinal. In addition, we show that measurability is the smallest large cardinal property that imposes restrictions on the existence of such wellorderings at uncountable cardinals. Finally, we generalise the above result to the minimal model containing two measurable cardinals. (shrink)

The measurement of one or more observables can be considered to yield sample points which are in general fuzzy sets. Operationally these fuzzy sample points are the outcomes of calibration procedures undertaken to ensure the internal consistency of a scheme of measurement. By introducing generalized probability measures on σ-semifields of fuzzy events, one can view a quantum mechanical state as an ensemble of probability measures which specify the likelihood of occurrence of any specific fuzzy sample point at some instant. (...) These sample points are the possible outcomes of any infinitely rapid succession of measurements at that instant of any sequence of observables of the system. (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...) or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (shrink)

We recall one Tarski's result about the existence of a non-zero additive measure defined on power set of an infinite set vanishing on finite subsets. This rather surprising result goes back to 1930 and it allows to introduce a non-trivial linear functional invariant under changes of finitely many inputs.

It is proved that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the infinite symmetric group S ∞ is continuous. It is also shown that a universally measurable homomorphism from a Polish group into a second countable, locally compact group is necessarily continuous.

A Π01 class is an effectively closed set of reals. We study properties of these classes determined by cardinality, measure and category as well as by the complexity of the members of a class P. Given an effective enumeration {Pe:e < ω} of the Π01 classes, the index set I for a certain property is the set of indices e such that Pe has the property. For example, the index set of binary Π01 classes of positive measure is Σ02 complete. (...) Various notions of boundedness are discussed and classified. For example, the index set of the recursively bounded classes is Σ03 complete and the index set of the recursively bounded classes which have infinitely many recursive members is Π04 complete. Consideration of the Cantor-Bendixson derivative leads to index sets in the transfinite levels of the hyperarithmetic hierarchy. (shrink)

We prove two theorems which in a certain sense show that the number of normal measures a measurable cardinal κ can carry is independent of a given fixed behavior of the continuum function on any set having measure 1 with respect to every normal measure over κ . First, starting with a model V ⊨ “ZFC + GCH + o = δ*” for δ* ≤ κ+ any finite or infinite cardinal, we force and construct an inner model N ⊆ (...) V [G] so thatN ⊨ “ZF + [DCδ] + ¬ACκ + κ carries exactly δ* normal measures + 2δ = δ++ on a set having measure 1 with respect to every normal measure over κ”.There is nothing special about 2δ = δ here, and other stated values for the continuum function will be possible as well. Then, starting with a modelV ⊨ “ZFC + GCH + κis supercompact”,we force and construct models of AC in which, roughly speaking, regardless of the specified behavior of the continuum function below κ on any set having measure 1 with respect to every normal measure over κ, κ can in essence carry any number of normal measures δ* ≥ κ++. (shrink)

§1. I will start with a quick definition of descriptive set theory: It is the study of the structure of definable sets and functions in separable completely metrizable spaces. Such spaces are usually called Polish spaces. Typical examples are ℝn, ℂn, Hilbert space and more generally all separable Banach spaces, the Cantor space 2ℕ, the Baire space ℕℕ, the infinite symmetric group S∞, the unitary group, the group of measure preserving transformations of the unit interval, etc.In this theory (...) sets are classified in hierarchies according to the complexity of their definitions and the structure of sets in each level of these hierarchies is systematically analyzed. In the beginning we have the Borel sets in Polish spaces, obtained by starting with the open sets and closing under the operations of complementation and countable unions, and the corresponding Borel hierarchy. After this come the projective sets, obtained by starting with the Borel sets and closing under the operations of complementation and projection, and the corresponding projective hierarchy.There are also transfinite extensions of the projective hierarchy and even much more complex definable sets studied in descriptive set theory, but I will restrict myself here to Borel and projective sets, in fact just those at the first level of the projective hierarchy, i.e., the Borel (), analytic () and coanalytic () sets. (shrink)

Let κ be an infinite cardinal. A κ-complete nonprincipal ultrafilter, or, for short, a κ- ultrafilter on a set A is a (nonempty) family U of subsets of A satisfying (i) S ⊆ U & |S|1 < κ ⇒ ∩S ∈ U (κ-completeness) (ii) X ∈ U & X ⊆ Y ⊆ A ⇒ Y ∈ U, (iii) ∀X ⊆ A [X ∈ U or A – X ∈ U] (iv) {a} ∉ U for any a..

In 2002 Coecke and Martin (Research Report PRG-RR-02-07, Oxford University Computing Laboratory, 2002) created a model for the finite classical and quantum states in physics. This model is based on a type of ordered set which is standard in the study of information systems. It allows the information content of its elements to be compared and measured. Their work is extended to a model for the infinite classical states. These are the states which result when an observable is applied (...) to a quantum system. When this extended order is restricted to a finite number of coordinates, the model of Coecke and Martin is obtained. The infinite model retains many desirable aspects of the finite model, such as pure states as maximal elements and expected behavior of thermodynamic entropy. But it looses some of the important domain theoretic aspects, such as having a least element and exactness. Shannon entropy is no longer defined over the entire model and both it and thermodynamic entropy cease to be a measurements in the sense of Martin. (shrink)

It, is shown that Birkhoff –von Neumann quantum logic (i.e., an orthomodular lattice or poset) possessing an ordering set of probability measures S can be isomorphically represented as a family of fuzzy subsets of S or, equivalently, as a family of propositional functions with arguments ranging over S and belonging to the domain of infinite-valued Łukasiewicz logic. This representation endows BvN quantum logic with a new pair of partially defined binary operations, different from the order-theoretic ones: Łukasiewicz intersection and (...) union of fuzzy sets in the first case and Łukasiewicz conjunction and disjunction in the second. Relations between old and new operations are studied and it is shown that although they coincide whenever new operations are defined, they are not identical in general. The hypothesis that quantum-logical conjunction and disjunction should be represented by Łukasiewicz operations, not by order-theoretic join and meet is formulated and some of its possible consequences are considered. (shrink)

Current axiomatizations for extensive measurement postulate the existence of infinitely small objects. This assumption is neither necessary nor reasonable. This paper develops this theme and presents a more acceptable axiom system. A representation theorem is stated and proved in detail. This work improves some previous results of the author.

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable (...) colorings agree below $\emptyset'$ but not in general. We also answer the analogs of two well-known questions about the stable Ramsey's theorem by showing that our weaker principle does not imply COH or WKL 0 in the context of reverse mathematics. (shrink)

We generalize Solovay's unfolding technique for infinite games and use an Unfolding Theorem to give a uniform method to prove that all analytic sets are in the $\sigma$ -algebras of measurability connected with well-known forcing notions.

It is shown that, for certain classes of cosmological model which either postulate or give rise to infinitely many universes, only a measure zero subset of the set of possible universes above a given size can in fact be physically realized. It follows that claims to explain the fine tuning of our universe on the basis of such models by appeal to the existence of all possible universes fail.

In the paper it is shown that every physically sound Birkhoff – von Neumann quantum logic, i.e., an orthomodular partially ordered set with an ordering set of probability measures can be treated as partial infinite-valued Łukasiewicz logic, which unifies two competing approaches: the many-valued, and the two-valued but non-distributive, which have co-existed in the quantum logic theory since its very beginning.

A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually defined with respect to the uniform measure on the set of all sequences, but extend canonically to other computable probability measures. This way each notion of randomness induces an equivalence relation on the computable probability measures where two measures are equivalent if they have the same set of random sequences. In what (...) follows, we study the equivalence relations induced by Martin-Löf randomness, computable randomness, Schnorr randomness and Kurtz randomness, together with the relations of equivalence and consistency from probability theory. We show that all these relations coincide when restricted to the class of computable strongly positive generalized Bernoulli measures. For the case of arbitrary computable measures, we obtain a complete and somewhat surprising picture of the implications between these relations that hold in general. (shrink)

We reconsider some classical natural semantics of integers in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self-enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations (...) and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations . This contrasts with the well-known fact that usual Kolmogorov complexity does not depend on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (shrink)

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers ω as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on ω. (...) For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on ω is ubiquitous in the set of linear orderings on ω. (shrink)

The quantum information introduced by quantum mechanics is equivalent to a certain generalization of classical information: from finite to infinite series or collections. The quantity of information is the quantity of choices measured in the units of elementary choice. The “qubit”, can be interpreted as that generalization of “bit”, which is a choice among a continuum of alternatives. The axiom of choice is necessary for quantum information. The coherent state is transformed into a well-ordered series of results in time (...) after measurement. The quantity of quantum information is the transfinite ordinal number corresponding to the infinity series in question. The transfinite ordinal numbers can be defined as ambiguously corresponding “transfinite natural numbers” generalizing the natural numbers of Peano arithmetic to “Hilbert arithmetic” allowing for the unification of the foundations of mathematics and quantum mechanics. (shrink)

Paolo Mancosu provides an original investigation of historical and systematic aspects of the notions of abstraction and infinity and their interaction. A familiar way of introducing concepts in mathematics rests on so-called definitions by abstraction. An example of this is Hume's Principle, which introduces the concept of number by stating that two concepts have the same number if and only if the objects falling under each one of them can be put in one-one correspondence. This principle is at the core (...) of neo-logicism. In the first two chapters of the book, Mancosu provides a historical analysis of the mathematical uses and foundational discussion of definitions by abstraction up to Frege, Peano, and Russell. Chapter one shows that abstraction principles were quite widespread in the mathematical practice that preceded Frege's discussion of them and the second chapter provides the first contextual analysis of Frege's discussion of abstraction principles in section 64 of the Grundlagen. In the second part of the book, Mancosu discusses a novel approach to measuring the size of infinite sets known as the theory of numerosities and shows how this new development leads to deep mathematical, historical, and philosophical problems. The final chapter of the book explore how this theory of numerosities can be exploited to provide surprisingly novel perspectives on neo-logicism. (shrink)

We show that the predicate “x is the power set of y” is ‐definable, if V = L[E] is an extender model constructed from a coherent sequences of extenders, provided that there is no inner model with a Woodin cardinal. Here is a predicate true of just the infinite cardinals. From this we conclude: the validities of second order logic are reducible to, the set of validities of the Härtig quantifier logic. Further we show that if no L[E] model (...) has a cardinal strong up to one of its ℵ‐fixed points, and, the Löwenheim number of this logic, is less than the least weakly inaccessible δ, then (i) is a limit of measurable cardinals of K, and (ii) the Weak Covering Lemma holds at δ. (shrink)

The discipline of parallelization in the manifold of all possible measurement results is shown to be responsible for the existence of all quantum correlations, with the upper bound on their strength stemming from the maximum of possible torsion within all norm-composing parallelizable manifolds. A profound interplay is thus uncovered between the existence and strength of quantum correlations and the parallelizability of the spheres S^0, S^1, S^3, and S^7 necessitated by the four real division algebras. In particular, parallelization within a unit (...) 3-sphere is shown to be responsible for the existence of EPR and Hardy type correlations, whereas that within a unit 7-sphere is shown to be responsible for the existence of all GHZ type correlations. Moreover, parallelizability in general is shown to be equivalent to the completeness criterion of EPR, in addition to necessitating the locality condition of Bell. It is therefore shown to predetermine both the local outcomes as well as the quantum correlations among the remote outcomes, dictated by the infinite factorizability of points within the spheres S^3 and S^7. The twin illusions of quantum entanglement and non-locality are thus shown to stem from the topologically incomplete accountings of the measurement results. (shrink)

We analyze combinatorial properties of open covers of sets of real numbers by using filters on the natural numbers. In fact, the goal of this paper is to characterize known properties related to ω-covers of the space in terms of combinatorial properties of filters associated with these ω-covers. As an example, we show that all finite powers of a set R of real numbers have the covering property of Menger if, and only if, each filter on ω associated with (...) its countable ω-cover is a P + filter. (shrink)

The traditional use of ergodic theory in the foundations of equilibrium statistical mechanics is that it provides a link between thermodynamic observables and microcanonical probabilities. First of all, the ergodic theorem demonstrates the equality of microcanonical phase averages and infinite time averages (albeit for a special class of systems, and up to a measure zero set of exceptions). Secondly, one argues that actual measurements of thermodynamic quantities yield time averaged quantities, since measurements take a long time. The combination of (...) these two points is held to be an explanation why calculating microcanonical phase averages is a successful algorithm for predicting the values of thermodynamic observables. It is also well-known that this account is problematic.

This survey intends to show that ergodic theory nevertheless may have important roles to play, and it explores three other uses of ergodic theory. Particular attention is paid, firstly, to the relevance of specific interpretations of probability, and secondly, to the way in which the concern with systems in thermal equilibrium is translated into probabilistic language. With respect to the latter point, it is argued that equilibrium should not be represented as a stationary probability distribution as is standardly done; instead, a weaker definition is presented. (shrink)

There is an ongoing debate over cosmological fine-tuning between those holding that design is the best explanation and those who favor a multiverse. A small group of critics has recently challenged both sides, charging that their probabilistic intuitions are unfounded. If the critics are correct, then a growing literature in both philosophy and physics lacks a mathematical foundation. In this paper, I show that just such a foundation exists. Cosmologists are now providing the kinds of measure-theoretic arguments needed to make (...) the case for fine-tuning. Introduction Probability and infinite sets 2.1 No probability function 2.2 Arbitrary and wrong probability functions The measure of the universe The coarse-tuning objection Arbitrariness and error Conclusion. (shrink)

We suggest a new approach for addressing the problem of establishing an axiomatic foundation for large cardinals. An axiom asserting the existence of a large cardinal can naturally be viewed as a strong Axiom of Infinity. However, it has not been clear on the basis of our knowledge of ω itself, or of generally agreed upon intuitions about the true nature of the mathematical universe, what the right strengthening of the Axiom of Infinity is—which large cardinals ought to be derivable? (...) It was shown in the 1960s by Lawvere that the existence of an infinite set is equivalent to the existence of a certain kind of structure-preserving transformation from V to itself, not isomorphic to the identity. We use Lawvere's transformation, rather than ω, as a starting point for a reasonably natural sequence of strengthenings and refinements, leading to a proposed strong Axiom of Infinity. A first refinement was discussed in later work by Trnková—Blass, showing that if the preservation properties of Lawvere's tranformation are strengthened to the point of requiring it to be an exact functor , such a transformation is provably equivalent to the existence of a measurable cardinal. We propose to push the preservation properties as far as possible, short of inconsistency. The resulting transformation V→V is strong enough to account for virtually all large cardinals, but is at the same time a natural generalization of an assertion about transformations V→V known to be equivalent to the Axiom of Infinity. (shrink)

Despite the importance of the variational principles of physics, there have been relatively few attempts to consider them for a realistic framework. In addition to the old teleological question, this paper continues the recent discussion regarding the modal involvement of the principle of least action and its relations with the Humean view of the laws of nature. The reality of possible paths in the principle of least action is examined from the perspectives of the contemporary metaphysics of modality and Leibniz's (...) concept of essences or possibles striving for existence. I elaborate a modal interpretation of the principle of least action that replaces a classical representation of a system's motion along a single history in the actual modality by simultaneous motions along an infinite set of all possible histories in the possible modality. This model is based on an intuition that deep ontological connections exist between the possible paths in the principle of least action and possible quantum histories in the Feynman path integral. I interpret the action as a physical measure of the essence of every possible history. Therefore only one actual history has the highest degree of the essence and minimal action. To address the issue of necessity, I assume that the principle of least action has a general physical necessity and lies between the laws of motion with a limited physical necessity and certain laws with a metaphysical necessity. (shrink)

Gyenis and Rédei (G&R) have shown that any prior _p_ on a finite algebra _A_, however chosen, significantly restricts the set of posteriors derivable from _p_ by Jeffrey conditioning (JC) on a nontrivial measurable partition (i.e., a partition consisting of members of _A_, at least one of which is not an atom of _A_). They support this claim by proving that the set of potential posteriors _not derivable_ from _p_ in this way, which they call the _Bayes blind spot of (...) p_, is large, having cardinality _c_ and normalized Lebesgue measure 1, as well as being of second Baire category for a natural metrizable topology. In the present paper, we establish results analogous to those of G&R for probability measures on any infinite sigma algebra of subsets of a countably infinite set (which requires distinctly different treatments of the topological and measure-theoretic cases). We also show, in both the finite and infinite cases, that all of the limitative results for a single prior _p_ continue to hold for the intersection of the Bayes blind spots of countably many priors. This leads us to reject the claim of G&R that the large size of blind spots in the single prior case is attributable to the limitations imposed by priors. We argue instead that it is the so-called _rigidity property_ of JC that accounts for the large size of Bayes blind spots. G&R also prove that _any_ potential posterior _q_ can be derived from a prior _p_ by at most two applications of JC on nontrivial partitions. But they remark that their particular two-stage derivation of an \(r \in BS(p)\) from _p_ is barely distinguishable from a single, complete reassessment on a trivial partition. We show, however, that there are two-stage derivations of _r_ from _p_ that require no direct assessment of the probability of any atom at either stage. Finally, in order to situate the aforementioned limitative results in the proper context, we demonstrate that a probability revision that would amount to complete reassessment within a Jeffrey evidentiary framework may arise, in a different evidentiary framework, in a way that involves no direct assessment of the probability of any atom, as, for example, in a generalization of Jeffrey’s solution to the problem of old evidence and new explanation. (shrink)

In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unifier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.

This textbook is designed for an Introduction to Proofs course organized around the themes of number and space. Concepts are illustrated using both geometric and number examples, while frequent analogies and applications help build intuition and context in the humanities, arts, and sciences. Sophisticated mathematical ideas are introduced early and then revisited several times in a spiral structure, allowing students to progressively develop rigorous thinking. Throughout, the presentation is enlivened with whimsical illustrations, apt quotations, and glimpses of mathematical history and (...) culture. Early chapters integrate an introduction to sets, logic, and beginning proof techniques with a first exposure to more advanced mathematical structures. The middle chapters focus on equivalence relations, functions, and induction. Carefully chosen examples elucidate familiar topics, such as natural and rational numbers and angle measurements, as well as new mathematics, such as modular arithmetic and beginning graph theory. The book concludes with a thorough exploration of the cardinalities of finite and infinite sets and, in two optional chapters, brings all the topics together by constructing the real numbers and other complete metric spaces. Designed to foster the mental flexibility and rigorous thinking needed for advanced mathematics, Introduction to Mathematics suits either a lecture-based or flipped classroom. A year of mathematics, statistics, or computer science at the university level is assumed, but the main prerequisite is the willingness to engage in a new challenge. (shrink)

The axiom of infinity states that infinite sets exist. I will argue that this axiom lacks justification. I start by showing that the axiom is not self-evident, so it needs separate justification. Following Maddy’s :481–511, 1988) distinction, I argue that the axiom of infinity lacks both intrinsic and extrinsic justification. Crucial to my project is Skolem’s From Frege to Gödel: a source book in mathematical logic, 1879–1931, Cambridge, Harvard University Press, pp. 290–301, 1922) distinction between a theory of (...) real sets, and a theory of objects that theory calls “sets”. While Dedekind’s argument fails, his approach was correct: the axiom of infinity needs a justification it currently lacks. This epistemic situation is at variance with everyday mathematical practice. A dilemma ensues: should we relax epistemic standards or insist, in a skeptical vein, that a foundational problem has been ignored? (shrink)

Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are a wide variety of classical theorems in various branches of mathematics where ultrafilters are applied in their proof, and other classical theorems that deal directly with ultrafilters. The objective of this article is to contribute (in a divulgative way) to ultrafilter research by describing the demonstrations of some such theorems related (uniquely or in combination) to topology, Measure Theory, algebra, combinatorial infinite, set theory and first-order (...) logic, also formulating some updated open problems of set theory that refer to non-principal ultrafilters on N, the Mathias’s model and the Solovay’s model. -/- Resumen: Los ultrafiltros son objetos matemáticos muy importantes en la investigación matemática [6, 22, 23]. Existen una gran variedad de teoremas clásicos en diversas ramas de la matemática donde se aplican ultrafiltros en su demostración, y otros teoremas clásicos que tratan directamente sobre ultrafiltros. El objetivo de este artículo es contribuir (de una manera divulgativa) con la investigación sobre ultrafiltros describiendo las demostraciones de algunos de tales teoremas relacionados (de manera única o combinada) con topología, teoría de la medida, álgebra, combinatoria infinita, teoría de conjuntos y lógica de primer orden, formulando además algunos problemas abiertos actuales de la teoría de conjuntos que se refieren a ultrafiltros no principales sobre N, al Modelo de Mathias y al Modelo de Solovay. (shrink)

The way, in which quantum information can unify quantum mechanics (and therefore the standard model) and general relativity, is investigated. Quantum information is defined as the generalization of the concept of information as to the choice among infinite sets of alternatives. Relevantly, the axiom of choice is necessary in general. The unit of quantum information, a qubit is interpreted as a relevant elementary choice among an infinite set of alternatives generalizing that of a bit. The invariance to (...) the axiom of choice shared by quantum mechanics is introduced: It constitutes quantum information as the relation of any state unorderable in principle (e.g. any coherent quantum state before measurement) and the same state already well-ordered (e.g. the well-ordered statistical ensemble of the measurement of the quantum system at issue). This allows of equating the classical and quantum time correspondingly as the well-ordering of any physical quantity or quantities and their coherent superposition. That equating is interpretable as the isomorphism of Minkowski space and Hilbert space. Quantum information is the structure interpretable in both ways and thus underlying their unification. Its deformation is representable correspondingly as gravitation in the deformed pseudo-Riemannian space of general relativity and the entanglement of two or more quantum systems. The standard model studies a single quantum system and thus privileges a single reference frame turning out to be inertial for the generalized symmetry [U(1)]X[SU(2)]X[SU(3)] “gauging” the standard model. As the standard model refers to a single quantum system, it is necessarily linear and thus the corresponding privileged reference frame is necessary inertial. The Higgs mechanism U(1) → [U(1)]X[SU(2)] confirmed enough already experimentally describes exactly the choice of the initial position of a privileged reference frame as the corresponding breaking of the symmetry. The standard model defines ‘mass at rest’ linearly and absolutely, but general relativity non-linearly and relatively. The “Big Bang” hypothesis is additional interpreting that position as that of the “Big Bang”. It serves also in order to reconcile the linear standard model in the singularity of the “Big Bang” with the observed nonlinearity of the further expansion of the universe described very well by general relativity. Quantum information links the standard model and general relativity in another way by mediation of entanglement. The linearity and absoluteness of the former and the nonlinearity and relativeness of the latter can be considered as the relation of a whole and the same whole divided into parts entangled in general. (shrink)

Elekes proved that any infinite-fold cover of a σ-finite measure space by a sequence of measurable sets has a subsequence with the same property such that the set of indices of this subsequence has density zero. Applying this theorem he gave a new proof for the random-indestructibility of the density zero ideal. He asked about other variants of this theorem concerning I-almost everywhere infinite-fold covers of Polish spaces where I is a σ-ideal on the space and the (...) set of indices of the required subsequence should be in a fixed ideal ${{\mathcal{J}}}$ on ω. We introduce the notion of the ${{\mathcal{J}}}$ -covering property of a pair ${({\mathcal{A}}, I)}$ where ${{\mathcal{A}}}$ is a σ-algebra on a set X and ${{I \subseteq \mathcal{P}(X)}}$ is an ideal. We present some counterexamples, discuss the category case and the Fubini product of the null ideal ${\mathcal{N}}$ and the meager ideal ${\mathcal{M}}$ . We investigate connections between this property and forcing-indestructibility of ideals. We show that the family of all Borel ideals ${{\mathcal{J}}}$ on ω such that ${\mathcal{M}}$ has the ${{\mathcal{J}}}$ -covering property consists exactly of non weak Q-ideals. We also study the existence of smallest elements, with respect to Katětov–Blass order, in the family of those ideals ${\mathcal{J}}$ on ω such that ${\mathcal{N}}$ or ${\mathcal{M}}$ has the ${\mathcal{J}}$ -covering property. Furthermore, we prove a general result about the cases when the covering property “strongly” fails. (shrink)