Информационная система "Конференции"

Abstracts

Computability theory

The talk is aimed to show the new results of the authors on Rogers semilattices for the families of sets in Ershov's hierarchy and to discuss similarities and differences of the algebraic and elementary properties of these semilattices in contrary with the semilattices of computable numberings of the families of the arithmetical sets.

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home