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

Algebra Logika, 2002 Volume 41, Number 2, Pages 155–165 (Mi al178)

This article is cited in 1 paper

Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy

Yu. D. Korolkov


Abstract: The complexity of index sets of families of general recursive functions is evaluated in the Kleene – Mostowski arithmetic hierarchy.

Keywords: general recursive function, computable family of general recursive functions, discrete family of general recursive functions, effectively discrete family of general recursive functions.

UDC: 510.5

Received: 30.05.1999


 English version:
Algebra and Logic, 2002, 41:2, 87–92

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024