Wednesday, May 26

9:00 - 10:00	Receiption
10:00 - 10:10	Opening
10:10 - 10:40	Sergei Artemov Moscow University, Cornell University	Formalization of Brouwer-Heyting-Kolmogorov semantics for intuitionistic logic
10:50 - 11:20	Valeri Plisko Moscow University	n-realizability and its predicate logic
11:30 - 12:00	Coffee-break
11:00 - 12:30	Eduard Karavaev St.Petersburg University	Deontic logic and some calculations
12:40 - 14:20	Lunch
14:20 - 14:50	Grigori Mints Stanford University	Interpolation theorems for intuitionistic predicate logic
15:00 - 15:30	Dimiter Skordev Sofia University	On the computer proof of a result in the abstract theory of segments
15:40 - 16:10	Coffee-break
16:10 - 16:40	Rostislav Yavorsky Steklov Mathematical Institute, Moscow	Probability logics with quantifies on proofs
16:50 - 17:20	Tatiana L. Yavorskaja (Sidon) Moscow University	Nonaxiomatizability of first order logics of proofs

Thursday, May 27

9:30 - 10:00	Lew Gordeew Tuebingen University	Finite methods in 1-order formalism
10:10 - 10:40	Vladimir Krupski Moscow University	On proof term representations for deterministic operations on proofs
10:50 - 11:20	Coffee-break
11:20 - 11:50	Rosalie Iemhoff University of Amsterdam	On the admissible rules of intuitionistic propositional logic
12:00 - 12:30	Zhaohui Luo University of Durham Sergey Soloviev University Paul Sabatier, Toulouse	Coercion completion and conservativity in coercive subtyping
12:40 - 14:20	Lunch
14:20 - 14:50	Regimantas Pliuskevicius Institute of Mathematics and Informatics, Vilnius	On effective deductive procedure for a restricted first-order linear temporal logic
15:00 - 15:30	Nicolai Vorobjov University of Bath	Computing the complexification of a semialgebraic sets
15:40 - 16:10	Coffee-break
16:10 - 16:40	Nikolai Kossovski St.Petersburg University	Decidability complexity of quantifier-free negationless theory of field of rational numbers
16:50 - 17:20	Vladimir Lifschitz University of Texas, Austin	Calculational proofs

Friday, May 28

9:30 - 10:00	Petr Hajek Institute of Computer Science, Prague	Decidability of t-tautologies
10:10 - 10:40	Anatoly Beltiukov Udmurt University, Izhevsk	Recognising complexity of true regular protothetics formulas with partially ordered quantifiers
10:50 - 11:20	Coffee-break
11:20 - 11:50	Ulrich Kohlenbach University of Aarhus	The computational strength of extensions of weak Konig's lemma
12:00 - 12:30	Gennady Davydov Institute of Transport Problems, St.Petersburg Inna Davydova St.Petersburg University	Logical operations research
12:40 - 14:20	Lunch
14:20 - 14:50	Daniele Beauquier Anatol Slissenko University Paris 12	A logic for specifications of timed algorithms
15:00 - 15:30	Sergei Bogomolov LGTCM Soft Lab, St.Petersburg	Logic programming with temporal constraint graphs
15:40 - 16:10	Enn Tyugu Royal Institute of Technology, Stockholm	Which logic to use for program specifications?

Saturday, May 29

9:30 - 9:55	Alexander A. Ivanov Steklov Institute of Mathematics, St.Petersburg	On topological works of N.A.Shanin
9:55 - 10:20	Grigori Mints Stanford University	On proof search under N.A.Shanin
10:20 - 10:45	Vladimir Lifschits University of Texas, Austin	N.A.Shanin and constructivism
10:45 - 11:00	Coffee-break
11:00 - 12:00	Nikolai A. Shanin Steklov Institute of Mathematics, St.Petersburg	Finitary version of mathematical analysis as a result of the development of theory of functional spaces in classical mathematics
12:00 - 13:00	Discussion, recollections, greetings, congratulations
13:00 - 14:30	Lunch
14:45 - 17:45	Bus excursion around the city
18:30 - ...	Banquet

Back to the conference main page.