9:00-10:00 | Registration | |||

10:00-12:00 | First session |
|||

10:00-10:10 | Opening | |||

10:10-10:40 | Jean-Pierre Ressayre,Boughattas Sedki | Bootstraping | ||

10:40-10:55 | Coffee break | |||

10:55-11:25 | Alexandra Shlapentokh | Existential Definability with Bounds on Archimedean Valuations | ||

11:30-12:00 | Chris Pollett | On the Bounded Version of Hilbert's Tenth Problem | ||

12:20-13:40 | Lunch | |||

14:00-16:35 | Second session |
|||

14:00-14:30 | Charlampos Cornaros,Constantinos Dimitracopoulos | A Note on End Extensions | ||

14:30-14:45 | Coffee break | |||

14:45-15:15 | Christophe Troestler | Equivalence of Scalar- and Vector- recursion for BSS Machines | ||

15:20-15:50 | Dmitry Koval,Leonid Lisovik | The Class of Continuous Functions Given by Strict Finite R-transducers is not too Simple | ||

15:50-16:05 | Coffee break | |||

16:05-16:35 | Henri-Alex Esbelin | Modular Exponential in Recursive and Weak Arithmetic Complexity Classes |

9:00-10:50 | Special session on relations with biology |
|||

9:00-9:505 | Mikhail Gelfand | Computational Biology | ||

9:50-10:10 | Coffee break | |||

10:10-10:50 | Gregory Kucherov | Repetitions in Genomes | ||

11:00-12:00 | Lunch | |||

12:00-18:00 | Excursion | |||

18:30-.. | Meeting's dinner |

9:30-12:05 | Third session |
|||

9:30-10:00 | Daniele Beauquier,Alexander Rabinovich,Anatol Slissenko | A Logic of Probability with Decidable Model-checking | ||

10:45-11:00 | Coffee break | |||

11:00-11:30 | Anatoly Beltiukov | Constructive Second Order Weak Arithmetic with Extracting Polynomial Time Algorithms | ||

11:35-12:05 | Oleg Eterevsky,Maxim Vsemirnov | On the Number of Prime Divisors of Higher-Order Carmichael Numbers | ||

12:20-13:40 | Lunch | |||

14:00-16:40 | Fourth session |
|||

14:00-14:30 | Kamila Bendova | Theory with Multiplication and Ordering as a Theory of N | ||

14:30-14:45 | Coffee break | |||

14:45-15:15 | Karine Shahbazyan,Yuri Shoukourian | Logically Definable Languages of Computations in one Class of Flow Event Structures | ||

15:20-15:50 | Nikolai Kossovski,Tatyana Kossovskaya | On Complexity of Decidability of Constant Modulo Arithmetic | ||

15:50-16:05 | Coffee break | |||

16:05-16:35 | Tatiana Azhimova(read by A. Beltiukov) | Multidomain algebra of Database with ER-model | ||

16:35-16:40 | Closing | |||

16:40-.. | Working meeting of INTAS project WP-447 |

Back to the main page of 21st Days of Weak Arithmetics. |