R. Sh. Omanadze, “Complexity properties of recursively enumerable sets and <nobr>$bsQ$</nobr>-completeness”, Mat. Zametki, 2000, Volume 68, Issue 4,Pages <nobr>554–559</nobr>

RUS ENG

JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 2000 Volume 68, Issue 4, Pages 554–559 (Mi mzm975)

This article is cited in 2 papers

Complexity properties of recursively enumerable sets and $bsQ$-completeness

R. Sh. Omanadze

Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics

UDC: 510.5

Received: 25.05.1999

DOI: 10.4213/mzm975

English version: Mathematical Notes, 2000, 68:4, 476–480

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026