AGI and the Knight-Darwin Law: why idealized AGI reproduction requires collaboration

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

This is not an instance of (E)

Semantic paradoxes like the liar are notorious challenges to truth theories. A paradox can be phrased with minimal resources and minimal assumptions. It is not surprising, then, that the liar is also a challenge to minimalism about truth. Horwich (1998/1990) deals swiftly with the paradox, after discriminating between other strategies for avoiding it without compromising minimalism. He dismisses the denial of classical logic, the denial that the concept of truth can coherently be applied to propositions, and the denial that the liar sentence expresses a proposition, but he endorses the denial that the liar is an acceptable instance of the equivalence schema (E). This paper has two main parts. It first shows that Horwich's preferred denial is also problematic. As Simmons (1999), Beall and Armour-Garb (2003), and Asay (2015) argued, the solution is ad hoc, faces a possible loss of expressibility, and is ultimately unstable. Finally, the paper explores a different combination of possibilities for minimalism: treating the truth-predicate as context-dependent, rejecting the notion that the liar expresses a proposition, and reinterpreting negation in some contexts as metalinguistic denial. The paper argues that these are preferable options, but signposts possible dangers ahead

Definability and Undefinability of Truth

This thesis will focus on Tarski’s work, so the Section 2 starts with him, giving an overview of the elements of his theory of truth, leading to a presentation of his theorem in 2.3. In the rest of the paper, proposals for solving the problem of internalization of the concept of truth and the paradoxes arising from this problem with some of the proposed solution are considered. Section 3. will quickly introduce the Liar paradox and once more explicitly state Tarski’s solution, followed by the so called “revenge of the liar”; a liar type sentence which cannot be avoided even by using Tarski’s solution to the original liar. After that, Section 4. will introduce Kripke’s Theory of Truth and his take on truth and solving t he Liar paradox using paracomplete logic, while Section 5. will examine some further attempts in answering the aforementioned problems in the context of paraconsistent logic

Type-free truth

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free truth. In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs (or dependency-graphs) of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- (chapter 9). We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory