Cardinals and Ordinals

¿Qué ha pasado con el problema del cardinal del continuo después de Gödel (1938) y Cohen (1964)? Intentos de responder esta pregunta pueden encontrarse en los artículos de José Alfredo Amor (1946-2011), "El Problema del continuo después de Cohen (1964-2004)", de Carlos Di Prisco , "Are we closer to a solution of the continuum problem", y de Joan Bagaria, "Natural axioms of set and the continuum problem" , que se pueden encontrar en la biblioteca digital de mi blog de Lógica (...) Matemática y Fundamentos de la Matemática (ver). También en la entrada "The Continuum Hypothesis" de la web de Enciclopedia de Filosofía de la Universidad de Stanford existe información importante y actualizada al respecto. En esta breve nota se comenta sobre el tema de una manera divulgativa. (shrink)

A definition of quantum computer is supposed: as a countable set of Turing machines on the ground of: quantum parallelism, reversibility, entanglement. Qubit is the set of all the i–th binary location cells transforming in parallel by unitary matrices. The Church thesis is suggested in the form relevat to quantum computer. The notion of the non–finite (but not infinite) potency of a set is introduced .

An isomorphism is built between the separable complex Hilbert space (quantum mechanics) and Minkowski space (special relativity) by meditation of quantum information (i.e. qubit by qubit). That isomorphism can be interpreted physically as the invariance between a reference frame within a system and its unambiguous counterpart out of the system. The same idea can be applied to Poincaré’s conjecture (proved by G. Perelman) hinting another way for proving it, more concise and meaningful physically. Mathematically, the isomorphism means the invariance to (...) choice, the axiom of choice, well-ordering, and well-ordering “theorem” (or “principle”) and can be defined generally as “information invariance”. (shrink)

Recent work has defended “Euclidean” theories of set size, in which Cantor’s Principle (two sets have equally many elements if and only if there is a one-to-one correspondence between them) is abandoned in favor of the Part-Whole Principle (if A is a proper subset of B then A is smaller than B). It has also been suggested that Gödel’s argument for the unique correctness of Cantor’s Principle is inadequate. Here we see from simple examples, not that Euclidean theories of set (...) size are wrong, but that they must be either very weak and narrow or largely arbitrary and misleading. (shrink)

A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in its (...) memory not only finite numbers but also infinite and infinitesimal ones. (shrink)

This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive methods standardly used in science presuppose that every proposition about the outcome of a chancy process has a certain chance between 0 and 1. I also argue in favour of the standard view that chances are countably additive. Since it is possible to randomly pick (...) out a point on a continuum, for instance using a roulette wheel or by flipping a countable infinity of fair coins, it follows, given the axioms of ZFC, that there are many different cardinalities between countable infinity and the cardinality of the continuum. (shrink)

In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the (...) part” applied to all quantities (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The methodology uses a computational device called the Infinity Computer (patented in USA and EU) working numerically (recall that traditional theories work with infinities and infinitesimals only symbolically) with infinite and infinitesimal numbers that can be written in a positional numeral system with an infinite radix. It is argued that numeral systems involved in computations limit our capabilities to compute and lead to ambiguities in theoretical assertions, as well. The introduced methodology gives the possibility to use the same numeral system for measuring infinite sets, working with divergent series, probability, fractals, optimization problems, numerical differentiation, ODEs, etc. (recall that traditionally different numerals lemniscate; Aleph zero, etc. are used in different situations related to infinity). Numerous numerical examples and theoretical illustrations are given. The accuracy of the achieved results is continuously compared with those obtained by traditional tools used to work with infinities and infinitesimals. In particular, it is shown that the new approach allows one to observe mathematical objects involved in the Hypotheses of Continuum and the Riemann zeta function with a higher accuracy than it is done by traditional tools. It is stressed that the hardness of both problems is not related to their nature but is a consequence of the weakness of traditional numeral systems used to study them. It is shown that the introduced methodology and numeral system change our perception of the mathematical objects studied in the two problems. (shrink)

This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the priority (...) and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

In a recent article, Christopher Ormell argues against the traditional mathematical view that the real numbers form an uncountably infinite set. He rejects the conclusion of Cantor’s diagonal argument for the higher, non-denumerable infinity of the real numbers. He does so on the basis that the classical conception of a real number is mys- terious, ineffable, and epistemically suspect. Instead, he urges that mathematics should admit only ‘well-defined’ real numbers as proper objects of study. In practice, this means excluding as (...) inadmissible all those real numbers whose decimal expansions cannot be calculated in as much detail as one would like by some rule. We argue against Ormell that the classical realist account of the continuum has explanatory power in mathematics and should be accepted, much in the same way that "dark matter" is posited by physicists to explain observations in cosmology. In effect, the indefinable real numbers are like the "dark matter" of real analysis. (shrink)

It is often supposed that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...) hypothesis is absolutely undecidable, then it is indeterminate. I shall argue that on no understanding of absolute undecidability could one hope to establish all of (a)–(c). However, I will identify one understanding of absolute undecidability on which one might hope to establish both (a) and (c) to the exclusion of (b). This suggests that a new style of mathematical antirealism deserves attention—one that does not depend on familiar epistemological or ontological concerns. The key idea behind this view is that typical mathematical hypotheses are indeterminate because they are relevantly similar to CH. (shrink)

