International conference
"Logic and Applications"

Workshop on Computability

May 2, 2000 (Room 417)

• 10.00--10.50 O. Kudinov. The complexity of countable models and the problem of existence of a computable model
• 11.30--12.20 S. Badaev. Computable numberings
• 15.00--15.50 A. Morozov. Sigma-presentability of groups of sigma-permutations
• 16.00--18.00 Discussions and sections (chairman - S.S.Goncharov)

May 3, 2000 (Room 417)

• 10.00--10.50 M. Arslanov. The theory of the enumeration degrees below 0' and the relative enumerability
• 11.30--12.20 M. Peretyat'kin. Semantic similarity relations of theories over Cartesian and Universal lists
• 15.00--15.50 V. Selivanov. On two conjectures of W. Wadge
• 16.00--18.00 Discussion of plans, sections (chairman - S.B.Cooper)