Some Restrictions on Simple Fixed Points of the Integers
McColm, G. L.
J. Symbolic Logic, Tome 54 (1989) no. 1, p. 1324-1345 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 1989-12-14
Classification:  
@article{1183743102,
     author = {McColm, G. L.},
     title = {Some Restrictions on Simple Fixed Points of the Integers},
     journal = {J. Symbolic Logic},
     volume = {54},
     number = {1},
     year = {1989},
     pages = { 1324-1345},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183743102}
}

McColm, G. L. Some Restrictions on Simple Fixed Points of the Integers. J. Symbolic Logic, Tome 54 (1989) no. 1, pp.  1324-1345. http://gdmltest.u-ga.fr/item/1183743102/