What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock of (...) higher set theory the jewel of mathematical Continuum -- this genuine, even if mostly forgotten today raison d'etre of all set-theoretical enterprises to Infinity and beyond, from Georg Cantor to W. Hugh Woodin to Buzz Lightyear, by simultaneously exhibiting the limits and pitfalls of all old and new reductionist foundational approaches to mathematical truth: be it Cantor's or post-Cantorian Idealism, Brouwer's or post-Brouwerian Constructivism, Hilbert's or post-Hilbertian Formalism, Goedel's or post-Goedelian Platonism. -/- In the spirit of Zeno's paradoxes, but with the enormous historical advantage of hindsight, we claim that Cantor's set-theoretical methodology, powerful and reach in proof-theoretic and similar applications as it might be, is inherently limited by its epistemological framework of transfinite local causality, and neither can be held accountable for the properties of the Continuum already acquired through geometrical, analytical, and arithmetical studies, nor can it be used for an adequate, conceptually sensible, operationally workable, and axiomatically sustainable re-creation of the Continuum. -/- From a strictly mathematical point of view, this intrinsic limitation of the constative and explicative power of higher set theory finds its explanation in the identified in this study ultimate phenomenological obstacle to Cantor's transfinite construction, similar to topological obstacles in homotopy theory and theoretical physics: the entanglement capacity of the mathematical Continuum. (shrink)

This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The hyperintensional profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal and hyperintensional profiles of $\Omega$-logical validity correspond to those of second-order logical consequence, $\Omega$-logical validity is genuinely (...) logical. Second, the foregoing provides a hyperintensional account of the interpretation of mathematical and metamathematical vocabulary. (shrink)

Let's suppose you think that there are no uncountable sets. Have you adopted a restrictive position? It is certainly tempting to say yes---you've prohibited the existence of certain kinds of large set. This paper argues that this intuition can be challenged. Instead, I argue that there are some considerations based on a formal notion of restrictiveness which suggest that it is restrictive to hold that there are uncountable sets.

En el ámbito de la lógica matemática existe un problema sobre la relación lógica entre dos versiones débiles del Axioma de elección (AE) que no se ha podido resolver desde el año 2000 (aproximadamente). Tales versiones están relacionadas con ultrafiltros no principales y con Propiedades Ramsey (Bernstein, Polarizada, Subretículo, Ramsey, Ordinales flotantes, etc). La primera versión débil del AE es la siguiente (A): “Existen ultrafiltros no principales sobre el conjunto de los números naturales (ℕ)”. Y la segunda versión débil del (...) AE es la siguiente (B): “Existen ultraflitros sobre ℕ”. Se sabe que A implica B, pero se desconoce si B implica A. Di Prisco y Henle conjeturan en los artículos ([1], [2]) que esto no ocurre, es decir, conjeturan que B no implica A, en otras palabras, conjeturan que A es más fuerte estrictamente que B, que A es independiente de B, pero esto no se ha podido demostrar todavía aunque se ha intentado hacer desde hace aproximadamente 21 años. Una descripción detallada de este problema abierto puede encontrarse en esta ponencia (dictada en el marco del Día Mundial de la Lógica 14-01-2022) y en el artículo [3]. [1] C. Di Prisco y H. Henle. “Doughnuts, Floating Ordinals, Square Brackets, and Ultraflitters”. Journal of Symbolic Logic 65 (2000) 462-473. [2] C. Di Prisco y H. Henle. “Partitions of the reals and choice”. En “Models, algebras and proofs”. X. Caicedo y C.M. Montenegro. Eds. Lecture Notes in Pure and Appl. Math, 203, Marcel Dekker, 1999. [3] F. Galindo. “Tópicos de ultrafiltros”. Divulgaciones Matemáticas. Vol. 21, No 1-2, 2020. (shrink)

