Atlas home || Conferences | Abstracts | about Atlas

21st Days of Weak Arithmetics
June 7-9, 2002
Steklov Institute of Mathematics
St. Petersburg, Russia

Organizers
Paola d'Aquino (Italy), Anatoly Beltiukov (Russia), Patrick Cegielski (France), Gregory Kucherov (France), Krzysztof Lorys (Poland), Yuri Matiyassevich (Russia), the chairman, Jean-Pierre Ressayre (France), Denis Richard (France), Maxim Vsemirov (Russia)

Abstracts

This is an archive of abstracts accepted to this conference. For more listing and sorting options, see the active list.

Tatiana Azhimova Multidomain algebra of Database with ER-model
Anatoly Beltiukov Constructive Second Order Weak Arithmetic with Extracting Polynomial Time Algorithms
Kamila Bendova Theory with miltiplication and ordering as a theory of N
C. Dimitracopoulos A note on end extensions
Henri-Alex Esbelin Modular exponential in recursive and weak arithmetic complexity classes
Oleg Eterevsky On the Number of Prime Divisors of Higher-Order Carmichael Numbers
Mikhail Gelfand Computaional biology
Tatyana Matveevna Kossovskaya On complexity of decidability of constant modulo arithmetic
Gregory Kucherov Repetitions in DNA sequences
Dmitry A. Koval and Leonid P. Lisovik The class of continuous functions given by strict finite R-transducers is not too simple
S.N. Manukian On binary recursively enumerable fuzzy sets(supported by Intas 2000-447)
Chris Pollett On the Bounded Version of Hilbert's Tenth Problem
Jean-Pierre Ressayre Bootstrapping
K.V. Shahbazyan Logically Definable Languages of Computations in one Class of Flow Event Structures
Alexandra Shlapentokh Existential definability with bounds on archimedean valuations.
Anatol Slissenko A Logic of Probability with Decidable Model-checking
Christophe Troestler Equivalence of Scalar- and Vector-recursion for BSS Machines
I..D. Zaslavsky On the completeness properties of the systems of symmetric construstive and three-valued logic