Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
(December 16–18, 2009, Moscow)

Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science", Moscow, December 16–18, 2009
	December 16, 2009 (Wed)
1.	Hilbert's tenth problem and the models of computational processes Yu. V. Matiyasevich December 16, 2009 16:05, Moscow
2.	Точная квадратичная оценка длины вывода в одной системе подстановок Туэ S. I. Adian December 16, 2009 17:30, Moscow
	December 17, 2009 (Thu)
3.	Flag algebras A. A. Razborov December 17, 2009 10:30, Moscow
4.	Diophantine coding and generalized Cantor polynomials M. A. Vsemirnov December 17, 2009 11:45, Moscow
5.	Provability algebra and sparse topology L. D. Beklemishev December 17, 2009 12:50, Moscow
	December 18, 2009 (Fri)
6.	Quadratic equations in a free monoid I. G. Lysenok December 18, 2009 10:30, Moscow
7.	Optimal proof systems and algorithms (review) E. A. Hirsch December 18, 2009 12:00, Moscow
8.	On some classes of Boolean schemes of bounded depth V. V. Podolskii December 18, 2009 16:00, Moscow
9.	Structural complexity of probabilistic algorithms for bounded-error D. M. Itsykson December 18, 2009 17:00, Moscow