El estudio de los "cardinales grandes" es uno de los principales temas de investigación de la teoría de conjuntos y de la teoría de modelos que ha contribuido con el desarrollo de dichas disciplinas. Existe una gran variedad de tales cardinales, por ejemplo cardinales inaccesibles, débilmente compactos, Ramsey, medibles, supercompactos, etc. Tres valiosos teoremas clásicos sobre cardinales medibles son los siguientes: (i) compacidad débil, (ii) Si κ es un cardinal medible, entonces κ es un cardinal inaccesible y existen κ cardinales (...) inaccesibles menores que κ , y (iii) Si existe un cardinal medible, entonces el axioma de constructibilidad (V=L) es falso. El objetivo de este artículo es presentar una demostración de cada uno de estos tres teoremas en el contexto de la teoría de modelos usando ideas del texto de Chang y Keisler (Model Theory). Tales demostraciones tienen en común el uso del método de construcción de modelos llamado ultraproductos, de lógicas infinitarias o fragmentos de la lógica de segundo orden, y del axioma de elección. Cardinales grandes y/o ultraproductos son importantes en teoría de conjuntos, teoría de modelos, análisis matemático, teoría de la medida, probabilidades, topología, análisis funcional, física, teoría de números, finanzas, etc. (shrink)

It is standard in set theory to assume that Cantor's Theorem establishes that the continuum is an uncountable set. A challenge for this position comes from the observation that through forcing one can collapse any cardinal to the countable and that the continuum can be made arbitrarily large. In this paper, we present a different take on the relationship between Cantor's Theorem and extensions of universes, arguing that they can be seen as showing that every set is countable and that (...) the continuum is a proper class. We examine several principles based on maximality considerations in this framework, and show how some (namely Ordinal Inner Model Hypotheses) enable us to incorporate standard set theories (including ZFC with large cardinals added). We conclude that the systems considered raise questions concerning the foundational purposes of set theory. (shrink)

The independence phenomenon in set theory, while pervasive, can be partially addressed through the use of large cardinal axioms. A commonly assumed idea is that large cardinal axioms are species of maximality principles. In this paper, I argue that whether or not large cardinal axioms count as maximality principles depends on prior commitments concerning the richness of the subset forming operation. In particular I argue that there is a conception of maximality through absoluteness, on which large cardinal axioms are restrictive. (...) I argue, however, that large cardinals are still important axioms of set theory and can play many of their usual foundational roles. (shrink)

In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .

This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the priority (...) and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

In a recent article, Christopher Ormell argues against the traditional mathematical view that the real numbers form an uncountably infinite set. He rejects the conclusion of Cantor’s diagonal argument for the higher, non-denumerable infinity of the real numbers. He does so on the basis that the classical conception of a real number is mys- terious, ineffable, and epistemically suspect. Instead, he urges that mathematics should admit only ‘well-defined’ real numbers as proper objects of study. In practice, this means excluding as (...) inadmissible all those real numbers whose decimal expansions cannot be calculated in as much detail as one would like by some rule. We argue against Ormell that the classical realist account of the continuum has explanatory power in mathematics and should be accepted, much in the same way that "dark matter" is posited by physicists to explain observations in cosmology. In effect, the indefinable real numbers are like the "dark matter" of real analysis. (shrink)

A pervasive thought in contemporary philosophy of mathematics is that in order to justify reflection principles, one must hold universism: the view that there is a single universe of pure sets. I challenge this kind of reasoning by contrasting universism with a Zermelian form of multiversism. I argue that if extant justifications of reflection principles using notions of richness are acceptable for the universist, then the Zermelian can use similar justifications. However, I note that for some forms of richness argument, (...) the status of reflection principles as axioms is left open for the Zermelian. (shrink)

Are there any things that are such that any things whatsoever are among them. I argue that there are not. My thesis follows from these three premises: (1) There are two or more things; (2) for any things, there is a unique thing that corresponds to those things; (3) for any two or more things, there are fewer of them than there are pluralities of them.

In this paper I present two new arguments against the possibility of an omniscient being. My new arguments invoke considerations of cardinality and resemble several arguments originally presented by Patrick Grim. Like Grim, I give reasons to believe that there must be more objects in the universe than there are beliefs. However, my arguments will rely on certain mereological claims, namely that Classical Extensional Mereology is necessarily true of the part-whole relation. My first argument is an instance of a problem (...) first noted by Gideon Rosen and requires an additional assumption about the mereological structure of certain beliefs. That assumption is that an omniscient being’s beliefs are mereological simples. However, this assumption is dropped when I present my second argument. Thus, I hope to show that if Classical Extensional Mereology is true of the part-whole relation, there cannot be an omniscient being. (shrink)

