Andreas Weiermann. An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions. Discrete Mathematics and Theoretical Computer Science, vol. 6 no. 1 , pp. 133–141 [Book Review]

Bulletin of Symbolic Logic 11 (1):89-89 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s107989860000353x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

An Application of Results by Hardy, Ramanujan and Karamata to Ackermannian Functions.Andreas Weiermann - 2005 - Bulletin of Symbolic Logic 11 (1):89-89.
Classifying the phase transition threshold for Ackermannian functions.Eran Omri & Andreas Weiermann - 2009 - Annals of Pure and Applied Logic 158 (3):156-162.
Discrete Mathematics and Theoretical Computer Science. [REVIEW]Albert A. Mullin - 2005 - Bulletin of Symbolic Logic 11 (1):89-89.
Discrete Mathematics.S. K. Chakraborty & B. K. Sarkar - 2011 - Oxford University Press India.
Discrete and continuous: a fundamental dichotomy in mathematics.James Franklin - 2017 - Journal of Humanistic Mathematics 7 (2):355-378.
A Uniform Approach to Fundamental Sequences and Hierarchies.Wilfried Buchholz, Adam Cichon & Andreas Weiermann - 1994 - Mathematical Logic Quarterly 40 (2):273-286.
Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly.Edward G. Belaga & Maurice Mignotte - 2006 - Discrete Mathematics and Theoretical Computer Science.
Logic and Random Structures: DIMACS Workshop, November 5-7, 1995.Ravi Bopu Boppana & Dimacs - 1997 - American Mathematical Soc..
Partnership and Partition: A Case Study of Mathematical Exchange.Adrian Rice - 2015 - Philosophia Scientiae 19:115-134.
Zen, Mathematics, and Rāmānujan: Uncommon Links.Masato Mitsuda - 2016 - Culture and Dialogue 4 (1):25-47.
A uniform approach for characterizing the provably total number-theoretic functions of KPM and its subsystems.Benjamin Blankertz & Andreas Weiermann - 1999 - Studia Logica 62 (3):399-427.
Vereinfachte Kollabierungsfunktionen und ihre Anwendungen.Andreas Weiermann - 1991 - Archive for Mathematical Logic 31 (2):85-94.
How Is it That Infinitary Methods Can Be Applied to Finitary Mathematics? Godel's T: A Case Study.Andreas Weiermann - 2002 - Bulletin of Symbolic Logic 8 (3):435-436.
Reverse mathematics and well-ordering principles.Michael Rathjen & Andreas Weiermann - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific.
A term rewriting characterization of the polytime functions and related complexity classes.Arnold Beckmann & Andreas Weiermann - 1996 - Archive for Mathematical Logic 36 (1):11-30.

Analytics

Added to PP
2014-03-20

Downloads
10 (#1,193,888)

6 months
3 (#976,558)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references