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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
Equivalence of some Hierarchies of Primitive Recursive Functions.Keith Harrow - 1979 - Mathematical Logic Quarterly 25 (25‐29):411-418.
On Rudimentarity, Primitive Recursivity and Representability.Saeed Salehi - 2020 - Reports on Mathematical Logic 55:73–85.
Density and Baire category in recursive topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (4-5):381-391.

Analytics

Added to PP
2009-01-28

Downloads
70 (#300,055)

6 months
12 (#294,748)

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