Cardinals and Ordinals, Misc

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)

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)

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)

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)

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)

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)

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.