2009: Joint seminar St. Petersburg logic group and KGRC

June 4-6, 2009, the workshop Finitary & Infinitary Logic took place at the KGRC, with the St. Petersburg logic group. (Funded by the FWF and RFBR joint seminars program, project A310-N18),

Here is the program:

Thursday 4th

09:00 - 09:45    Yu.Matiyasevich    Computation paradigms in light of Hilbert's tenth problem
10:00 - 10:45    M.Vsemirnov    Diophantine encoding
11:00 - 11:45    V.Orevkov    Cut and an induction scheme for resolution method

Lunch at the KGRC

14:00 - 14:45    S.Friedman    The descriptive set theory of finite structures
15:00 - 15:45    E.Fokina    Applications of Kolmogorov complexity to computable model theory
16:00 - 16:45    M.Goldstern    Clones

Friday 5th

09:00 - 09:45    E.Girsh    Complete problems from secure encryption to optimal proof systems
10:00 - 10:45    S.Nikolenko    Feebly secure cryptographic primitives
11:00 - 11:45    D.Itsykson    Average-case complexity of randomized computations with bounded error
    
Lunch at the KGRC

14:00 - 14:45    A.Walczak-Typke    Stable model theory
15:00 - 15:45    D.Weller    CERES: a program for cut-elimination
16:00 - 16:45    P.Welch    Infinite-time register machines

Saturday 6th

14:00 - 14:45    Yu.Matiyasevich    Diophantine flavor of Kolmogorov complexity
15:00 - 15:45    A.Kulikov    On convex complexity measures
16:00 - 16:45    Discussion of future collaborations