DOCSLIB.ORG

Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More Information

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More Information Cambridge University Press 0521753732 - Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More information Index ∀-introduction, 43 bounded multiplication, 134 absolutely provable, 37 bounded product, 197 AC, 86 bounded quantification, 125 Ackermann function, 198 bounded search, 134 ∀∃-theory, 93 bounded summation, 134, 197 alphabet, 6, 13 Bourbaki, 5, 14, 41 alternating chain, 96 Brouwer, L. E. J., 4 ambiguity, 24 ambiguous, 24 call by value, 144 antisymmetry, 210 cancellation laws, 214 argot,39 categorical, 97 arithmetic, 150 characteristic function, 130, 219 arithmetic hierarchy, 151 characteristic term, 222 arithmetic relations, 150 Chinese remainder theorem, 160 arithmetical relations, 150 Church, Alonzo, 124, 188 arithmetization, 134, 265 Church’s thesis, 264 arity, 8 class, 75 ascending chains, 93 closed form, 201 assignment function, 88 closed formula, 18 associativities, 17 closed interval, 111 automorphism, 196 closed under, 19 axiom, 6 closure, 20 Henkin, 65 coding, 136 logical, 6 collection, 258 nonlogical, 6, 36 commutative diagram, 78 special, 6 compact, 107 axiomatic theories, 38 compactness theorem, 71, 74 axiomatized, 38 complete, 97, 194 axioms, logical, 34 simply complete, 66 complete arithmetic, 39, 170 basic diagram, 88 complete index set, 149, 199 Bennett, J., 162 completeness theorem, 52, 71, 73, 194 Bernays, P., 41 completion, 195 beta function, 159, 235 composition, 127 Boolean, 7 computability, 123 Boolean operations, 133 computable, 128 bound variable, 18 computable function, 124 bounded, 112 computation, 140 323 © Cambridge University Press www.cambridge.org Cambridge University Press 0521753732 - Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More information 324 Index computation model, 126 ∃-introduction, 36 computer program, 264 elementarily equivalent structures, 76 concatenate, 10 elementary chains, 93 concatenation, 13, 137, 243 elementary diagram, 88 formal, 243, 245 elementary embedding, 82 conjunct, 277 elementary extension, 82 conjunction, 17 elementary substructure, 82 conjunctionally, 216 elimination of defined symbols, 116, 118 connectives, 7 empty sequence, 243 conservative, 115, 121, 218 Entscheidungsproblem, 40, 124 conservative extension, 46, 118 enumeration theorem, 153 consistency theorem, 71, 73 ε-term, 123 constant, 8 equivalence theorem, 51, 183 Henkin, Leon, 65 existential axioms, 93 witnessing, 65 existential formula, 113 construction formative,41 expansion, 88 constructive arithmetic, 164, 170 explicit definition, 218 constructive arithmetic predicates, 160 explicit transformations, 160 continuous, 111 expressions, 6 contrapositive, 158 extension, 77 converges, 125 extensionality, 114 correct, 177 extreme value theorem, 197 countable, 62 course-of-values induction, 214 finitary, 4 course-of-values recursion, 137, finite hyperreal, 102 251 finitely satisfiable, 195 Craig, W., 204 first incompleteness theorem, 155 C-theory, 272 fixed point, 203, 310 fixpoint, 203, 310 decision problem, 40, 188 fixpoint theorem, 310, 317 decoding, 136, 240 formal, 1 Dedekind, R., 124, 129 beta function, 235 deduced, 37 Formal Arithmetic, 166, 175 deduction theorem, 48 formal language definability, 60 first order, 6 in a structure, 60 formalize, 3 definable, 170, 171 formally definable, 180 definable in arithmetic, 171 formally functionally definable, 202 definition by cases, 134, 221 formula definition by positive cases, 200 decidable by a theory, 66 definition by recursion, 25 mixed-mode, 61 ∆0 formulas, 172 prime, 28 derivability conditions, 272, 296 propositional, 28 derivation, 20, 254 satisfiable, 30 derived rule, 38, 40 tautology, 30 diagonalization, 125, 145 unsatisfiable, 30 diagonalization lemma, 310 formula form, 34 diagram, 64, 88 formula schema, 34 diagram expansion, 88 free for, 32 diagram language, 64, 88 free variable, 18 Diophantine equation, 201 function disjunct, 276 computable, 128 distributive laws, 193 partial computable, 128 diverges, 125 partial recursive, 128 domain, 53 primitive recursive, 129 dummy renaming, 45 recursive, 128 © Cambridge University Press www.cambridge.org Cambridge University Press 0521753732 - Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More information Index 325 G¨odel number, 155 infinite prime, 197 generalization, 43 infinitely close, 104 Gentzen, Gerhard, 193 infinitesimal 97, 102 G¨odel, Kurt, 124 infix, 14, 98 G¨odel-Malcev compactness theorem, 74 informal, 8 G¨odel-numbering, 155 initial functions, 128 G¨odel-Rosser first incompleteness input, 19 theorem, 189 intermediate value theorem, 197 G¨odel’s first incompleteness theorem, 177, interpretation, 53 202, 317 iota notation, 120 G¨odel’s second incompleteness theorem, 312 irreflexive, 210 graph, 98, 161, 163, 199, 202 irreflexivity, 210 greatest common divisor, 157 iteration theorem, 148 gcd, 157 iteratively, 21 Gries, David, 5 group theory, 92 κ-categorical, 97 groups, 93 Keisler, H. Jerome, 88 Grzegorczyk, A., 132 Kleene, S. C., 124, 150 g-term, 296 Kleene normal form theorem, 142 Kleene predicate, 164 halting problem, 145 Kleene schemata, 127, 264 halting set, 145 Kleene T -predicate, 142 Henkin, Leon, 62, 112, 314 Kleene’s recursion theorem, 149 Henkin theory, 66 Kronecker, L., 4 Hermes, H., 41 Heyting, A., 4 λ-notation, 125 hierarchy theorem, 154 language Hilbert, D., 4, 41 extension, 54 history function, 137 first order, 16 hyperreal numbers, 99 restriction, 54 hyperreals, 99 least common multiple, 157, 230 least principle, 216 I.H., 22 left endpoint, 111 i.p., 24 left field, 125 Identities, 128 Leibniz, G. W., 34 iff, 11 Leibniz rule, 51 immediate predecessors, 24 limit ordinal, 73 implied multiplication notation, 212 Lindemann, F., 4 inclusion map, 77 L¨ob, Martin H., 310, 314 incompletable, 177 L¨ob’s derivability condition, 310 incompletableness, 124 L¨ob’s theorem, 314 inconsistent, 265 logical symbols, 7 increasing chains, 93 logically implies, 52 indefinite article, 121 L¨owenheim-Skolem theorem, 71 indexing theorem, 153 individual variables, 7 Manin, Yu. I., 39 induced isomorphism, 78 Markov, A. A., 127 induction axiom, 206 material implication, 17 induction axiom schema, 206 mathematical theory, see theory induction hypothesis, 22 maximum, 230 induction rule, 208 metalanguage, 3 induction schema, 206 metamathematics, 3 inductive definitions, 20 metatheory, 3 inductive theories, 93 metavariable, 207 infinite hyperreal, 102 modus ponens, 36 infinite natural numbers, 196 monotonicity, 50 © Cambridge University Press www.cambridge.org Cambridge University Press 0521753732 - Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More information 326 Index monus, 131 problem, 144 Mostowski, A., 150 productive function, 179 MP, 36 productive sets, 179 µ-definitions, 218 programming language, 264 µ-term, 218 projection, 128 projection function symbols, 254 neighbourhood, 108 projection functions, 156 non-monotone, 265 projection theorem, 147 non-standard hyperreals, 99 proof, 37 non-standard numbers, 99 -, 37 nontotal, 125 proof by auxiliary constant, 52 Num function, 296 proof by cases, 183 number-theoretic functions, 124 proof by contradiction, 50 numeral, 41, 171 proper prefix, 13 proper subtraction, 131, 222 object variables, 7 propositional connectives, 7 occurrence, 13 propositional axioms, 194, 269 occurs in, 13 propositional calculus, 194 ω-consistent, 189 propositional logic, 194 ω-incompleteness, 190 propositional segment, 194 ω-inconsistent, 191 propositional valuations, 29 ω-rule, 190 propositional variable, 28 one point rule, 118 provability predicate, 280, 311 onto, 62 provably equivalent, 42 open, 92 proved from, 37 open formulas, 91 punctured neighbourhood, 108 open theory, 91 operations of substitution, 132 Quine, W. V. O., 156 ordered sequence, 19 ordinary computability, 124 R-closed, 20 ordinary recursion theory, 124 r.e. predicate, 147 output, 19 Rasiowa, H., 41 real function, 108 pairing function, 156 recursion, 19 parsable, 29 recursion theorem, 149 parse, 21 recursion theory, 123 partial computable, 128 recursive, 128, 130, 170 partial function, 125 recursive definition, 20 partial recursive, 128 recursive extension, 220, 262, 265, Peanoarithmetic, 206 273 φ-index, 138 recursively axiomatizable, 39 π-function, 198 recursively axiomatized, 38, 271 pinching lemma, 106 recursively enumerable predicate, 147 polynomial, 201 recursively inseparable, 187 positively strongly definable, 191, 202 recursively unsolvable, 144 Post, E. L., 124, 194 regular, 171 Post’s theorem, 194 regular formula, 171 predicate, 8, 130 regular functions, 204 prefix, 13 relation, see predicate, 8, 19 prime power coding, 136 primitive recursive, 130 primitive recursion, 127 recursive, 130 primitive recursive, 129, 170, 253 relational notation, 125 primitive recursive definitions, 248 relatively prime, 157, 226 primitive recursive functions, 124, 127 remainder function, 224 primitive recursive schema, 127 restricted atomic formulas, 256 priorities, 17 restriction, 78 © Cambridge University Press www.cambridge.org Cambridge University Press 0521753732 - Lectures in Logic and Set Theory, Volume 1: Mathematical Logic George Tourlakis Index More information Index 327 Rice, H. G., 149 underlying set of, 53 right endpoint, 111 universe of, 53 right finite limit, 108 structure embedding, 77 right positive infinite limit, 108 structure isomorphism, 77 Robinson, Abraham, 64 structures, elementarily equivalent, 76 Robinson, R. M., 175 substitutable for, 32 Rosser, J. Barkley, 189 substitution,
Load more

