Some restrictions on simple fixed points of the integers

Journal of Symbolic Logic 54 (4):1324-1345 (1989)
A function is recursive (in given operations) if its values are computed explicitly and uniformly in terms of other "previously computed" values of itself and (perhaps) other "simultaneously computed" recursive functions. Here, "explicitly" includes definition by cases. We investigate those recursive functions on the structure $\mathbf{N} = \langle \omega, 0, \operatorname{succ,pred}\rangle$ that are computed in terms of themselves only, without other simultaneously computed recursive functions
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274817
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,470
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

12 ( #355,468 of 1,925,550 )

Recent downloads (6 months)

1 ( #418,152 of 1,925,550 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.