Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T20:51:50.434Z Has data issue: false hasContentIssue false

On primitive recursive permutations and their inverses1

Published online by Cambridge University Press:  12 March 2014

Frank B. Cannonito
Affiliation:
University of California, Irvine
Mark Finkelstein
Affiliation:
University of California, Irvine

Extract

It has been known for some time that there is a primitive recursive permutation of the nonnegative integers whose inverse is recursive but not primitive recursive. For example one has this result apparently for the first time in Kuznecov [1] and implicitly in Kent [2] or J. Robinson [3], who shows that every singularly recursive function ƒ is representable as

where A, B, C are primitive recursive and B is a permutation.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable