Abstract
The article deals in the numbering theory for admissible sets, brought in sight in [1]. For models of two special classes, we resolve the problem of there being 1-1 computable numberings of the families of all computable sets and of all computable functions. In proofs, for the former case the role of finite objects is played by syntactic constructions, and for the latter — by finite subsets on hereditarily finite superstructures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have