An Exactification of the Monoid of Primitive Recursive Functions

&
Studia Logica 81 (1):1-18 (2005)
  Copy   BIBTEX

Abstract

We study the monoid of primitive recursive functions and investigate a onestep construction of a kind of exact completion, which resembles that of the familiar category of modest sets, except that the partial equivalence relations which serve as objects are recursively enumerable. As usual, these constructions involve the splitting of symmetric idempotents.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-005-2765-x

Links

PhilArchive



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

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

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.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
Fragments of $HA$ based on $\Sigma_1$ -induction.Kai F. Wehmeier - 1997 - Archive for Mathematical Logic 37 (1):37-49.
A proof-theoretic characterization of the primitive recursive set functions.Michael Rathjen - 1992 - Journal of Symbolic Logic 57 (3):954-969.

Analytics

Added to PP
2009-01-28

Downloads
37 (#399,294)

6 months
1 (#1,346,405)

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

Elementary Categories, Elementary Toposes.Colin McLarty - 1991 - Oxford, England: Oxford University Press.
Books Received. [REVIEW]Colin Mclarty - 1997 - Studia Logica 59 (1):143-146.

Add more references