RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2019 Volume 58, Number 3, Pages 334–343 (Mi al898)

This article is cited in 3 papers

Computable numberings of families of infinite sets

M. V. Dorzhieva

Novosibirsk State University

Abstract: We state the following results: the family of all infinite computably enumerable sets has no computable numbering; the family of all infinite $\Pi^{1}_{1}$ sets has no $\Pi^{1}_{1}$-computable numbering; the family of all infinite $\Sigma^{1}_{2}$ sets has no $\Sigma^{1}_{2}$-computable numbering. For $k>2$, the existence of a $\Sigma^{1}_{k}$-computable numbering for the family of all infinite $\Sigma^{1}_{k}$ sets leads to the inconsistency of $ZF$.

Keywords: computability, analytical hierarchy, computable numberings, Friedberg numbering, Gödel's axiom of constructibility.

UDC: 510.5

Received: 27.01.2018
Revised: 24.09.2019

DOI: 10.33048/alglog.2019.58.303


 English version:
Algebra and Logic, 2019, 58:3, 224–231

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026