About: Hardy hierarchy   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The Hardy hierarchy is a certain hierarchy mapping ordinals \(\alpha\) to functions \(H_\alpha: \mathbb{N} ightarrow \mathbb{N}\). For large ordinals \(\alpha\), \(H_\alpha\) grows extremely fast. The Hardy hierarchy is named after G. H. Hardy, who first described it in his 1904 paper "A theorem concerning the infinite cardinal numbers". It is less known than its speedier cousin, the fast-growing hierarchy. However, it can on occasion be more useful than the fast-growing hierarchy; for example, it can more easily be related to the numbers resulting from Goodstein sequences.

AttributesValues
rdfs:label
  • Hardy hierarchy
rdfs:comment
  • The Hardy hierarchy is a certain hierarchy mapping ordinals \(\alpha\) to functions \(H_\alpha: \mathbb{N} ightarrow \mathbb{N}\). For large ordinals \(\alpha\), \(H_\alpha\) grows extremely fast. The Hardy hierarchy is named after G. H. Hardy, who first described it in his 1904 paper "A theorem concerning the infinite cardinal numbers". It is less known than its speedier cousin, the fast-growing hierarchy. However, it can on occasion be more useful than the fast-growing hierarchy; for example, it can more easily be related to the numbers resulting from Goodstein sequences.
sameAs
dcterms:subject
abstract
  • The Hardy hierarchy is a certain hierarchy mapping ordinals \(\alpha\) to functions \(H_\alpha: \mathbb{N} ightarrow \mathbb{N}\). For large ordinals \(\alpha\), \(H_\alpha\) grows extremely fast. The Hardy hierarchy is named after G. H. Hardy, who first described it in his 1904 paper "A theorem concerning the infinite cardinal numbers". It is less known than its speedier cousin, the fast-growing hierarchy. However, it can on occasion be more useful than the fast-growing hierarchy; for example, it can more easily be related to the numbers resulting from Goodstein sequences. The functions are defined as follows: * \(H_0(n) = n\) * \(H_{\alpha+1}(n) = H_\alpha(n+1)\) * \(H_\alpha(n) = H_{\alpha[n]}(n)\) if \(\alpha\) is a limit ordinal \(\alpha[n]\) denotes the \(n\)th term of fundamental sequence assigned to ordinal \(\alpha\). Definitions of \(\alpha[n]\) can vary, giving different versions of the Hardy hierarchy. One hierarchy, the Wainer hierarchy, is explained at the article for the fast-growing hierarchy. It can be shown that Hardy hierarchy has the property: \(H_{\alpha+\beta}(n) = H_{\alpha}(H_{\beta}(n))\).
is wikipage disambiguates of
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] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software