Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2015 Volume 15, Issue 1, Pages 54–62
(Mi vngu362)
|
This article is cited in
2 papers
Computable families of sets in Ershov hierarchy without principal numberings
S. S. Ospichev Novosibirsk State University
Abstract:
There was constructed example of computable family of sets without
$\Sigma^{-1}_{a}$-principal numberings, for any
$a\in\mathcal{O}$.
Keywords:
computable numbering, Ershov hierarchy.
UDC:
510.10+
510.57 Received: 28.01.2013
© , 2024