A -set of natural numbers which is not enumerable by natural numbers.
On effective presentations of formal concept lattices.
On the problem of finite signature.
On the relation of -reducibility between admissible sets.
On the index sets of -subsets of the real numbers.
Elementary submodels of parametrizable models.
About the admissible predicates on admissible sets.
On a hierarchy of groups of computable automorphisms.
Boolean algebras with finite families of computable automorphisms.
On computable formal concepts in computable formal contexts.
9th Asian Logic Conference, Novosibirsk, Russia, 16--19 August 2005.
Yurij Leonidovich Ershov (On the occasion of his 60th birthday).
Page 1