A Hierarchy of Primitive Recursive Functions

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (22):331-346 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19630092202

Links

PhilArchive



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

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

Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus-Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
A Hierarchy of Primitive Recursive Functions.J. P. Cleave - 1963 - Mathematical Logic Quarterly 9 (22):331-346.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
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.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
The Ackermann functions are not optimal, but by how much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
A foundation for real recursive function theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.

Analytics

Added to PP
2016-02-04

Downloads
33 (#459,370)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Elementary Functions and LOOP Programs.Zlatan Damnjanovic - 1994 - Notre Dame Journal of Formal Logic 35 (4):496-522.
The Equivalence of Different Hierarchies of Elementary Functions.G. T. Herman - 1971 - Mathematical Logic Quarterly 17 (1):219-224.
The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.

Add more citations

References found in this work

Graphschemata und rekursive funktionen.von Rózsa Péter - 1958 - Dialectica 12 (3‐4):373-393.

Add more references