Some restrictions on simple fixed points of the integers
Journal of Symbolic Logic 54 (4):1324-1345 (1989)
| Abstract | 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesZlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Robert A. Di Paola (1981). A Lift of a Theorem of Friedberg: A Banach-Mazur Functional That Coincides with No Α-Recursive Functional on the Class of Α-Recursive Functions. Journal of Symbolic Logic 46 (2):216 - 232.
Juha Oikkonen (1992). A Recursion Principle for Linear Orderings. Journal of Symbolic Logic 57 (1):82-96.
Carl G. Jockusch Jr & Alexandra Shlapentokh (1995). Weak Presentations of Computable Fields. Journal of Symbolic Logic 60 (1):199 - 208.
Carl G. Jockusch Jr & Alexandra Shlapentokh (1995). Weak Presentations of Computable Fields. Journal of Symbolic Logic 60 (1):199 - 208.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Charles Rackoff (1976). On the Complexity of the Theories of Weak Direct Powers. Journal of Symbolic Logic 41 (3):561-573.
James C. Owings Jr (1989). A Cardinality Version of Biegel's Nonspeedup Theorem. Journal of Symbolic Logic 54 (3):761-767.
Erik Ellentuck (1981). Hyper-Torre Isols. Journal of Symbolic Logic 46 (1):1-5.
Alexandra Shlapentokh (2002). Generalized Weak Presentations. Journal of Symbolic Logic 67 (2):787-819.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
