Computable Numberings of Families of Infinite Sets › Research Explorer

Novosibirsk State University's Research Portal

Computable Numberings of Families of Infinite Sets

Research output: Contribution to journal › Article › peer-review

General Informatics Section

DOI

https://doi.org/10.1007/s10469-019-09540-4
Final published version

M. V. Dorzhieva

Original language	English
Pages (from-to)	224-231
Number of pages	8
Journal	Algebra and Logic
Volume	58
Issue number	3
DOIs	https://doi.org/10.1007/s10469-019-09540-4
Publication status	Published - 1 Jul 2019

Research areas

analytical hierarchy, computability, computable numberings, Friedberg numbering, Gödel’s axiom of constructibility, Godel's axiom of constructibility, AXIOM

OECD FOS+WOS

ID: 22338498