The Ackermann functions are not optimal, but by how much?

Journal of Symbolic Logic 75 (1):289-313 (2010)
  Copy   BIBTEX

Abstract

By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of primitive recursive degrees

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1264433922

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

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

Wittgenstein's Fairy Tale.Inge Ackermann, Robert Ackermann & Betty Hendricks - 1978 - Analysis 38 (3):159 - 160.
Time of day effects on problem solving: When the non-optimal is optimal.Mareike B. Wieth & Rose T. Zacks - 2011 - Thinking and Reasoning 17 (4):387 - 401.
Financial markets can be at sub-optimal equilibria.Mark Bedau - manuscript
Aus dem briefwechsel wilhelm ackermanns.Hans Richard Ackermann - 1983 - History and Philosophy of Logic 4 (1-2):181-202.
A model of choice from lists.Ariel Rubinstein - unknown
Sentential constants in systems near R.John Slaney - 1993 - Studia Logica 52 (3):443 - 455.
On the expressiveness of frame satisfiability and fragments of second-order logic.Thomas Eiter & Georg Gottlob - 1998 - Journal of Symbolic Logic 63 (1):73-82.
Converse Ackermann croperty and semiclassical negation.José M. Méndez - 1988 - Studia Logica 47 (2):159 - 168.
The generalized harmonic mean and a portfolio problem with dependent assets.Masaaki Kijima - 1997 - Theory and Decision 43 (1):71-87.
On the identification of properties and propositional functions.George Bealer - 1989 - Linguistics and Philosophy 12 (1):1 - 14.
Help the low skilled or let the hardworking thrive? A study of fairness in optimal income taxation.Francois Maniquet - manuscript
Local connectedness and distance functions.Charles Morgan - unknown
Social Structure, Economic Performance and Pareto Optimality.Paul D. Thistle - 1998 - Theory and Decision 45 (2):161-173.

Analytics

Added to PP
2010-09-12

Downloads
26 (#615,896)

6 months
8 (#373,162)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof lengths for instances of the Paris–Harrington principle.Anton Freund - 2017 - Annals of Pure and Applied Logic 168 (7):1361-1382.

Add more citations

References found in this work

Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Hierarchies of number-theoretic functions. I.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (1-2):39-51.
Hierarchies of number-theoretic functions II.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):97-113.

Add more references