International conference
"Logic and Applications"

Program of Conference

9.30 Opening of the conference
9.30--10.30 Yu. Ershov. Wonderful extensions of the field of rational numbers
10.30--10.45 Coffee break
10.45--13.00 Congratulation
13.00--14.00 Lunch
14.00--14.45 A. Macintyre. Model theory of Frobenius on Witt vectors. A variation on Ax--Kochen--Ershov
14.45--15.30 S. S. Goncharov. Constructive models and computable numberings
15.30--15.45 Coffee break
15.45--16.25 V. Remeslennikov. Algebraic geometry over groups: logical foundations of the theory
16.25--17.05 V. Tselishchev. Lowenheim-Skolem theorem and rationality in mathematics
18.00 Banquet

9.00--9.50 S. B. Cooper. On the intensionality of Turing definitions
9.55--10.45 U. Berger. Minimisation vs. recursion in higher types
11.00--11.50 K. Ambos-Spies. Resource-bounded randomness and computational complexity
11.55--12.45 V. Latyshev. General version of the standard basis
12.45--14.00 Lunch
14.00--14.50 S. Vassilyev, A. Zherlov. Calculi of formulas with type quantifiers: strategies and modifiers
14.55--15.45 V. Vasenin. Informational technologies for science and education
16.00--16.50 A. Miasnikov. On elementary theory of free groups
17.00--18.00 Sections

9.00--9.50 K. Weihrauch. Computable analysis
9.55--10.45 A. Ol'shanskii, M. Sapir. New constructions of finitely presented groups
11.00--11.50 A. Voronkov. Herbrand's theorem and automated reasoning
11.55--12.45 D. Hirschfeldt. Structure and nonstructure in computable model theory
12.45--14.00 Lunch
14.00--14.50 E. Khukhro. Rank analogs of some theorems on groups
14.55--15.45 M. Volkov. Algorithmic problems for finite semigroups and finite automata
16.00--18.00 Sections
18.00 Closing of the conference