|
This article is cited in 8 scientific papers (total in 8 papers)
Decidable Computable $\mathbb A$-Numberings
V. G. Puzarenko Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
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.
Keywords:
admissible set, numbering.
Received: 29.10.2000 Revised: 28.09.2001
Citation:
V. G. Puzarenko, “Decidable Computable $\mathbb A$-Numberings”, Algebra Logika, 41:5 (2002), 568–584; Algebra and Logic, 41:5 (2002), 314–322
Linking options:
https://www.mathnet.ru/eng/al197 https://www.mathnet.ru/eng/al/v41/i5/p568
|
Statistics & downloads: |
Abstract page: | 328 | Full-text PDF : | 110 | References: | 37 | First page: | 1 |
|