Recommended publications
  • Large but Finite
    Department of Mathematics MathClub@WMU Michigan Epsilon Chapter of Pi Mu Epsilon Large but Finite Drake Olejniczak Department of Mathematics, WMU What is the biggest number you can imagine? Did you think of a million? a billion? a septillion? Perhaps you remembered back to the time you heard the term googol or its show-off of an older brother googolplex. Or maybe you thought of infinity. No. Surely, `infinity' is cheating. Large, finite numbers, truly monstrous numbers, arise in several areas of mathematics as well as in astronomy and computer science. For instance, Euclid defined perfect numbers as positive integers that are equal to the sum of their proper divisors. He is also credited with the discovery of the first four perfect numbers: 6, 28, 496, 8128. It may be surprising to hear that the ninth perfect number already has 37 digits, or that the thirteenth perfect number vastly exceeds the number of particles in the observable universe. However, the sequence of perfect numbers pales in comparison to some other sequences in terms of growth rate. In this talk, we will explore examples of large numbers such as Graham's number, Rayo's number, and the limits of the universe. As well, we will encounter some fast-growing sequences and functions such as the TREE sequence, the busy beaver function, and the Ackermann function. Through this, we will uncover a structure on which to compare these concepts and, hopefully, gain a sense of what it means for a number to be truly large. 4 p.m. Friday October 12 6625 Everett Tower, WMU Main Campus All are welcome! http://www.wmich.edu/mathclub/ Questions? Contact Patrick Bennett ([email protected]) .
    [Show full text]
  • Parameter Free Induction and Provably Total Computable Functions
    Parameter free induction and provably total computable functions Lev D. Beklemishev∗ Steklov Mathematical Institute Gubkina 8, 117966 Moscow, Russia e-mail: [email protected] November 20, 1997 Abstract We give a precise characterization of parameter free Σn and Πn in- − − duction schemata, IΣn and IΠn , in terms of reflection principles. This I − I − allows us to show that Πn+1 is conservative over Σn w.r.t. boolean com- binations of Σn+1 sentences, for n ≥ 1. In particular, we give a positive I − answer to a question, whether the provably recursive functions of Π2 are exactly the primitive recursive ones. We also characterize the provably − recursive functions of theories of the form IΣn + IΠn+1 in terms of the fast growing hierarchy. For n = 1 the corresponding class coincides with the doubly-recursive functions of Peter. We also obtain sharp results on the strength of bounded number of instances of parameter free induction in terms of iterated reflection. Keywords: parameter free induction, provably recursive functions, re- flection principles, fast growing hierarchy Mathematics Subject Classification: 03F30, 03D20 1 Introduction In this paper we shall deal with the first order theories containing Kalmar ele- mentary arithmetic EA or, equivalently, I∆0 + Exp (cf. [11]). We are interested in the general question how various ways of formal reasoning correspond to models of computation. This kind of analysis is traditionally based on the con- cept of provably total recursive function (p.t.r.f.) of a theory. Given a theory T containing EA, a function f(~x) is called provably total recursive in T , iff there is a Σ1 formula φ(~x, y), sometimes called specification, that defines the graph of f in the standard model of arithmetic and such that T ⊢ ∀~x∃!y φ(~x, y).
    [Show full text]
  • Primality Testing for Beginners
    STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given.
    [Show full text]
  • The Notion Of" Unimaginable Numbers" in Computational Number Theory
    Beyond Knuth’s notation for “Unimaginable Numbers” within computational number theory Antonino Leonardis1 - Gianfranco d’Atri2 - Fabio Caldarola3 1 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] 2 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy 3 Department of Mathematics and Computer Science, University of Calabria Arcavacata di Rende, Italy e-mail: [email protected] Abstract Literature considers under the name unimaginable numbers any positive in- teger going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathemati- cal definition (it is indeed used in many sources without a proper definition). This simply means that research in this topic must always consider shortened representations, usually involving recursion, to even being able to describe such numbers. One of the most known methodologies to conceive such numbers is using hyper-operations, that is a sequence of binary functions defined recursively starting from the usual chain: addition - multiplication - exponentiation. arXiv:1901.05372v2 [cs.LO] 12 Mar 2019 The most important notations to represent such hyper-operations have been considered by Knuth, Goodstein, Ackermann and Conway as described in this work’s introduction. Within this work we will give an axiomatic setup for this topic, and then try to find on one hand other ways to represent unimaginable numbers, as well as on the other hand applications to computer science, where the algorith- mic nature of representations and the increased computation capabilities of 1 computers give the perfect field to develop further the topic, exploring some possibilities to effectively operate with such big numbers.
    [Show full text]
  • Ackermann and the Superpowers
    Ackermann and the superpowers Ant´onioPorto and Armando B. Matos Original version 1980, published in \ACM SIGACT News" Modified in October 20, 2012 Modified in January 23, 2016 (working paper) Abstract The Ackermann function a(m; n) is a classical example of a total re- cursive function which is not primitive recursive. It grows faster than any primitive recursive function. It is usually defined by a general recurrence together with two \boundary" conditions. In this paper we obtain a closed form of a(m; n), which involves the Knuth superpower notation, namely m−2 a(m; n) = 2 " (n + 3) − 3. Generalized Ackermann functions, that is functions satisfying only the general recurrence and one of the bound- ary conditions are also studied. In particular, we show that the function m−2 2 " (n + 2) − 2 also belongs to the \Ackermann class". 1 Introduction and definitions The \arrow" or \superpower" notation has been introduced by Knuth [1] as a convenient way of expressing very large numbers. It is based on the infinite sequence of operators: +, ∗, ",... We shall see that the arrow notation is closely related to the Ackermann function (see, for instance, [2]). 1.1 The Superpowers Let us begin with the following sequence of integer operators, where all the operators are right associative. a × n = a + a + ··· + a (n a's) a " n = a × a × · · · × a (n a's) 2 a " n = a " a "···" a (n a's) m In general we define a " n as 1 Definition 1 m m−1 m−1 m−1 a " n = a " a "··· " a | {z } n a's m The operator " is not associative for m ≥ 1.
    [Show full text]
  • 53 More Algorithms
    Eric Roberts Handout #53 CS 106B March 9, 2015 More Algorithms Outline for Today • The plan for today is to walk through some of my favorite tree More Algorithms and graph algorithms, partly to demystify the many real-world applications that make use of those algorithms and partly to for Trees and Graphs emphasize the elegance and power of algorithmic thinking. • These algorithms include: – Google’s Page Rank algorithm for searching the web – The Directed Acyclic Word Graph format – The union-find algorithm for efficient spanning-tree calculation Eric Roberts CS 106B March 9, 2015 Page Rank Page Rank Algorithm The heart of the Google search engine is the page rank algorithm, The page rank algorithm gives each page a rating of its importance, which was described in a 1999 by Larry Page, Sergey Brin, Rajeev which is a recursively defined measure whereby a page becomes Motwani, and Terry Winograd. important if other important pages link to it. The PageRank Citation Ranking: One way to think about page rank is to imagine a random surfer on Bringing Order to the Web the web, following links from page to page. The page rank of any page is roughly the probability that the random surfer will land on a January 29, 1998 particular page. Since more links go to the important pages, the Abstract surfer is more likely to end up there. The importance of a Webpage is an inherently subjective matter, which depends on the reader’s interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages.
    [Show full text]
  • A Topological Regularizer for Classifiers Via Persistent Homology
    A Topological Regularizer for Classifiers via Persistent Homology Chao Chen Xiuyan Ni Qinxun Bai Yusu Wang Stony Brook University City University of New York Hikvision Research America Ohio State University Abstract 2002). Such norms produce a model with relatively less flexibility and thus is less likely to overfit. Regularization plays a crucial role in super- A particularly interesting category of methods is in- vised learning. Most existing methods enforce spired by the geometry. These methods design new a global regularization in a structure agnos- penalty terms to enforce a geometric simplicity of the tic manner. In this paper, we initiate a new classifier. Some methods stipulate that similar data direction and propose to enforce the struc- should have similar score according to the classifier, tural simplicity of the classification boundary and enforce the smoothness of the classifier function by regularizing over its topological complexity. (Belkin et al., 2006; Zhou and Schölkopf, 2005; Bai In particular, our measurement of topologi- et al., 2016). Others directly pursue a simple geom- cal complexity incorporates the importance etry of the classifier boundary, i.e., the submanifold of topological features (e.g., connected com- separating different classes (Cai and Sowmya, 2007; ponents, handles, and so on) in a meaningful Varshney and Willsky, 2010; Lin et al., 2012, 2015). manner, and provides a direct control over These geometry-based regularizers are intuitive and spurious topological structures. We incorpo- have been shown to be useful in many supervised and rate the new measurement as a topological semi-supervised learning settings. However, regulariz- penalty in training classifiers. We also pro- ing total smoothness of the classifier (or that of the pose an efficient algorithm to compute the classification boundary) is not always flexible enough to gradient of such penalty.
    [Show full text]
  • Ackermann Function 1 Ackermann Function
    Ackermann function 1 Ackermann function In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive. After Ackermann's publication[1] of his function (which had three nonnegative integer arguments), many authors modified it to suit various purposes, so that today "the Ackermann function" may refer to any of numerous variants of the original function. One common version, the two-argument Ackermann–Péter function, is defined as follows for nonnegative integers m and n: Its value grows rapidly, even for small inputs. For example A(4,2) is an integer of 19,729 decimal digits.[2] History In the late 1920s, the mathematicians Gabriel Sudan and Wilhelm Ackermann, students of David Hilbert, were studying the foundations of computation. Both Sudan and Ackermann are credited[3] with discovering total computable functions (termed simply "recursive" in some references) that are not primitive recursive. Sudan published the lesser-known Sudan function, then shortly afterwards and independently, in 1928, Ackermann published his function . Ackermann's three-argument function, , is defined such that for p = 0, 1, 2, it reproduces the basic operations of addition, multiplication, and exponentiation as and for p > 2 it extends these basic operations in a way
    [Show full text]
  • Kapitola: the Connection Between the Iterated Logarithm and the Inverse Ackermann Function
    Michal Fori¹ek: Early beta verzia skrípt z Vypočítateľnosti Kapitola: The connection between the iterated logarithm and the inverse Ackermann function This chapter is about two functions: The iterated logarithm function log∗ n, and the inverse Ackermann function α(n). Both log∗ n and α(n) are very slowly growing functions: for any number n that fits into the memory of your computer, log∗ n ≤ 6 and α(n) ≤ 4. Historically, both functions have been used in upper bounds for the time complexity of a particular implemen- tation of the Disjoint-set data structure: Union-Find algorithm with both union by rank and path compression. One particular insight I have been missing for a long time is the connection between the two functions. Here it is: for large enough n, i−3 z }| { α(n) = minfi : log∗ · · · ∗(n) ≤ ig Okay, you got me, I made that scary on purpose :) After the few seconds of stunned silence, it's now time for a decent explanation. The iterated logarithm The function iteration (the asterisk operator ∗) can be seen as a functional (a higher-order function): You can take any function f and define a new function f ∗ as follows: ( 0 n ≤ 1 f ∗(n) = 1 + f ∗(f(n)) n > 1 In human words: Imagine that you have a calculator with a button that applies f to the currently displayed value. Then, f ∗(n) is the number of times you need to push that button in order to make the value decrease to 1 or less. f approximate f ∗ f(n) = n − 1 f ∗(n) = n − 1 f(n) = n − 2 f ∗(n) = n=2 Here are a few examples of what the iteration produces: ∗ f(n) = pn=2 f (n) = log(n) f(n) = n f ∗(n) = log(log(n)) f(n) = log n f ∗(n) = log∗ n We don't have any simpler expression for log∗.
    [Show full text]
  • Ackermann Functions of Complex Argument
    Ackermann functions of complex argument D. Kouznetsov a,∗, aInstitute for Laser Science, University of Electro-Communications 1-5-1 Chofu-Gaoka, Chofu, Tokyo, 182-8585, Japan Abstract Existence of analytic extension of the fourth Ackermann function A(4, z) to the complex z plane is supposed. This extension is assumed to remain finite at the imaginary axis. On the base of this assumption, the algorithm is suggested for evaluation of this function. The numerical implementation with double-precision arithmetics leads to residual at the level of rounding errors. Application of the algorithm to more general cases of the Abel equation is discussed. Key words: Ackermann functions, tetration, ultra-exponential, super-exponential, generalized exponential, Abel equation PACS: , 02.30.Sa Functional analysis , 02.60.Nm Integral and integrodifferential equations , 02.30.Gp Special functions , 02.60.Gf Algorithms for functional approximation , 02.60.Jh Numerical differentiation and integration 1 Introduction For integer non-negative values of arguments, the Ackermann function A can be defined [1,2] as follows: ∗ Corresponding author. Email address: [email protected] (D. Kouznetsov). URL: http://www.ils/∼dima (D. Kouznetsov). Preprint submitted to Elsevier 24 March 2008 n + 1 , if m=0 A(m, n) = A(m−1, 1 ) , if m>0 and n=0 . (1) A m−1,A(m, n−1) , if m>0 and n>0 At relatively moderated values of m, functions A(m, z) grow quickly at z → +∞, at least while z is integer. This makes them useful for the representation of huge numbers. Powers of 2 are actually used in the most of computers for the “floating-point” variables.
    [Show full text]
  • 1. Super-Functions the Functional Equation F(Z+1)
    MATHEMATICS OF COMPUTATION Volume 79, Number 271, July 2010, Pages 1727–1756 S 0025-5718(10)02342-2 Article electronically published on February 12, 2010 PORTRAIT OF THE FOUR REGULAR SUPER-EXPONENTIALS TO BASE SQRT(2) DMITRII KOUZNETSOV AND HENRYK TRAPPMANN Abstract. We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). We provide a condition for F being entire, we also give two uniqueness criteria for regular super-functions. In the particular case h(x)=bˆx we call F super-exponential. h has two real fixed points for b between 1 and eˆ(1/e). Exemplary we choose the base b=sqrt(2) and portray the four classes of real regular super-exponentials in the complex plane. There are two at fixed point 2 and two at fixed point 4. Each class is given by the translations along the x-axis of a suitable representative. Both super-exponentials at fixed point 4—one strictly increasing and one strictly decreasing—are entire. Both super-exponentials at fixed point 2— one strictly increasing and one strictly decreasing—are holomorphic on a right half-plane. All four super-exponentials are periodic along the imaginary axis. Only the strictly increasing super-exponential at 2 can satisfy F(0)=1 and can hence be called tetrational. We develop numerical algorithms for the precise evaluation of these func- tions and their inverses in the complex plane. We graph the two corresponding different half-iterates of h(z)=sqrt(2)ˆz.
    [Show full text]
  • Theory of Computation (Turing-Complete Systems)
    Theory of Computation (Turing-Complete Systems) Pramod Ganapathi Department of Computer Science State University of New York at Stony Brook January 24, 2021 Contents Contents Turing-Complete Systems Unrestricted Grammars Lindenmayer Systems Gödel’s µ-Recursive Functions While Programs Turing-Complete Systems Solution Nobody knows if there are more powerful models. However, there are many computational models equivalent in power to TM’s. They are called Turing-complete systems. Problem How do you prove the functional equivalence of two given com- putation models M1 and M2, i.e., M1 ⇔ M2? Solution Simulation! Simulate M1 from M2. Simulate M2 from M1. Models more powerful than TM’s Problem Are there models of computation more powerful than Turing machines? Solution Simulation! Simulate M1 from M2. Simulate M2 from M1. Models more powerful than TM’s Problem Are there models of computation more powerful than Turing machines? Solution Nobody knows if there are more powerful models. However, there are many computational models equivalent in power to TM’s. They are called Turing-complete systems. Problem How do you prove the functional equivalence of two given com- putation models M1 and M2, i.e., M1 ⇔ M2? Models more powerful than TM’s Problem Are there models of computation more powerful than Turing machines? Solution Nobody knows if there are more powerful models. However, there are many computational models equivalent in power to TM’s. They are called Turing-complete systems. Problem How do you prove the functional equivalence of two given com- putation models M1 and M2, i.e., M1 ⇔ M2? Solution Simulation! Simulate M1 from M2.
    [Show full text]