OpenLink Software

Usage stats on Down-arrow notation

 Permalink

an Entity in Data Space: dbkwik.org

\[a \downarrow b = a^b\] \[a \downarrow^n 1 = a\] \[a \downarrow^{n + 1} (b + 1) = (a \downarrow^{n +1} b) \downarrow^n a ext{ (otherwise)}\] \(a \downarrow^n b\) is a shorthand for \(a \downarrow\downarrow\cdots\downarrow\downarrow b\) with n down-arrows. When \(n = 2\), \(a \downarrow\downarrow b = a^{a^{b-1}}\). The inequality \(a \downarrow\downarrow a = a^{a^{a-1}} < a^{a^a} = a \uparrow\uparrow 3\) is useful when bounding down-arrows in terms of up-arrows. It can be shown that \(a \downarrow^{2n-1} b \ge a \uparrow^n b\) for \(a, b, n \ge 1\).

Graph IRICount
http://dbkwik.webdatacommons.org10
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Copyright © 2009-2012 OpenLink Software