{{menu|Events}}
June 4-6, 2009, the workshop ''Finitary & Infinitary Logic'' took 
place at the KGRC, with the
[http://logic.pdmi.ras.ru/ St. Petersburg logic group].
(Funded by the FWF and RFBR joint seminars program, project A310-N18),

Here is the program:

<table border=0>
<tr>
<th colspan=3>
=== Thursday 4th ===
</th>
</tr>

<tr>
<td>09:00&nbsp;-&nbsp;09:45</td>
<td>'''Yu.Matiyasevich'''</td>
<td>Computation paradigms in light of Hilbert's tenth problem</td>
</tr>

<tr>
<td>10:00&nbsp;-&nbsp;10:45</td>
<td>'''M.Vsemirnov'''</td>
<td>Diophantine encoding</td>
</tr>

<tr>
<td>11:00&nbsp;-&nbsp;11:45</td>
<td>'''V.Orevkov'''
<td>Cut and an induction scheme for resolution method</td>
</tr>

<tr>
<td></td>
<td colspan=2 align=center>Lunch at the KGRC</td>
</tr>

<tr>
<td>14:00&nbsp;-&nbsp;14:45</td>
<td>'''S.Friedman'''</td>
<td>The descriptive set theory of finite structures</td>
</tr>

<tr>
<td>15:00&nbsp;-&nbsp;15:45</td>
<td>'''E.Fokina'''</td>
<td>Applications of Kolmogorov complexity to computable model theory</td>
</tr>

<tr>
<td>16:00&nbsp;-&nbsp;16:45</td>
<td>'''M.Goldstern'''</td>
<td>Clones</td>
</tr>

<tr>
<th colspan=3>
=== Friday 5th ===
</th>
</tr>

<tr>
<td>09:00&nbsp;-&nbsp;09:45</td>
<td>'''E.Girsh'''</td>
<td>Complete problems from secure encryption to optimal proof systems</td>
</tr>

<tr>
<td>10:00&nbsp;-&nbsp;10:45</td>
<td>'''S.Nikolenko'''</td>
<td>Feebly secure cryptographic primitives</td>
</tr>

<tr>
<td>11:00&nbsp;-&nbsp;11:45</td>
<td>'''D.Itsykson'''</td>
<td>Average-case complexity of randomized computations with bounded error</td>
</tr>

<tr>
<td></td>
<td colspan=2 align=center>Lunch at the KGRC</td>
</tr>

<tr>
<td>14:00&nbsp;-&nbsp;14:45</td>
<td>'''A.Walczak-Typke'''</td>
<td>Stable model theory</td>
</tr>

<tr>
<td>15:00&nbsp;-&nbsp;15:45</td>
<td>'''D.Weller'''</td>
<td>CERES: a program for cut-elimination</td>
</tr>

<tr>
<td>16:00&nbsp;-&nbsp;16:45</td>
<td>'''P.Welch'''</td>
<td>Infinite-time register machines</td>
</tr>

<tr>
<th colspan=3>
=== Saturday 6th ===
</th>
</tr>

<tr>
<td>14:00&nbsp;-&nbsp;14:45</td>
<td>'''Yu.Matiyasevich'''</td>
<td>Diophantine flavor of Kolmogorov complexity</td>
</tr>

<tr>
<td>15:00&nbsp;-&nbsp;15:45</td>
<td>'''A.Kulikov'''</td>
<td>On convex complexity measures</td>
</tr>

<tr>
<td>16:00&nbsp;-&nbsp;16:45</td>
<td></td>
<td>Discussion of future collaborations</td>
</tr>

</table>