Skip to main content
Conference Proceedings

Skolem + Tetration is well-ordered

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5635 LNCS 11-20
DOI: 10.1007/978-3-642-03073-4_2
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of whether a certain set of number-theoretic functions - defined via tetration (i.e. iterated exponentiation) - is well-ordered by the majorisation relation, was posed by Skolem in 1956. We prove here that indeed it is a computable well-order, and give a lower bound τ0 on its ordinal. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Barra, M., & Gerhardy, P. (2009). Skolem + Tetration is well-ordered. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 11–20). https://doi.org/10.1007/978-3-642-03073-4_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free