On the Algebraic Structure of Primitive Recursive Functions

Mathematical Logic Quarterly 31 (35-36):551-556 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19850313503

Links

PhilArchive



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

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

On the Algebraic Structure of Primitive Recursive Functions.István Szalkai - 1985 - Mathematical Logic Quarterly 31 (35‐36):551-556.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
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.
Some Hierarchies of Primitive Recursive Functions on Term Algebras.Klaus-Hilmar Sprenger - 1997 - Mathematical Logic Quarterly 43 (2):251-286.
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.
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.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
On Evolving of Recursive Functions using λ-abstraction and Higher-order Functions.Martin Dostál - 2005 - Logic Journal of the IGPL 13 (5):515-524.

Analytics

Added to PP
2015-12-02

Downloads
26 (#615,896)

6 months
1 (#1,478,830)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Primitive iteration and unary functions.G. Germano & S. Mazzanti - 1988 - Annals of Pure and Applied Logic 40 (3):217-256.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.

Add more citations

References found in this work

Mathematical logic.J. Donald Monk - 1976 - New York: Springer Verlag.
Simplifications of the recursion scheme.M. D. Gladstone - 1971 - Journal of Symbolic Logic 36 (4):653-665.
A reduction of the recursion scheme.M. D. Gladstone - 1967 - Journal of Symbolic Logic 32 (4):505-508.

Add more references