Some Hierarchies of Primitive Recursive Functions on Term Algebras

Mathematical Logic Quarterly 43 (2):251-286 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19970430208

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,314

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

A Hierarchy of Primitive Recursive Functions.J. P. Cleave - 1963 - Mathematical Logic Quarterly 9 (22):331-346.
Equivalence of some Hierarchies of Primitive Recursive Functions.Keith Harrow - 1979 - Mathematical Logic Quarterly 25 (25‐29):411-418.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Hierarchies of Primitive Recursive Functions.Charles Parsons - 1968 - Mathematical Logic Quarterly 14 (21-24):357-376.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Plain Bases for Classes of Primitive Recursive Functions.Stefano Mazzanti - 2002 - Mathematical Logic Quarterly 48 (1):93-104.
The Ackermann functions are not optimal, but by how much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Classifying the phase transition threshold for Ackermannian functions.Eran Omri & Andreas Weiermann - 2009 - Annals of Pure and Applied Logic 158 (3):156-162.

Analytics

Added to PP
2013-11-03

Downloads
25 (#975,183)

6 months
6 (#722,991)

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

Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.

View all 7 references / Add more references