- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Ackermann functions are not optimal, but by how much?
Journal of Symbolic Logic 75 (1):289-313 (2010)
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 degreesOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
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.
Aus dem briefwechsel wilhelm ackermanns.Hans Richard Ackermann - 1983 - History and Philosophy of Logic 4 (1-2):181-202.
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.
Analytics
Added to PP
2010-09-12
Downloads
118 (#399,875)
6 months
5 (#1,626,749)
2010-09-12
Downloads
118 (#399,875)
6 months
5 (#1,626,749)
Historical graph of 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.
References found in this work
P. G. Odifreddi. Classical recursion theory. Volume II. Studies in logic and the foundations of mathematics, vol. 143. Elsevier, Amsterdam etc. 1999, xvi + 949 pp.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.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation