|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2008, Volume 5, Pages 1–7
(Mi semr85)
|
|
|
|
Research papers
On collection of all computable subsets on admissible sets
V. G. Puzarenko Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We study the existence of computable numberings of the set of all $\Delta$-predicates over admissible sets. We construct an admissible set whose set of all $\Delta$-predicates fails to have such a numbering and give a series of examples of admissible sets in which such numberings exist.
Received June 25, 2007, published January 24, 2008
Citation:
V. G. Puzarenko, “On collection of all computable subsets on admissible sets”, Sib. Èlektron. Mat. Izv., 5 (2008), 1–7
Linking options:
https://www.mathnet.ru/eng/semr85 https://www.mathnet.ru/eng/semr/v5/p1
|
|