According to an influential idea in the philosophy of set theory, certain mathematical concepts, such as the notion of a well-order and set, are indefinitely extensible. Following Parsons (1983), this has often been cashed out in modal terms. This paper explores instead an extensional articulation of the idea, formulated in higher-order logic, that flat-footedly formalizes some remarks of Zermelo. The resulting picture is incompatible with the idea that the entire universe can be well-ordered, but entirely consistent with the idea that (...) the sets of any set-theoretic universe can be. (shrink)

El estudio de los "cardinales grandes" es uno de los principales temas de investigación de la teoría de conjuntos y de la teoría de modelos que ha contribuido con el desarrollo de dichas disciplinas. Existe una gran variedad de tales cardinales, por ejemplo cardinales inaccesibles, débilmente compactos, Ramsey, medibles, supercompactos, etc. Tres valiosos teoremas clásicos sobre cardinales medibles son los siguientes: (i) compacidad débil, (ii) Si κ es un cardinal medible, entonces κ es un cardinal inaccesible y existen κ cardinales (...) inaccesibles menores que κ , y (iii) Si existe un cardinal medible, entonces el axioma de constructibilidad (V=L) es falso. El objetivo de este artículo es presentar una demostración de cada uno de estos tres teoremas en el contexto de la teoría de modelos usando ideas del texto de Chang y Keisler (Model Theory). Tales demostraciones tienen en común el uso del método de construcción de modelos llamado ultraproductos, de lógicas infinitarias o fragmentos de la lógica de segundo orden, y del axioma de elección. Cardinales grandes y/o ultraproductos son importantes en teoría de conjuntos, teoría de modelos, análisis matemático, teoría de la medida, probabilidades, topología, análisis funcional, física, teoría de números, finanzas, etc. (shrink)

Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s type-restrictions are unjustifiable, the type-restrictions imposed by (...) STT are justified by a Fregean semantics. What is more, this Fregean semantics provides us with a principled way to resist Linnebo and Rayo’s Semantic Argument for CTT. We end by examining an alternative approach to cumulative types due to Florio and Jones; we argue that their theory is best seen as a misleadingly formulated version of STT. (shrink)

Can an AGI create a more intelligent AGI? Under idealized assumptions, for a certain theoretical type of intelligence, our answer is: “Not without outside help”. This is a paper on the mathematical structure of AGI populations when parent AGIs create child AGIs. We argue that such populations satisfy a certain biological law. Motivated by observations of sexual reproduction in seemingly-asexual species, the Knight-Darwin Law states that it is impossible for one organism to asexually produce another, which asexually produces another, and (...) so on forever: that any sequence of organisms (each one a child of the previous) must contain occasional multi-parent organisms, or must terminate. By proving that a certain measure (arguably an intelligence measure) decreases when an idealized parent AGI single-handedly creates a child AGI, we argue that a similar Law holds for AGIs. (shrink)

We define a notion of the intelligence level of an idealized mechanical knowing agent. This is motivated by efforts within artificial intelligence research to define real-number intelligence levels of compli- cated intelligent systems. Our agents are more idealized, which allows us to define a much simpler measure of intelligence level for them. In short, we define the intelligence level of a mechanical knowing agent to be the supremum of the computable ordinals that have codes the agent knows to be codes (...) of computable ordinals. We prove that if one agent knows certain things about another agent, then the former necessarily has a higher intelligence level than the latter. This allows our intelligence no- tion to serve as a stepping stone to obtain results which, by themselves, are not stated in terms of our intelligence notion (results of potential in- terest even to readers totally skeptical that our notion correctly captures intelligence). As an application, we argue that these results comprise evidence against the possibility of intelligence explosion (that is, the no- tion that sufficiently intelligent machines will eventually be capable of designing even more intelligent machines, which can then design even more intelligent machines, and so on). (shrink)

Are there different sizes of infinity? That is, are there infinite sets of different sizes? This is one of the most natural questions that one can ask about the infinite. But it is of course generally taken to be settled by mathematical results, such as Cantor’s theorem, to the effect that there are infinite sets without bijections between them. These results settle the question, given an almost universally accepted principle relating size to the existence of functions. The principle is: for (...) any sets A and B, if A is the same size as B, then there is a bijection from A to B. The aim of the paper, however, is to argue that this question is in fact wide open: to argue that we are not in a position to know the answer, because we are not in one to know the principle. The aim, that is, is to argue that for all we know there is only one size of infinity. (shrink)

Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the (...) scope of quantifiers reveals a natural way out. (shrink)

Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of elimination which characterises (...) this move. (shrink)

William Lane Craig has argued that there cannot be actual infinities because inverse operations are not well-defined for infinities. I point out that, in fact, there are mathematical systems in which inverse operations for infinities are well-defined. In particular, the theory introduced in John Conway's *On Numbers and Games* yields a well-defined field that includes all of Cantor's transfinite numbers.